<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>SCaLAR NITK at Touché: Comparative Analysis of Machine Learning Models for Human Value Identification</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Praveen K</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Darshan R K</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Chinta Tejdeep Reddy</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Anand Kumar M</string-name>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>National Institute of Technology Karnataka</institution>
          ,
          <addr-line>Surathkal, Mangaluru</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2024</year>
      </pub-date>
      <abstract>
        <p>This study delves into task of detecting human values in textual data by making use of Natural Language Processing (NLP) techniques. With the increasing use of social media and other platforms, there is an abundance in data that is generated. Finding human values in these text data will help us to understand and analyze human behavior in a better way, because these values are the core principle that influence human behavior. Analyzing these human values will help not only in research but also for practical applications such as sentiment evaluation, market analysis and personalized recommendation systems. The study tries to evaluate the performance of diferent existing models along with proposing novel techniques. Models used in this study range from simple machine learning model like SVM, KNN and Random Forest algorithms for classification using embeddings obtained from BERT till transformer models like BERT and RoBERTa for text classification and Large Language Models like Mistral-7b. The task that has be performed is a multilabel, multitask classification. QLoRA quantization method is used for reducing the size of weights of the model which makes it computationally less expensive for training and Supervised Fine Tuning (SFT) trainer is used for fine tuning LLMs for this specific task. It was found that LLMs performed better compared to all other models.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;Human Values</kwd>
        <kwd>SVM</kwd>
        <kwd>BERT</kwd>
        <kwd>RoBERTa</kwd>
        <kwd>Mistral</kwd>
        <kwd>SFT trainer</kwd>
        <kwd>QLoRA</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        In the present world, where everyone is digitally connected, huge volumes of text data are generated
and shared across various platforms including social media, scholarly articles etc. Within each of these
texts lie implicit indicators of human values which are core principles and beliefs that guide individuals’
actions, perceptions and decisions as mentioned in [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. These human values include stimulation,
hedonism, achievement, dominance, humility etc. Detecting and understanding human values in text is
not only essential for market research, brand sentiment analysis, and political discourse analysis but
also for applications such as personalized recommendation systems, content filtering, and social media
monitoring. Even though these values are often implicit, these values manifest in language through
expressions, sentiments and contextual cues. However, the automation of these human value detection
is a challenging task due to their abstract and subjective nature. Recent advancement in NLP have
opened up new possibilities for understanding languages at deeper levels.
      </p>
      <p>In recent years NLP have been extensively used for tasks such as information retrieval, sentiment
analysis etc. In this paper, we focus on the task of detecting human values in text using
state-of-theart NLP techniques. We aim to explore methodologies for automating this task by identifying and
categorizing values expressed in textual data. Throughout this paper, we delve into challenges associated
with detecting human values by discussing exiting approaches and methodologies. We the propose
novel techniques to increase accuracy and enhancing the performance of the model, with experiment
results. The study includes identifying human values in eight diferent languages. We make use of
existing language translation models to translate non-English sentences to English and then perform
classification.</p>
    </sec>
    <sec id="sec-2">
      <title>2. Background</title>
      <p>
        In addition to what is currently known about the identification of human values within arguments, the
researchers at Johannes Kiesel and colleagues’ efort "ValueEval: Identification of Human Values Behind
Arguments" [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] review the literature. They look into past studies and already defined approaches in this
area to provide a foundation for their own research. In an attempt to understand how human values
will be expressed and meaning will be derived in discussions, they go through a list of sources. Through
this literature study, they intend to close these knowledge and methodological gaps by developing their
own ValueEval methods. In order to group diferent perspectives on the topic, the researchers find
a range of disciplines, including psychology, linguistics, and computer science. Through this depth
focused research, they are trying to provide readers a greater understanding of the role that human
values play in arguments as well as how to identify and evaluate them. By combining the body of
previous research, the researchers expect to advance the development of techniques for understanding
and evaluating the values.
      </p>
      <p>
        Machine learning research frequently promotes performance more additional important factors like
cost and energy use. Using the LexGLUE benchmark, the study compares older versions (like SVM) with
more recent models (like BERT and GPT2)[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. During the testing and manufacturing facilities phases,
they evaluate timing, energy consumption, costs, and performance. Simpler models can frequently
outperform more intricate ones while consuming less efort and resources. This implies that while
selecting machine learning solutions, businesses should consider these extra considerations. It also
weights on how crucial it is to take energy use into account when evaluating models in order to provide
ifndings that are relevant.
      </p>
      <p>
        M Garg et al. [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] shows the rich concept of well-being as it is presented in Reddit discussion threads,
which covers elements like mental and social well-being. The MultiWD dataset has 3281 annotated
rows and that they carefully selected for the purpose for them to understand and find these multiple
dimensions. This dataset is a useful tool for looking at wellness indicators of online content. Using
advanced classifiers, they carefully saw a number of models; the optimized BERT models excelled the
others, with an F1 score of 76.69. This shows how easy it is to find complex features of wellness in
created by users writing with modern techniques, such as optimizing language models. Their results
point out the significance it is to use domain-specific data to enhance AI.
      </p>
      <p>
        M. Granitzer et al. [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] explained the hierarchical structure of text classification is represented by
a directed acyclic graph, and the application of Boosting in this context is examined. It contrasts the
performance of Boosting methods with Support Vector Machines (SVMs). As a hierarchical grouping
mechanism works its way down from the top, each node decides whether or not to distribute a
document farther. Flat classifiers like SVMs, CentroidBooster, and BoosTexter are used at each node.
CentroidBooster is an AdaBoost.MH-based BoosTexter solution. An examination of the Reuters Corpus
Volume 1 and the OHSUMED datasets shows that recognizing the hierarchical structure of a dataset
increases the F1-measure.
      </p>
      <p>
        F. Rollo et al. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] showed how they faced the dificulty task of classifying Italian newspapers which
becomes even harder by the language’s unique structure and style. Their methodology consists of a
number of processes including preprocessing the text creating word embeddings feature engineering
and document vector training. They test the model’s performance on a separate data-set to determine
how nicely it handles fresh information. They compare eight models, look into fifteen classifiers and
analyze 3 word embedding techniques. Their research includes 6 new Italian models trained on native
datasets in addition to popular models like Word2Vec and FastText. The usage of an Italian GloVe model
which was previously unavailable is a significant addition. They test using datasets containing news
articles regarding crimes and general Italian news.The findings shows the negatives of the Decision Tree,
Bernoulli, and Gaussian Naive Bayes models as well as the eficiancy of the Support Vector Classification
algorithm. When word embedding models are compared, Word2Vec and GloVe perform better than
FastText. All things are considered and their work improved the text classification for Italian texts and
added new Italian word embedding models to the language environment.
      </p>
      <p>
        In recent times people have shown worriness about the mean and hurtful things said on social media
especially when it comes to women. Researchers are trying to find ways to make social media safer for
everyone. The SemEval-2023 [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] Task 10 focused on finding and explaining these hurtful comments,
known as sexism, on sites like Gab and Reddit. They wanted to understand the diferent types of
sexism people face online. To do this they used special Large Language models called like XLM-T and
HateBERT which were trained to recognize ofensive language. These models are trained on lots of
tweets and Reddit posts so they are very good at understanding how people message each other online.
Kirk and their team understood and explained how they used these models to find and classify the
sexist comments. The hope that by understanding sexism better they can make the internet a nicer
place for everyone.
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. System Overview</title>
      <sec id="sec-3-1">
        <title>3.1. Machine Learning Models (KNN, SVM, Decision Trees, Hierarchical</title>
      </sec>
      <sec id="sec-3-2">
        <title>Classification):</title>
        <p>
          SVMs: SVMs are a powerful supervised learning algorithms which are mainly used for classification
task [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]. It mainly works on the basis of creating hyperplane that best separates classes in the feature
space. The margin maximization is used to maximize the distance between planes keeping the scores as
high as possible at the same time.
        </p>
        <p>
          KNN: KNN is a simple yet efective non-parametric algorithm used for classification and regression
tasks [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ]. K-Nearest Neighbors (KNN) functions by assigning the majority class of the K nearest
neighbors to the query point in the feature space.
        </p>
        <p>
          Decision Trees: These ML models are widely use for regression and classification tasks and they
operate in a recursive manner [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. Each of these models recursively splits the feature space based
on feature values, selecting the feature that provides the highest information gain at each node for
splitting.
        </p>
        <p>SVMs, KNN and decisions trees are considered as base models and we have Used One Vs Rest
classifier, as it creates a binary classifier for each class. This approach allows us to treat each class
separately and provides more precise weight-age to each one. Each of the classifier learns to predict 1
or 0 for each of the target class i.e 38 classes that are present in the dataset.</p>
        <p>Hierarchical Classification: In this model, we will classify data into three main hierarchical levels,
resulting in three columns or features. Each column will have multiple values, as this is a multi-class,
multi-label classification task. The first level of classification consists of four labels: Self-Transcendence,
Openness to Change, Self-Enhancement, and Conservation. Each first-level label is further divided
into sub-level labels. Under Self-Transcendence, we have Benevolence Caring, Benevolence Concern,
Benevolence Dependability, Universalism Concern, Universalism Nature, and Universalism Tolerance.
Under Openness to Change, we have Self-Direction Thought, Self-Direction Action, Stimulation, and
Hedonism. Under Self-Enhancement, we have Achievement, Dominance, Resource-Power, and Face.
Under Conservation, we have Humility, Conformity Interpersonal and Rules, Tradition, Security
Societal, and Security Personal. Each sub-level node is further divided into "Attained" or "Constrained"
as the third level. We will use one classifier per node at each level for classification. For each sentence,
the labels will represent the path from the parent class to the leaf nodes. There can be multiple paths
for each sentence, reflecting the multi-label nature of the classification task.</p>
        <p>Figure 1 shows the pictorial representation of the tree structure built for hierarchical text classification
model. Note that all the classes are not included in the image but are considered in the model.</p>
      </sec>
      <sec id="sec-3-3">
        <title>3.2. Transformer Models (BERT,RoBerta) :</title>
        <p>
          BERT [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] is fine-tuned for Multi-Label Classification. Here, only the Pooler Layer is unfrozen, while
all the other layers remain frozen. There is only hidden layer and one output layer neural network
architecture that is connected to the BERT embedding layer. Tokenized inputs are given to the model
for training, training is done with AdamW optimizer and BCEWithLogitsLoss criterion. The training
process is run for 5 epochs.
        </p>
        <p>
          Roberta [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] is the final model which we took into considerations as it gave the highest results. The
ifrst layer was the Roberta Embedding layer. Then a dropout layer with 0.3 probability was added. Then
a final layer for 38 classes was added. We have used 5 epochs with a batch size 16 and learning rate of
2e-5. We had a custom loss function which combines Cross entropy loss with focal loss components to
handle class imbalance and hard examples. We have used 3 parameters alpha = 0.25 , beta = 0.5 and
gamma = 2 to weight positive and negative examples.
        </p>
      </sec>
      <sec id="sec-3-4">
        <title>3.3. Large Language Models (Mistral):</title>
        <p>Mistral-7B model have been used in this study for human value detection. Quantized versions of these
models are used in order to cope up with computational costs. Prompts for each text is generated before
feeding it into LLMs. Since we are using SFT trainer the prompts along with class labels are fed into the
model.</p>
        <p>Figure 2 represents the flowchart indicating the flow of PEFT technique. Parameter Eficient Fine
Tuning (PEFT) parameter such as regularization parameter, dropout rate and task type set to CASUAL_LM
(Casual Language Modelling) are defined in a function that is used for this purpose. Various training
parameters such as learning rate, weight decay rate, warmup ratio, gradient accumulation steps etc
have been predefined. Adam 32-bit optimizer has been used while training. Supervised Fine Tuning
(SFT) trainer is used for training because of its low memory training capability for LLMs which uses
Low Rank Adaptive (LoRA) configuration for model parameters, enabling targeted parameter updates
by reducing the memory required.</p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Results</title>
      <p>All the metrics are the weighted average values for the Validation Set.</p>
      <p>We can observe from the above table RoBERTa is the best performing models followed by hierarchical
models for both the tasks. The machine learning models are found to perform poorly because they are
not able to generalize better because the dataset size is of (40000 x 768) because we are using BERT
embeddings which are then fed into ML models. We also observe that the scores are comparatively low
because of the datset being in eight diferent languages and due to the absence of single model which
:iitttrcegoodunhh :iii-ttfrcceaoodnn iltaon isnm teeevnm :irceeaodnnm :ssrrrceeeou :iltsrreaoypn :iilttsrceaoy iiton :iltsrreoyum :iilttfsrrreeaooypnnm iilty :ilrcceeagvonn :iilltceeeeavboyddpnn :ilssrrcceeaonnm :iltssrreeaaunm :illtssrrceeeaaonm</p>
      <p>EN llA l-feS leS itSum eodH ichA oPw oPw ceaF ceSu ceSu radT fonC onC uHm eenB eenB ivnU ivnU ivnU
Submission
valueeval24-bert-baseline-en ✓ 81 83 79 86 88 84 77 80 74 84 81 78 78 79 87 89 86 85 81 78
electric-basket-2024-05-06-16-22-15 ✓ 77 69 72 78 73 79 77 79 71 78 81 79 77 70 70 77 76 79 80 71
valueeval24-random-baseline 53 55 49 52 54 52 56 56 50 48 54 50 54 55 61 55 51 48 51 51
can perform well on all languages.</p>
      <p>When the same task is performed on english dataset alone, the metrics are found to be better than
the above. The high metric was achieved with the help of Mistral-7b which gave precision 0.52, recall
of 0.20 and f1-score of 0.28. his suggests that the model is able to predict the positive classes properly,
in this task it is predicting classes which are actually true, but it is also predicting classes which are
not supposed to be present. Roberta has given the highest score when validated only english dataset
displaying weighted metrics as 0.28 for precision, 0.47 for Recall and 0.35 for f1-score.</p>
      <p>Table 3 represents the results of our approach compared to the base model for subtask 1, which
indicates that it performs better than baseline models. Table 4 represents the results of our approach
for subtask 2, which indicates that it performs better than 2 baseline models but not as good as bert
baseline.</p>
    </sec>
    <sec id="sec-5">
      <title>5. Conclusion</title>
      <p>We initially started with conventional ML models like SVMs, KNNs and decision Trees with Multilingual
BERT embeddings for texts. We observed low metrics because of the existence of multiple languages
and the model wasn’t able to generalize. The same Conventional ML models showed a jump of 8-10% in
all metrics considering just English and UnCased-BERT for embeddings. The same thing is observed
with Mistral-7b fine-tuning and also Hierechial Model. Finally it was observed that RoBERTa was the
best performing model compared to other models. We aim to develop separate classification model for
each of the languages. In this way we can try to increase the eficiency of the final model, because it
was observed that the other language texts were pulling down the accuracy of the model which was
developed. We can also create an ensemble model where we can have multiple LLMs and the final
output is consider based on maximum voting which further decreases the bias created by a single model,
thereby increasing its accuracy.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          , Ç. Çöltekin,
          <string-name>
            <given-names>M.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Fröbe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Alshomary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B. D.</given-names>
            <surname>Longueville</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Erjavec</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Handke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kopp</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ljubešić</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Meden</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Mirzakhmedova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Morkevičius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Reitis-Münstermann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Scharfbillig</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Stefanovitch</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wachsmuth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Potthast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          , Overview of Touché 2024:
          <article-title>Argumentation Systems</article-title>
          , in: L.
          <string-name>
            <surname>Goeuriot</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Mulhem</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          <string-name>
            <surname>Quénot</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          <string-name>
            <surname>Schwab</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Soulier</surname>
          </string-name>
          ,
          <string-name>
            <surname>G. M. D. Nunzio</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Galuščáková</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. G. S. de Herrera</surname>
          </string-name>
          , G. Faggioli, N. Ferro (Eds.),
          <source>Experimental IR Meets Multilinguality, Multimodality, and Interaction. Proceedings of the Fifteenth International Conference of the CLEF Association (CLEF</source>
          <year>2024</year>
          ), Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>N.</given-names>
            <surname>Mirzakhmedova</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kiesel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Alshomary</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Heinrich</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Handke</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Cai</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Barriere</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Dastgheib</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Ghahroodi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sadraei</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Asgari</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Kawaletz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Wachsmuth</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Stein</surname>
          </string-name>
          ,
          <article-title>The Touché23- ValueEval Dataset for Identifying Human Values behind Arguments</article-title>
          , in: N.
          <string-name>
            <surname>Calzolari</surname>
            , M.-
            <given-names>Y.</given-names>
          </string-name>
          <string-name>
            <surname>Kan</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          <string-name>
            <surname>Hoste</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          <string-name>
            <surname>Lenci</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Sakti</surname>
          </string-name>
          , N. Xue (Eds.),
          <source>Proceedings of the 2024 Joint International Conference on Computational Linguistics</source>
          ,
          <article-title>Language Resources and Evaluation (LREC-COLING</article-title>
          <year>2024</year>
          ),
          <source>International Committee on Computational Linguistics</source>
          ,
          <year>2024</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>L.</given-names>
            <surname>Rigutini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Globo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Stefanelli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zugarini</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Gultekin</surname>
          </string-name>
          ,
          <string-name>
            <surname>M.</surname>
          </string-name>
          <article-title>Ernandes, Performance, energy consumption and costs: a comparative analysis of automatic text classification approaches in the legal domain</article-title>
          ,
          <source>INTERNATIONAL JOURNAL ON NATURAL LANGUAGE COMPUTING</source>
          ,
          <volume>13</volume>
          (
          <issue>1</issue>
          ),
          <fpage>19</fpage>
          -
          <lpage>35</lpage>
          . (
          <year>2024</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>M.</given-names>
            <surname>Garg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Sathvik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Raza</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Sohn</surname>
          </string-name>
          ,
          <article-title>Multiwd: Multi-label wellness dimensions in social media posts</article-title>
          ,
          <source>Journal of Biomedical Informatics</source>
          <volume>150</volume>
          (
          <year>2024</year>
          )
          <fpage>104586</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Granitzer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Auer</surname>
          </string-name>
          ,
          <article-title>Experiments with hierarchical text classification</article-title>
          ,
          <source>in: Proc. of 9th IASTED International Conference on Artifical Intelligence</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>F.</given-names>
            <surname>Rollo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Bonisoli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Po</surname>
          </string-name>
          ,
          <article-title>A comparative analysis of word embeddings techniques for italian news categorization</article-title>
          ,
          <source>IEEE Access 12</source>
          (
          <year>2024</year>
          )
          <fpage>25536</fpage>
          -
          <lpage>25552</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>S. M.</given-names>
            <surname>Aliyu</surname>
          </string-name>
          , I. Abdulmumin,
          <string-name>
            <given-names>S. H.</given-names>
            <surname>Muhammad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>I. S.</given-names>
            <surname>Ahmad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Salahudeen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Yusuf</surname>
          </string-name>
          ,
          <string-name>
            <surname>F. I. Lawan</surname>
          </string-name>
          , Hausanlp at semeval-2023 task 10:
          <article-title>Transfer learning, synthetic data and side-information for multi-level sexism classification</article-title>
          ,
          <source>in: Proceedings of the 17th International Workshop on Semantic Evaluation (SemEval-2023)</source>
          ,
          <year>2023</year>
          , pp.
          <fpage>1983</fpage>
          -
          <lpage>1987</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>M.</given-names>
            <surname>Hearst</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Dumais</surname>
          </string-name>
          ,
          <string-name>
            <given-names>E.</given-names>
            <surname>Osuna</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Platt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Scholkopf</surname>
          </string-name>
          ,
          <article-title>Support vector machines</article-title>
          ,
          <source>IEEE Intelligent Systems and their Applications</source>
          (
          <year>1998</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>T.</given-names>
            <surname>Cover</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Hart</surname>
          </string-name>
          ,
          <article-title>Nearest neighbor pattern classification</article-title>
          ,
          <source>IEEE Transactions on Information Theory</source>
          (
          <year>1967</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Breiman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Friedman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Olshen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Stone</surname>
          </string-name>
          ,
          <article-title>Classification and regression trees</article-title>
          ,
          <source>IEEE Transactions on Pattern Analysis and Machine Intelligence</source>
          (
          <year>1984</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>J.</given-names>
            <surname>Devlin</surname>
          </string-name>
          , M.-
          <string-name>
            <given-names>W.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Lee</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Toutanova</surname>
          </string-name>
          , Bert:
          <article-title>Pre-training of deep bidirectional transformers for language understanding (</article-title>
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Liu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ott</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Goyal</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Du</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Joshi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Levy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Lewis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Zettlemoyer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stoyanov</surname>
          </string-name>
          ,
          <article-title>Roberta: A robustly optimized bert pretraining approach (</article-title>
          <year>2019</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>