<!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>Classification in Urdu</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Dejah Madhusankar</string-name>
          <email>dejahmadhushankar@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Avanthika Karthikeyan</string-name>
          <email>karthiavanthika@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Bharathi B</string-name>
          <email>bharathib@ssn.edu.in</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of CSE, Sri Siva Subramaniya Nadar College of Engineering</institution>
          ,
          <addr-line>Tamil Nadu</addr-line>
          ,
          <country country="IN">India</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Emotion Classification in Urdu</institution>
          ,
          <addr-line>Classifier Chains, RNN, TF-IDF, Neural Networks, Multi-label emotion</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <fpage>16</fpage>
      <lpage>20</lpage>
      <abstract>
        <p>With the massive growth and widespread usage of social media platforms, the rates of its misuse and its corresponding impact on society have seen an exponential rise in numbers. The comfort of anonymity and wide reach ofered by social media has led to the convenient spread of hatred and incitement to threats, that are often targeted against particular users and communities. Thus identifying hate speech, threats and intense emotions in the digital arena has gained attention recently. This is also the aim of the EmoThreat: Emotions and Threat Detection in Urdu 2022 Challenge. In this paper, we describe a few traditional machine learning models and deep neural networks submitted by our team Aces for Task A: Multi-label emotion classification in Urdu. The models tested include Classifier Chains, MLKNN, RNN and LSTM Networks implemented with a combination of feature extraction methods such as the Count Vectorizer and TF-IDF, as well as embedding models like Word2Vec and FastText. Each model has been discussed in detail in Section 4 after a brief overview of the dataset adopted, in Section 3. Out of these tested permutations, the Classifier Chains model with TF-IDF vectorization proved to give the most promising results, which has been detailed in Section 5.</p>
      </abstract>
      <kwd-group>
        <kwd>detection</kwd>
        <kwd>fastText</kwd>
        <kwd>MLKNN</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        The right to free speech and expression on global platforms has inadvertently led to the
generation of numerous digital posts containing hateful, sensitive and abusive content. These
vulgar narratives, often-times targeted against certain individuals and communities worsen
users’ experience from communication via such media, while other posts contain actual threats
that put users in danger. Today major social-media platforms such as Google, Meta, YouTube
and Twitter are taking significant eforts to resolve this issue by detecting and censoring
objectionable content before it can instigate disruptions and chaos in society. With the Urdu
language having more than 230 million speakers worldwide[
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], a massive amount of user data
gets generated on an everyday basis. Content moderation of such enormous data is dificult
to achieve solely through manpower. This paper thereby explores various Machine Learning
(ML) algorithms and models for generating multi-label classification of emotions in Urdu text,
nEvelop-O
LGOBE
in a shared task called EmoThreat hosted by the Forum for Information Retrieval Evaluation,
2022, at the Indian Statistical Institute, Kolkata, overview of which is cited here [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ],[
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]. Our
team submitted five runs for Task A - Multi-label Classification of Emotions in Urdu and has
been ranked 8 in the leaderboard.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Related Work</title>
      <p>With social media as a major platform for blogging and sharing information impacting millions
of users’ lives every day, detecting and identifying intense emotions and objectionable content
becomes a very important task. A lot of research has been conducted over the years on various
aspects of the said issue keeping in mind the significance it holds on today’s digital society. Over
the years, individuals and organizations have come together and proposed various diferent
models.</p>
      <p>
        For instance, in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] the researchers have adopted traditional, deep learning and
transformerbased Machine Learning (ML) approaches along with diferent kinds of text representation for
emotion classification, while the authors of [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] and [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] propose traditional machine learning
techniques to categorize text as abusive and not abusive. Similar work was carried out by the
authors of [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] where the data set containing tweets in the English language was labeled and
categorized as hate speech, ofensive language or neither, leading to the authors concluding
their work as stated - ”We find that racist and homophobic tweets are more likely to be classified
as hate speech but that sexist tweets are generally classified as ofensive. Tweets without
explicit hate keywords are also more dificult to classify.” Following this, the authors of [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]
have implemented content-based methods for Multi-label classification of tweets, using various
classifiers such as Binary Relevance, Classifier Chain, and Label Combination. This work had
been undertaken with the literary text [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] providing a backbone to the significance of
binaryrelevance-based methods for multi-label classification, where the authors have argued that the
binary-relevance method has significantly much to ofer especially in terms of scalability to
large data sets.
      </p>
      <p>
        On a much recent scale, the researchers of [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] have explored diferent text representations,
namely count-based and fastText pre-trained word embeddings for Urdu, and have considered
various machine and deep learning algorithms for evaluation. The latest work of the authors of
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] proficiently fine-tunes the Multilingual BERT(mBERT) model for Urdu sentiment analysis
that uses four diferent text representations to train classifiers. Amidst the general concerns
and obstacles faced in developing accurate ML classifiers, it has been majorly realized that the
technicalities of the language involved plays a crucial role in the processing of text. Researchers
from Korea have put forth an analysis of the dificulties that come along with identifying Korean
swear words accurately. Their study, in their words ”proposes a method of discriminating
profanity using a deep learning model that can grasp the meaning and context of words after
separating Hangul into the onset, nucleus, and coda.”
      </p>
    </sec>
    <sec id="sec-3">
      <title>3. Datasets</title>
      <p>The dataset used is adapted from Task A of EmoThreat: Emotions and Threat Detection in
Urdu, FIRE 2022. The Urdu text in question has been generated using the Nastalīq Urdu script
dataset and consists of tweets made by various users on Twitter. The labels adopted for the text
classification are based on Ekman’s six basic emotions and neutrality. These six basic emotions
apart from Neutral are: Anger, Disgust, Fear, Sadness, Surprise and Happiness. The data set
consists of 8 columns, representing the 7 labels of emotion followed by the Urdu tweet in the last
column. There is a total of 7,800 rows, each of which corresponds to an independent tweet and
its corresponding classification label - marked as ’1’ in the appropriate column if the emotion is
detected, or ’0’ otherwise. Table 1 shows the distribution of the data set.</p>
    </sec>
    <sec id="sec-4">
      <title>4. Implementation and Experiments</title>
      <sec id="sec-4-1">
        <title>4.1. Models</title>
        <sec id="sec-4-1-1">
          <title>4.1.1. Classifier Chains</title>
          <p>
            Classifier chains is a machine learning model used for problem transformation in multi-label
classification scenarios. It uses |L| (number of labels) binary classifications where each
classification is linked along a chain and deals with the binary relevance problem associated with its
corresponding label L_j ∈ L[
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] Classification starts at the beginning and it propagates along
the chain, wherein each classifier learns and predicts the binary association of that particular
label.
4.1.2. MLkNN
The Multi-Label k-Nearest Neighbors (MLkNN) algorithm works similarly to the K-Nearest
Neighbors (KNN) method, which is a traditional non-parametric supervised learning approach.
MLKNN builds on the kNN approach to find the nearest examples to a test class and proceeds to
use Bayesian inference to select appropriate labels for classification. It starts by identifying the
k-nearest neighbors, followed by the identification of the corresponding labels for the instance
using the information collected from those neighbors. k-values in the range of 10 to 40 were
passed and better results were seen when the value approached 20. In our model, we have used
the default smoothing parameters, ignoring the first neighbors which had values of 1.0 and 0
respectively.
          </p>
        </sec>
        <sec id="sec-4-1-2">
          <title>4.1.3. Simple RNN</title>
          <p>RNN stands for Recurrent Neural Networks, which is a class of neural networks with loops in
them, allowing information to persist for a period of time. This neural architecture thus allows
inputs to be taken from previous outputs, enabling patterns to be dependent on previously
extracted patterns instead of treating each data point as an individual entity. The RNN model
employed we have built here uses a sigmoid activation layer along with a binary cross-entropy
loss function and Adam optimizer.</p>
        </sec>
        <sec id="sec-4-1-3">
          <title>4.1.4. LSTM Network</title>
          <p>Long Short-Term Memory (LSTM) is a special recurrent neural network (RNN) architecture that
was built to hold an edge over standard feed-forward neural networks and RNN because of their
trait of selectively remembering patterns for a longer duration of time. LSTMs use feedback
connections which distinguishes them from traditional feed forward neural networks. This
property enables LSTM models to process sequences of data without treating each sequence
point as an independent entity, but rather, retaining useful metadata about the previous sequence
points to help with the computation and processing of new data points. We used LSTM-based
neural network classifiers built with the Keras toolkit, along with fastText Urdu word embedding
to classify our Urdu text. We used word tokens, Embedding layer (300 dimensions), input length
(10001 words) as inputs to the LSTM (128 units) layer and sigmoid activation function for the
output layer. In this pipeline, we used categorical-cross entropy as the loss function and the
Adam optimizer for parameter optimization.</p>
        </sec>
      </sec>
      <sec id="sec-4-2">
        <title>4.2. Feature Extraction</title>
        <sec id="sec-4-2-1">
          <title>4.2.1. CountVectorizer</title>
          <p>CountVectorizer is a tool provided by the scikit-learn library in Python, used to convert text
into a vector based on the frequency (count) of each word that occurs in the entire text. This is
used as a feature extraction method for text classification problems. Making use of frequencies,
it converts a group of text documents to a matrix of token counts. Here, the MLKNN model
uses CountVectorizer and takes max_features as 1000 with max_df value of 0.85.
4.2.2. TF-IDF
TF-IDF, short for Term Frequency-Inverse Document Frequency is also a scikit-learn library
feature provided by Python for feature extraction in text processing. It converts a collection of
raw documents to a matrix of TF-IDF features. Term frequency(TF) refers to the frequency of a
word that occurs in a document while Inverse Document Frequency(IDF) implies the number of
times the document contains the word in the corpus. TF-IDF is nothing, but the multiplication
of TF and IDF. It works similarly to CountVectorizer but gives more importance to the words
and their relevance. This enables us to remove the words that are less important for our analysis,
thereby simplifying the model building by reducing the input dimensions.
4.2.3. Word2Vec
Word2Vec is a technique to eficiently create word embedding which makes use of shallow
neural networks. The efectiveness of Word2Vec is due to its ability to gather and group together
vectors of similar words. The embedding matrix was generated using the Word2Vec model,
having a model vocabulary’s size of 85868. The embedding layer was done using Word2Vec
embedding matrix and used a vocabulary size of 5000.</p>
        </sec>
        <sec id="sec-4-2-2">
          <title>4.2.4. FastText</title>
        </sec>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>5. Results</title>
      <p>FastText is an open-source, free library used for eficient learning of word embedding and text
classifications. It is a very fast NLP library created by Facebook’s AI Research (FAIR) lab. It
allows the training of both supervised and unsupervised representations of sentences. The
implemented model utilizes Urdu word embeddings which are represented as vectors having a
dimension of 300.</p>
      <p>
        The performance parameters of the various models tested are presented in the tables below.
Table 2 presents the model performance results shown while training and Table 3 displays the
results shown by test data. Considering the training data set, a performance accuracy of around
60% was achieved using the Classifier chains model and the simple RNN model. Overall, in the
test data set, the Classifier Chains model gave the best results, with a performance accuracy of
around 43%. This can possibly be attributed to its property of combining the computational
eficiency of the widely-known Binary Relevance method for multi-label classification, while
still being able to take the label dependencies into account for classification. It also retains the
advantages of the binary method including low memory and run-time complexity. Moreover, in
the recent decade, studies exploring the underlying theory and working behind classifier chains
have made many improvements to the training procedures, such that this method remains
among the state-of-the-art options for multi-label learning of text data. [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]
      </p>
      <p>The least performing model here is MLKNN, though there has been a visible improvement
in metrics when diferent feature extraction algorithms and parameter tuning were applied.
The reasons behind its underperformance appear to be inconclusive. Yet we believe that the
pre-processing of text and the size of training data used always play a much bigger role than
expected. MLKNN is moreover known to be computationally expensive   because the algorithm
stores all of the training data and is sensitive to irrelevant features. This could potentially lead
to errors during classification, which hypothetically explains its high performance with the
training data and poor performance with the test data.</p>
    </sec>
    <sec id="sec-6">
      <title>6. Conclusions</title>
      <p>In this paper, we have presented solutions to Task A of EmoThreat: Emotions and Threat
Detection in Urdu, at FIRE 2022. In this work, 4 diferent ML models along with 4 feature
extraction methods were adopted and tested for identifying the seven categories of emotions
(six basic emotions along with, neutral), and thereby classify various kinds of texts or tweets.
Prediction accuracy, F1 macro and micro scores were used as evaluation metrics with the F1
score as the key parameter. Although the results presented are adequately good, we believe that
they could potentially be improved with better training and cross-validation methods. It can
also be enhanced further by exploring the linguistic features of the Urdu language for better
feature extraction. The possibility of other ML models outperforming the proposed systems
remains open, and a higher performance accuracy can be fore-looked by employing fine-tuned
parameters. For future works, transformer-based models and other deep learning approaches
can be applied with fine-tuned parameters to improve emotion detection and classification.
Thanks to the Department of CSE, SSN College of Engineering, Kalavakkam, India, for providing
us with the opportunity, awareness, and guidance for this task. Special thanks to the organizers
of FIRE 2022 for providing us with the necessary data set and for bringing together individuals
nationwide to work on this project.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <surname>Ethnologue</surname>
          </string-name>
          ,
          <article-title>What are the top 200 most spoken languages?</article-title>
          , Available at https://www. ethnologue.com/guides/ethnologue200 (
          <year>2018</year>
          /03/03), ????
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>S.</given-names>
            <surname>Butt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Amjad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Balouchzahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sidorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          ,
          <source>Overview of EmoThreat: Emotions and Threat Detection in Urdu at FIRE</source>
          <year>2022</year>
          , in: CEUR Workshop Proceedings,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>S.</given-names>
            <surname>Butt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Amjad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Balouchzahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sidorov</surname>
          </string-name>
          ,
          <string-name>
            <surname>A</surname>
          </string-name>
          . Gelbukh, EmoThreat@FIRE2022:
          <article-title>Shared Track on Emotions and Threat Detection in Urdu, in: Forum for Information Retrieval Evaluation</article-title>
          ,
          <string-name>
            <surname>FIRE</surname>
          </string-name>
          <year>2022</year>
          ,
          <article-title>Association for Computing Machinery</article-title>
          , New York, NY, USA,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Butt</surname>
          </string-name>
          , H.-T. Chang,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sidorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          <article-title>, Multi-label emotion classification of urdu tweets</article-title>
          ,
          <source>PeerJ Computer Science</source>
          <volume>8</volume>
          (
          <year>2022</year>
          )
          <article-title>e896</article-title>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <surname>B. B. J. B. T. M. K A. Karthikraja</surname>
          </string-name>
          , Aarthi Suresh Kumar,
          <article-title>Abusive and threatening language detection in native urdu script tweets exploring four conventional machine learning techniques</article-title>
          <source>and mlp806-812</source>
          , FIRE 2021 Working Notes (
          <year>2021</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>M.</given-names>
            <surname>Amjad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zhila</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sidorov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Zubiaga</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          ,
          <article-title>Threatening language detection and target identification in urdu tweets</article-title>
          ,
          <source>IEEE Access 9</source>
          (
          <year>2021</year>
          )
          <fpage>128302</fpage>
          -
          <lpage>128313</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>T.</given-names>
            <surname>Davidson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Warmsley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Macy</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Weber</surname>
          </string-name>
          ,
          <article-title>Automated hate speech detection and the problem of ofensive language</article-title>
          ,
          <source>in: Proceedings of the international AAAI conference on web and social media</source>
          , volume
          <volume>11</volume>
          ,
          <year>2017</year>
          , pp.
          <fpage>512</fpage>
          -
          <lpage>515</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>I.</given-names>
            <surname>Ameer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          , G. Sidorov,
          <string-name>
            <surname>H.</surname>
          </string-name>
          <article-title>Gómez Adorno, Multi-label emotion classification using content-based features in twitter</article-title>
          ,
          <source>Computación y Sistemas</source>
          <volume>24</volume>
          (
          <year>2020</year>
          )
          <fpage>1159</fpage>
          -
          <lpage>1164</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>J.</given-names>
            <surname>Read</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pfahringer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Holmes</surname>
          </string-name>
          , E. Frank,
          <article-title>Classifier chains for multi-label classification</article-title>
          ,
          <source>in: Joint European conference on machine learning and knowledge discovery in databases</source>
          , Springer,
          <year>2009</year>
          , pp.
          <fpage>254</fpage>
          -
          <lpage>269</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>L.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Amjad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          , H.-
          <string-name>
            <given-names>T.</given-names>
            <surname>Chang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gelbukh</surname>
          </string-name>
          ,
          <article-title>Urdu sentiment analysis with deep learning methods</article-title>
          ,
          <source>IEEE Access 9</source>
          (
          <year>2021</year>
          )
          <fpage>97803</fpage>
          -
          <lpage>97812</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>L.</given-names>
            <surname>Khan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Amjad</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Ashraf</surname>
          </string-name>
          , H.-
          <article-title>T. Chang, Multi-class sentiment analysis of urdu text using multilingual bert</article-title>
          ,
          <source>Scientific Reports</source>
          <volume>12</volume>
          (
          <year>2022</year>
          )
          <fpage>1</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>J.</given-names>
            <surname>Read</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pfahringer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Holmes</surname>
          </string-name>
          , E. Frank,
          <article-title>Classifier chains for multi-label classification</article-title>
          ,
          <source>Machine learning 85</source>
          (
          <year>2011</year>
          )
          <fpage>333</fpage>
          -
          <lpage>359</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>J.</given-names>
            <surname>Read</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Pfahringer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Holmes</surname>
          </string-name>
          , E. Frank,
          <article-title>Classifier chains: a review and perspectives</article-title>
          ,
          <source>Journal of Artificial Intelligence Research</source>
          <volume>70</volume>
          (
          <year>2021</year>
          )
          <fpage>683</fpage>
          -
          <lpage>718</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>