<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Modified word representation vector based scalar weight for contextual text classification</title>
  </titleInfo>
  <name type="personal">
    <namePart>Abbas Saliimi Lokman</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
    <role>
      <roleTerm type="text">author.</roleTerm>
    </role>
  </name>
  <typeOfResource manuscript="yes">text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">my</placeTerm>
    </place>
    <dateIssued encoding="marc">2024</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
  </language>
  <physicalDescription>
    <extent>xii, 120 pages : illustration ; 1 CD-ROM</extent>
  </physicalDescription>
  <abstract>This thesis investigates contextual text classification, which is the process of categorising  textual data into different classes or categories based on its meaning within a given  context. Central to this process is the representation of words through vectors for  computational interpretation. Current practices employ Large Language Models (LLMs)  to generate contextualised word representation vectors, achieved through pre-training the  LLM on vast corpora that enables it to grasp intricate language patterns and context. For  contextual text classification, the pre-trained LLM is further train on classificationspecific labeled data in a process called fine-tuning. Although this approach is currently  considered the most optimal in the field, it poses a notable challenge due to the substantial  demand for computing resources stemming from the vast number of trainable parameters  in LLMs. Furthermore, although pre-trained LLMs can generate contextualised word  representation vectors, they lack the flexibility to modify the semantic significance of  these vectors outside of the LLM, necessitating fine-tuning for the modification of word  vectors. To bridge this gap, a five-phase research methodology is structured to propose  and evaluate an algorithm enabling the external modification of LLM-generated word  vectors using scalar values as the focus weightage. To validate this algorithm, the  modified word vectors are compared with original LLM-generated word vectors to  evaluate their reflection of the intended context. In addition, a contextual text  classification experiment is conducted using benchmarked datasets to assess the  performance of the modified word vectors in the targeted classification task. For this  experiment, the modified word vectors serve as input to train a Machine Learning (ML)  model for the text classification process, aiming for the developed ML model to have a  significantly smaller parameter count. This experiment aims to determine the  effectiveness of the modified word vectors in contextual text classification tasks, utilizing  a more computationally efficient approach. Based on the acquired results, the  experiments reveal that the modified word vectors algorithm can effectively alter original  LLM-generated word vectors to reflect intended contexts and can outperform baseline  scores in contextual text classification tasks. Evaluation metrics including Accuracy,  Precision, Recall, and F1 score are employed in the evaluation process, with Accuracy  and F1 score serving as primary metrics. The evaluation showcases significant  improvements, with the test ML model achieving a best accuracy score of 0.571, a 46%  increase from the baseline, and a best F1 score of 0.727, a 30% increment from the  baseline. Overall, this thesis presents five contributions: the proposed modified word  vectors algorithm, the new contextual classification dataset named QCoC, the efficient  question-type classifier based on the feed-forward neural network algorithm, the potential  transferability of the presented work to other domains, and the practical implications of  the presented work towards cases where computational resources are limited or costly.</abstract>
  <targetAudience authority="marctarget">specialized</targetAudience>
  <note type="statement of responsibility">Abbas Saliimi Lokman</note>
  <note>Faculty of Computing</note>
  <note>Thesis (Master of Science) -- Universiti Malaysia Pahang – 2022</note>
  <note>ncludes bibliographical referencesIncludes bibliographical references</note>
  <subject authority="lcsh">
    <name type="corporate">
      <namePart>Faculty of Computing</namePart>
    </name>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Universities and colleges</topic>
    <topic>Dissertations</topic>
  </subject>
  <subject authority="lcsh">
    <topic>Theses</topic>
    <topic>Dissertations</topic>
  </subject>
  <identifier type="isbn">THE0009940  (Local)</identifier>
  <recordInfo>
    <recordContentSource authority="marcorg">UMPSA</recordContentSource>
    <recordCreationDate encoding="marc">240902</recordCreationDate>
    <recordChangeDate encoding="iso8601">20251125110922.0</recordChangeDate>
    <languageOfCataloging>
      <languageTerm authority="iso639-2b" type="code">eng</languageTerm>
    </languageOfCataloging>
  </recordInfo>
</mods>
