<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">JQC</journal-id>
<journal-id journal-id-type="nlm-ta">JQC</journal-id>
<journal-id journal-id-type="publisher-id">JQC</journal-id>
<journal-title-group>
<journal-title>Journal of Quantum Computing</journal-title>
</journal-title-group>
<issn pub-type="epub">2579-0145</issn>
<issn pub-type="ppub">2579-0137</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">26658</article-id>
<article-id pub-id-type="doi">10.32604/jqc.2022.026658</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Online News Sentiment Classification Using DistilBERT</article-title>
<alt-title alt-title-type="left-running-head">Online News Sentiment Classification Using DistilBERT</alt-title>
<alt-title alt-title-type="right-running-head">Online News Sentiment Classification Using DistilBERT</alt-title>
</title-group>
<contrib-group content-type="authors">
<contrib id="author-1" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Akpatsa</surname><given-names>Samuel Kofi</given-names></name><xref ref-type="aff" rid="aff-1">1</xref><email>201814090019@std.uestc.edu.cn</email>
</contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Lei</surname><given-names>Hang</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Li</surname><given-names>Xiaoyu</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-4" contrib-type="author">
<name name-style="western"><surname>Setornyo Obeng</surname><given-names>Victor-Hillary Kofi</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Martey</surname><given-names>Ezekiel Mensah</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Addo</surname><given-names>Prince Clement</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Fiawoo</surname><given-names>Duncan Dodzi</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<aff id="aff-1"><label>1</label><institution>School of Information and Software Engineering, University of Electronic Science and Technology of China</institution>, <addr-line>Chengdu</addr-line>,&#x00A0;<country>China</country></aff>
<aff id="aff-2"><label>2</label><institution>Faculty of Applied Sciences and Mathematical Education, Akenten Appiah-Menka University of Skills Training and Entrepreneurial Development</institution>, <addr-line>Kumasi</addr-line>, <country>Ghana</country></aff>
<aff id="aff-3"><label>3</label><institution>Jasikan College of Education, University of Cape Coast</institution>, <addr-line>Jasikan</addr-line>, <country>Ghana</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Samuel Kofi Akpatsa. Email: <email>201814090019@std.uestc.edu.cn</email></corresp>
</author-notes>
<pub-date pub-type="epub" date-type="pub" iso-8601-date="2022-07-04"><day>04</day>
<month>07</month>
<year>2022</year></pub-date>
<volume>4</volume>
<issue>1</issue>
<fpage>1</fpage>
<lpage>11</lpage>
<history>
<date date-type="received"><day>15</day><month>12</month><year>2021</year></date>
<date date-type="accepted"><day>28</day><month>4</month><year>2022</year></date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2022 Akpatsa et al.</copyright-statement>
<copyright-year>2022</copyright-year>
<copyright-holder>Akpatsa et al.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_JQC_26658.pdf"></self-uri>
<abstract>
<p>The ability of pre-trained BERT model to achieve outstanding performances on many Natural Language Processing (NLP) tasks has attracted the attention of researchers in recent times. However, the huge computational and memory requirements have hampered its widespread deployment on devices with limited resources. The concept of knowledge distillation has shown to produce smaller and faster distilled models with less trainable parameters and intended for resource-constrained environments. The distilled models can be fine-tuned with great performance on a wider range of tasks, such as sentiment classification. This paper evaluates the performance of DistilBERT model and other pre-canned text classifiers on a Covid-19 online news binary classification dataset. The analysis shows that despite having fewer trainable parameters than the BERT-based model, the DistilBERT model achieved an accuracy of 0.94 on the validation set after only two training epochs. The paper also highlights the usefulness of the ktrain library in facilitating the building, training, and application of state-of-the-art Machine Learning and Deep Learning models.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Natural language processing</kwd>
<kwd>DistilBERT</kwd>
<kwd>text classification</kwd>
<kwd>sentiment analysis</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1"><label>1</label><title>Introduction</title>
<p>Online news networks have become reliable platforms that provide useful information in educating and informing the public with the latest updates and current happenings around the globe. Due to the massive amount of textual data generated daily from these networks, the use of Machine Learning and NLP techniques to analyze and classify such content allows researchers and the scientific community to understand whether the public perception of developing events has a positive, negative, or neutral sentiment. With the advancements of Deep Learning models, the research interest of the NLP community has shifted towards the distributed representation of words (word embeddings) which extract rich semantic features from text sequences effectively improve the performance of learning algorithms [<xref ref-type="bibr" rid="ref-1">1</xref>&#x2013;<xref ref-type="bibr" rid="ref-4">4</xref>]. The use of word embeddings has given better performance compared to the traditional bag of words model.</p>
<p>Although Machine Learning and Deep Learning models are still relevant in NLP [<xref ref-type="bibr" rid="ref-5">5</xref>&#x2013;<xref ref-type="bibr" rid="ref-7">7</xref>], the paradigm shift towards the concept of transfer learning has seen the introduction of several pre-trained models, allowing researchers to achieve cutting-edge performance across multiple benchmarks. One such approach that has been more successful and supported by a wave of research is the transformer-based BERT model developed by Google [<xref ref-type="bibr" rid="ref-8">8</xref>]. Since its introduction, BERT model has become the model of choice for many researchers and practitioners in NLP, replacing the RNNs [<xref ref-type="bibr" rid="ref-9">9</xref>]. Due to the learned knowledge from the BERT model being pre-trained using a large unlabeled corpus, fine-tuning them on downstream tasks have become the most successful technique in NLP [<xref ref-type="bibr" rid="ref-10">10</xref>]. The pre-trained BERT models have shown to document impressive results and even outperform human beings on many tasks.</p>
<p>However, despite their impressive performance, BERT models require massive computational resources and large amounts of data for training. As a result, many studies in the recent past have explored the concept of knowledge distillation to reduce the large-scale BERT model into a compact model without losing its capabilities. Knowledge distillation has proven to be a useful pruning technique that can yield significant speedup and memory size reduction while preserving much capacity of the original model [<xref ref-type="bibr" rid="ref-11">11</xref>,<xref ref-type="bibr" rid="ref-12">12</xref>]. Moreover, the complexity of the transformer-based models remains one of the major challenges that impede widespread adoption by the research community [<xref ref-type="bibr" rid="ref-13">13</xref>]. However, the ktrian library developed by [<xref ref-type="bibr" rid="ref-14">14</xref>] is designed to make state-of-the-art Machine Learning and Deep Learning models more accessible and easier to apply by practitioners. ktrain provides several pre-trained models for fine-tuning on NLP tasks, such as sentiment analysis, document classification, named entity recognition, part of speech tagging, etc.</p>
<p>One of the most popular pre-canned text classifiers under the ktrain library is DistilBERT model. It is an efficient and scaled-down distilled version of BERT model purported to be smaller, lighter, cheaper, and faster, yet retain 97&#x0025; of BERT&#x2019;s capabilities [<xref ref-type="bibr" rid="ref-15">15</xref>]. The fine-tuning performance of the DistilBERT model on binary classification tasks suggests that it can generalize better than other pre-trained language representation models on a wide range of downstream NLP tasks [<xref ref-type="bibr" rid="ref-16">16</xref>].</p>
<p>This paper fine-tuned five different pre-canned text classifiers from the ktrain library on a binary classification dataset. These classifiers include Logistic Regression (logreg), Na&#x00EF;ve Bayes infuses with Support Vector Machines (nbsvm), Bidirectional Gated Recurrent Unit (bigru), BERT-base model, and DistilBERT models. The main objective is to evaluate the performance of DistilBERT model in predicting the sentiment category for a given Covid-19 related online news. Our analysis also contributes to a better understanding of the usefulness of the ktrain library in developing and training Machine Learning and Deep Learning models for NLP tasks. The rest of the paper is structured as follows. Section two describe the dataset and the experimental setup for this study. Section three presents an overview of the models used for the classification task. Section four reports the results from the experimental evaluation of the models, while the last section draws conclusions and suggestions for future work.</p>
</sec>
<sec id="s2"><label>2</label><title>Experimental Setup</title>
<sec id="s2_1"><label>2.1</label><title>Dataset</title>
<p>This study used data collected from the websites of three most popular online news providers (<italic>10news.com, cnn.com, and foxla.com</italic>). A scraper was used to download more than 10000 articles from May 2020 to September 2020 using &#x2018;covid-19&#x2019; and &#x2018;coronavirus&#x2019; as the keywords. Thus, the collected data is highly related to covid-19 as the text was about articles on covid-19 at the websites of the online news providers. The downloaded articles varied significantly in the number of sentences and word counts. To normalize the text size, we reconstruct the news articles to create paragraphs with approximately ten sentences to utilize as many data points as possible. A script that automatically applies NLTK&#x2019;s sentence tokenizer was run to extract 41839 text entities to be labeled into different sentiment categories. Data labeling was handled manually with human annotation. The annotators assigned 1 (positive class) for texts with positive sentiment and 0 (negative class) for texts with negative sentiment. Some texts were removed from the dataset due to the difficulty of interpretation. The final dataset consisted of 33324 texts, where 20810 were assigned to the positive class, and 12489 were assigned to the negative class. The developed dataset was published on Mendeley data repository (<uri xlink:href="https://data.mendeley.com/datasets/r6nn5s37tp/2">https://data.mendeley.com/datasets/r6nn5s37tp/2</uri>).</p>
<p>We analyzed the length of the text documents in terms of the number of words and characters and found that it consists of fairly long samples. The average number of words for each text is 210, with the longest document containing 1104 words and 8429 characters. <xref ref-type="fig" rid="fig-1">Figs. 1</xref> and <xref ref-type="fig" rid="fig-2">2</xref> represent the distribution of the words and characters counts of the dataset. The words and characters are both right-skewed with a minimal number of outliers creating a right tail.</p>
<fig id="fig-1"><label>Figure 1</label><caption><title>Frequency distribution of word counts</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="JQC_26658-fig-1.png."/></fig>
<fig id="fig-2"><label>Figure 2</label><caption><title>Frequency distribution of character counts</title></caption><graphic mimetype="image" mime-subtype="png" xlink:href="JQC_26658-fig-2.png."/></fig>
</sec>
<sec id="s2_2"><label>2.2</label><title>Data Preprocessing</title>
<p>Even though texts from online news articles come with much fewer irregularities and noise, we perform some fundamental cleaning and preprocessing to improve the quality of the dataset. Texts from the dataset were filtered using a python script to remove background noises such as white spaces, punctuations, hashtags, urls, special characters, hyperlinks, and stop words, while all letters were converted to lower case. The data-loading function within the ktrain package allowed us to load the preprocessed text data into a suitable format for the various text classifiers. Finally, different experiments were applied to analyze which classifier performed best on the dataset.</p>
</sec>
<sec id="s2_3"><label>2.3</label><title>Fine-Tuning</title>
<p>The selected classifiers were fine-tuned on the dataset using the ktrain library written in the Python programming language. The dataset was randomly split into 70&#x0025; training set and 30&#x0025; test set using stratified sampling. We use the get_learner function to load and wrap the model and the data into a learner object used to train the network. We employ 1cycle policy learning rate schedule with a maximum learning rate of 2e&#x2212;5, and a Stochastic Gradient Descent with Restart (SGDR) policy learning rate schedule to automatically adjust the learning rates during training [<xref ref-type="bibr" rid="ref-17">17</xref>,<xref ref-type="bibr" rid="ref-18">18</xref>]. To protect model training from over-fitting, we trained the logreg and nbsvm classifiers for 32 epochs over a batch size of 16. The deep learning bigru model was trained for 16 epochs with a batch size of 8. Due to the relatively large size of the transformer-based bert and distilbert models, training was carried out for only two epochs with a batch size of 6. Optimization of the hyper-parameters in the training of each distinct model was done using Adam Optimizer.</p>
<p>Experimentations were carried out in Google Colab on Graphics Processing Unit (GPU) with the following configurations: GPU 0: Tesla T4, with 12 GB of RAM and 68 GB of disk space. The Google Colab Notebook is an integrated development environment (IDE) that runs in the cloud and highly integrated with Google Drive. As a result, the GPU offers speedups that significantly accelerate the training procedure.</p>
</sec>
</sec>
<sec id="s3"><label>3</label><title>Methodology</title>
<sec id="s3_1"><label>3.1</label><title>Models</title>
<p>ktrain is an open-source Python package that acts as a lightweight wrapper for TensorFlow and many other libraries, making it easy to build, train, and deploy Machine Learning models on standard desktop. This study selected five pre-canned text classifiers (logreg, nbsvm, bigru, bert, and distilbert) from the ktrain library and fine-tuned them on the dataset. These classifiers have been categorized into Machine Learning, Deep Learning, and Transformer-based models for text classification.</p>
<sec id="s3_1_1"><label>3.1.1</label><title>Machine Learning Classifiers</title>
<p>The first set of pre-canned classifiers under the ktrain library are the logreg and nbsvm Machine Learning algorithms. These classifiers were included in the experiment to serve as a comprehensive baseline. The logreg classifier uses a trainable embedding layer, while the nbsvm classifier uses a linear Support Vector Machines (SVM) model infuses with a Naive Bayes (NB) log-count ratios as features [<xref ref-type="bibr" rid="ref-19">19</xref>]. These classifiers are much simpler than the deep learning and transformer-based models but have proven to be fast and efficient on a wide range of text classification tasks [<xref ref-type="bibr" rid="ref-19">19</xref>&#x2013;<xref ref-type="bibr" rid="ref-21">21</xref>].</p>
</sec>
<sec id="s3_1_2"><label>3.1.2</label><title>Deep Learning Classifier</title>
<p>The Deep Learning approach used in our experiment is the bidirectional variant of Gated Recurrent Unit (BiGRU) model for the classification task. BiGRU is a more advanced variant of RNN and has proven to be less complex than BiLSTM [<xref ref-type="bibr" rid="ref-22">22</xref>]. BiGRU works as a better window-based feature extractor to extract textual information from both directions simultaneously, improving the context understanding of words. The input to the bigru model is a word vector obtained from a pre-trained fasttext word vector. fasttext differs from Word2vec in that it considers character n-grams as the smallest unit rather than a word. Thus, the vector of a word is the sum of its character n-grams vectors. This makes it appropriate for addressing morphological richness and has proven effective for text classification tasks [<xref ref-type="bibr" rid="ref-23">23</xref>].</p>
</sec>
<sec id="s3_1_3"><label>3.1.3</label><title>Transformer-based Model</title>
<p>The transformer-based BERT model is a general-purpose language model pre-trained on a very large corpus of unlabeled text, including the entire English Wikipedia (2500&#x2005;M words), and Book Corpus (800&#x2005;M words). The many parameters allow them to dig deep and learn how language works. However, training the pre-trained BERT model takes a longer inference time, making it difficult to deploy on edge devices such as mobile phones. Recent literature suggests that due to the redundancy in pre-trained language models such as BERT, it is essential to reduce the computational overhead in such models [<xref ref-type="bibr" rid="ref-24">24</xref>]. Different model compression techniques have been proposed in literature to speed up inference of deep models and reduce model size while retaining their performance [<xref ref-type="bibr" rid="ref-25">25</xref>]. The most commonly used technique is knowledge distillation in a teacher-student framework [<xref ref-type="bibr" rid="ref-26">26</xref>]. Knowledge distillation aims at training a small student model to replicate the behavior of a large teacher model. The memory usage and the time overhead are both decreased when using a small distilled model for inference. Successful implementation of this concept has seen the proposal of a method to pre-train a smaller general-purpose language representation model called DistilBERT [<xref ref-type="bibr" rid="ref-15">15</xref>]. The smaller DistilBERT model has demonstrated to produce good performances similar to the larger BERT model when fine-tuned on a wide range of downstream tasks.</p>
<p>The general architecture of the DistilBERT model is similar to that of the BERT model [<xref ref-type="bibr" rid="ref-8">8</xref>], except that it has 40&#x0025; fewer trainable parameters and is intended for environments with limited computing resources [<xref ref-type="bibr" rid="ref-15">15</xref>] (<xref ref-type="table" rid="table-1">Tab. 1</xref>). Other variants of the BERT model such as RoBERTa, TinyBERT, and ALBERT, have very recently produced state-of-the-art performances in many NLP tasks [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-27">27</xref>,<xref ref-type="bibr" rid="ref-28">28</xref>]. The success of BERT-like models stems from their ability to capture bi-directional contextual information from text sequences during the training phase. In addition, the compactness of the DistilBERT makes them scalable and capable of producing state-of-the-art performance on most NLPT tasks in real-time while preserving 97&#x0025; of BERT&#x2019;s capacity.</p>
<table-wrap id="table-1"><label>Table 1</label><caption><title>Differences between BERT-base and DistilBERT-base models</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Trainable parameters</th>
<th align="left">BERT-base</th>
<th align="left">DistilBERT-base</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">No. of layers (transformer blocks)</td>
<td align="left">12</td>
<td align="left">6</td>
</tr>
<tr>
<td align="left">No. of hidden units</td>
<td align="left">768</td>
<td align="left">768</td>
</tr>
<tr>
<td align="left">No. of self-attention heads</td>
<td align="left">12</td>
<td align="left">12</td>
</tr>
<tr>
<td align="left">Total trainable parameters</td>
<td align="left">110&#x2005;M</td>
<td align="left">66&#x2005;M</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s3_2"><label>3.2</label><title>Metrics of Evaluation</title>
<p>The primary metrics for comparing the models were accuracy, precision, recall, and f1-score. The metrics were calculated in terms of the True Positive (TP), True Negative (TN), False Positive (FP) and False Negative (FN). The accuracy is calculated as the number of all the correct predictions divided by the total number of instances (<xref ref-type="disp-formula" rid="eqn-1">Eq. (1)</xref>). The precision is calculated as predicted instances which were correct divided by the size which was the predicted size of the instance (<xref ref-type="disp-formula" rid="eqn-2">Eq. (2)</xref>). The recall, also known as sensitivity, is measured as the total correctly predicted instances divided by the actual number of instances (<xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref>).
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mrow><mml:mtext>Accuracy</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>TN</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mrow><mml:mtext>Precision</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mtext>&#xA0;</mml:mtext></mml:mrow><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FP</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>TP</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>FN</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
</sec>
<sec id="s3_3"><label>3.3</label><title>Dealing with Data Imbalance</title>
<p>Our dataset consists of uneven class distribution. This could lead to a bias towards the majority class at the expense of the minority class as the classifiers attempt to achieve high accuracy scores. To solve this problem, we need to find evaluation metrics that give the classes in the target class equal weight, and at the same time, find a way to balance the data. We consider the f1-score with a Macro average to be an important evaluation measure (<xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref>). It calculates the f-score for each target class and outputs their unweighted mean, allowing each class to have the same weight as the other classes regardless of the number of instances.
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:mrow><mml:mtext>F</mml:mtext></mml:mrow><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mtext>score</mml:mtext></mml:mrow><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mspace width="thickmathspace" /><mml:mrow><mml:mo>&#x2217;</mml:mo></mml:mrow><mml:mspace width="thickmathspace" /><mml:mfrac><mml:mrow><mml:mrow><mml:mtext>Precision</mml:mtext><mml:mo>&#x2217;</mml:mo><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow><mml:mrow><mml:mrow><mml:mtext>Precision&#xA0;</mml:mtext></mml:mrow><mml:mo>+</mml:mo><mml:mrow><mml:mtext>Recall</mml:mtext></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>We then apply the manual undersampling technique to balance out the data by arbitrarily reducing the number of observations from the majority class. The resulting balanced dataset has an equal number of positive and negative classes.</p>
</sec>
</sec>
<sec id="s4"><label>4</label><title>Result and Discussion</title>
<p>This study used Python programming language to set up the models. The entire study was done using the k-train library on Google Colab. Several experiments were carried out to evaluate the effectiveness of the DistilBERT model and other pre-canned text classifiers on a binary text classification task. The performance of the classifiers implemented for the sentiment classification of the Covid-19 online news dataset is presented below.</p>
<sec id="s4_1"><label>4.1</label><title>Result Using the Original Imbalanced Dataset</title>
<p>An initial experiment was performed on the original dataset with class imbalanced using the pre-canned ktrain classifiers. The results of the selected classifiers in terms of accuracy, precision, recall, and f1-score are shown in <xref ref-type="table" rid="table-2">Tab. 2</xref>. The practical trade-off between the complexity of the models and their performance becomes noticeable from the results. For example, the f1-score gap between logreg and nbsvm classifiers is only 1&#x0025; but reaches 5&#x0025; between logreg and bigru models, 10&#x0025; between logreg and distilbert models, and 12&#x0025; between logreg and bert models. The result indicates that the machine learning classifiers show poor performance compared to the deep learning and the Transformer-based models. The primary reason is that the machine learning models fail to learn long-term relationships within the long text documents and could not capture the context across the text due to memory issues.</p>
<table-wrap id="table-2"><label>Table 2</label><caption><title>Performance of classifiers on the original imbalanced dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Method</th>
<th align="left">Classifier</th>
<th align="left">Accuracy</th>
<th align="left">Class</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="6">Machine learning</td>
<td align="left" rowspan="3">logreg</td>
<td align="left" rowspan="3">0.86</td>
<td align="left">0</td>
<td align="left">0.88</td>
<td align="left">0.74</td>
<td align="left">0.80</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.86</td>
<td align="left">0.94</td>
<td align="left">0.90</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.87</td>
<td align="left">0.84</td>
<td align="left">0.84</td>
</tr>
<tr>
<td align="left" rowspan="3">nbsvm</td>
<td align="left" rowspan="3">0.86</td>
<td align="left">0</td>
<td align="left">0.89</td>
<td align="left">0.75</td>
<td align="left">0.80</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.85</td>
<td align="left">0.94</td>
<td align="left">0.90</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.87</td>
<td align="left">0.85</td>
<td align="left">0.85</td>
</tr>
<tr>
<td align="left" rowspan="3">Deep learning</td>
<td align="left" rowspan="3">bigru</td>
<td align="left" rowspan="3">0.90</td>
<td align="left">0</td>
<td align="left">0.89</td>
<td align="left">0.83</td>
<td align="left">0.86</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.90</td>
<td align="left">0.94</td>
<td align="left">0.92</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.90</td>
<td align="left">0.88</td>
<td align="left">0.89</td>
</tr>
<tr>
<td align="left" rowspan="6">Transformer</td>
<td align="left" rowspan="3">distilbert</td>
<td align="left" rowspan="3">0.94</td>
<td align="left">0</td>
<td align="left">0.93</td>
<td align="left">0.95</td>
<td align="left">0.94</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.97</td>
<td align="left">0.96</td>
<td align="left">0.95</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.94</td>
<td align="left">0.94</td>
<td align="left">0.93</td>
</tr>
<tr>
<td align="left" rowspan="3">bert</td>
<td align="left" rowspan="3">0.96</td>
<td align="left">0</td>
<td align="left">0.95</td>
<td align="left">0.94</td>
<td align="left">0.94</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.97</td>
<td align="left">0.95</td>
<td align="left">0.96</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.96</td>
<td align="left">0.95</td>
<td align="left">0.95</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s4_2"><label>4.2</label><title>Result Using the Balanced Dataset</title>
<p>The next set of experiments focuses on evaluating the pre-canned ktrain classifiers on the balanced dataset, and the result is presented in <xref ref-type="table" rid="table-3">Tab. 3</xref>. We observe that all the classifiers follow the same performance pattern on the datasets. Nonetheless, there was a marginal increase in performance for all classifiers on the balanced dataset. For example, the distilbert classifier appreciated slightly from 0.94 accuracy, 0.94 precision and 0.93 f1-score values on the imbalanced dataset, to 0.95 accuracy, 0.96 precision, and 0.95 f1-score values on the balanced dataset. Similarly, the deep learning bigru classifier increase from 0.90 accuracy, 0.90 precision, and 0.89 f1-score, to 0.91 accuracy, 0.91 precision, and 0.91 f1-score values. The performance difference is due to the class balance, which reduces the probability of models over-fitting on the majority class. The result obtained from this study further strengthens the importance of a balanced dataset to increase the overall performance of classification models.</p>
<table-wrap id="table-3"><label>Table 3</label><caption><title>Performance of classifiers on the balanced dataset</title></caption>
<table frame="hsides">
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left">Method</th>
<th align="left">Classifier</th>
<th align="left">Accuracy</th>
<th align="left">Class</th>
<th align="left">Precision</th>
<th align="left">Recall</th>
<th align="left">F1-score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left" rowspan="6">Machine learning</td>
<td align="left" rowspan="3">logreg</td>
<td align="left" rowspan="3">0.87</td>
<td align="left">0</td>
<td align="left">0.87</td>
<td align="left">0.88</td>
<td align="left">0.85</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.86</td>
<td align="left">0.87</td>
<td align="left">0.87</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.86</td>
<td align="left">0.87</td>
<td align="left">0.86</td>
</tr>
<tr>
<td align="left" rowspan="3">nbsvm</td>
<td align="left" rowspan="3">0.86</td>
<td align="left">0</td>
<td align="left">0.86</td>
<td align="left">0.87</td>
<td align="left">0.85</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.85</td>
<td align="left">0.86</td>
<td align="left">0.86</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.86</td>
<td align="left">0.86</td>
<td align="left">0.86</td>
</tr>
<tr>
<td align="left" rowspan="3">Deep learning</td>
<td align="left" rowspan="3">bigru</td>
<td align="left" rowspan="3">0.91</td>
<td align="left">0</td>
<td align="left">0.90</td>
<td align="left">0.91</td>
<td align="left">0.91</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.91</td>
<td align="left">0.90</td>
<td align="left">0.91</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.91</td>
<td align="left">0.90</td>
<td align="left">0.91</td>
</tr>
<tr>
<td align="left" rowspan="6">Transformer</td>
<td align="left" rowspan="3">distilbert</td>
<td align="left" rowspan="3">0.95</td>
<td align="left">0</td>
<td align="left">0.96</td>
<td align="left">0.95</td>
<td align="left">0.94</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.95</td>
<td align="left">0.96</td>
<td align="left">0.96</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.96</td>
<td align="left">0.95</td>
<td align="left">0.95</td>
</tr>
<tr>
<td align="left" rowspan="3">bert</td>
<td align="left" rowspan="3">0.97</td>
<td align="left">0</td>
<td align="left">0.96</td>
<td align="left">0.97</td>
<td align="left">0.97</td>
</tr>
<tr>
<td align="left">1</td>
<td align="left">0.98</td>
<td align="left">0.98</td>
<td align="left">0.96</td>
</tr>
<tr>
<td align="left">Macro avg</td>
<td align="left">0.97</td>
<td align="left">0.97</td>
<td align="left">0.96</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Previous studies have indicated that BERT-based models have a deeper bi-directional context-awareness in text sequences [<xref ref-type="bibr" rid="ref-29">29</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>]. The results from this study corroborate the strength of transformer-based models over other classifiers (<xref ref-type="table" rid="table-4">Tab. 4</xref>). In line with literature, we conclude that the transformer-based distilbert model is more robust than conventional machine learning and deep learning models on a binary text classification task. In addition, the deep learning bigru classifier, which was pre-trained on fasttext word vectors, outperforms the baseline machine learning (logreg, nbsvm) classifiers on the validation set. These findings are consistent with previous studies demonstrating that deep learning and transformer-based models typically outperform conventional machine learning models [<xref ref-type="bibr" rid="ref-6">6</xref>,<xref ref-type="bibr" rid="ref-30">30</xref>,<xref ref-type="bibr" rid="ref-31">31</xref>]. However, the improved classification performance comes at a high cost in computing time, particularly during training, as the many hyperparameters of the transformer-based models need to be fine-tuned to optimize performance</p>
<table-wrap id="table-4"><label>Table 4</label><caption><title>A comparison of performance on the balanced and imbalanced datasets</title></caption>
<table frame="hsides" >
<colgroup>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
<col align="left"/>
</colgroup>
<thead>
<tr>
<th align="left" rowspan="2">Classifier</th>
<th align="center" colspan="2">Imbalanced dataset</th>
<th align="center" colspan="2">Balanced dataset</th>
</tr>
<tr>
<th align="left">Accuracy</th>
<th align="right">Fl-score</th>
<th align="left">Accuracy</th>
<th align="right">F1-score</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">logreg</td>
<td align="left">0.86</td>
<td align="center">0.84</td>
<td align="left">0.87</td>
<td align="center">0.86</td>
</tr>
<tr>
<td align="left">nbsvm</td>
<td align="left">0.86</td>
<td align="center">0.85</td>
<td align="left">0.86</td>
<td align="center">0.86</td>
</tr>
<tr>
<td align="left">bigru</td>
<td align="left">0.90</td>
<td align="center">0.89</td>
<td align="left">0.91</td>
<td align="center">0.91</td>
</tr>
<tr>
<td align="left">distilbert</td>
<td align="left">0.94</td>
<td align="center">0.93</td>
<td align="left">0.95</td>
<td align="center">0.95</td>
</tr>
<tr>
<td align="left">bert</td>
<td align="left">0.96</td>
<td align="center">0.95</td>
<td align="left">0.97</td>
<td align="center">0.96</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="s5"><label>5</label><title>Conclusion</title>
<p>The study fine-tuned five different pre-canned text classifiers from the ktrain library on an online news binary classification dataset. The experiments confirmed the superiority of the transformer-based (BERT, and DistilBERT) models over other Machine Learning and Deep Learning models on a downstream NLP task. We show that a class imbalance in the dataset can affect model performance and point out that under-sampling can be a useful technique in dealing with imbalanced data. Further, we noticed that the implementation of text classifiers in the ktrain package is far less complicated and easier to apply. Alongside the class balance, we assume that the quality of the annotation could also impact model performance. For future work, we would like to investigate how the polarity levels of news in our dataset influence the performance of the various pre-canned classifiers.</p>
</sec>
</body>
<back>
<ack>
<p>This study was supported by the National Key R\&#x0026;D Program of China, Grant No. 2018YFA0306703.</p>
</ack>
<fn-group>
<fn fn-type="other"><p><bold>Data Availability:</bold> The dataset is available at Mendeley Repository: <uri xlink:href="https://data.mendeley.com/datasets/r6nn5s37tp/2">https://data.mendeley.com/datasets/r6nn5s37tp/2</uri>.</p></fn>
<fn fn-type="other"><p><bold>Funding Statement:</bold> The authors received no specific funding for this study.</p></fn>
<fn fn-type="conflict"><p><bold>Conflicts of Interest:</bold> The authors declare that the research was conducted without any commercial or financial relationships that could be interpreted as a potential conflict of interest.</p></fn>
</fn-group>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>G.</given-names> <surname>Corrado</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Dean</surname></string-name></person-group>, &#x201C;<article-title>Efficient estimation of word representations in vector space</article-title>,&#x201D; arXiv Preprint, arXiv1301.3781, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>H. P.</given-names> <surname>Wu</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Liu</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Wang</surname></string-name></person-group>, &#x201C;<article-title>Review of text classification methods on deep learning</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>63</volume>, no. <issue>3</issue>, pp. <fpage>1309</fpage>&#x2013;<lpage>1321</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>P.</given-names> <surname>Cen</surname></string-name>, <string-name><given-names>K. X.</given-names> <surname>Zhang</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Zheng</surname></string-name></person-group>, &#x201C;<article-title>Sentiment analysis using deep learning approach</article-title>,&#x201D; <source>Journal on Artificial Intelligence</source>, vol. <volume>2</volume>, no. <issue>1</issue>, pp. <fpage>17</fpage>&#x2013;<lpage>27</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Sutskever</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>G. S.</given-names> <surname>Corrado</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Dean</surname></string-name></person-group>, &#x201C;<article-title>Distributed representations of words and phrases and their compositionality</article-title>,&#x201D; in <conf-name>Proc. Advances in Neural Information Processing Systems</conf-name>, Lake Tahoe in Spain. pp. <fpage>3111</fpage>&#x2013;<lpage>3119</lpage>, <year>2013</year>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Shah</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Ge</surname></string-name>, <string-name><given-names>S. A.</given-names> <surname>Haider</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Irshad</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Younas</surname></string-name></person-group>, &#x201C;<article-title>A quantum spatial graph convolutional network for text classification</article-title>,&#x201D; <source>Computer Systems Science and Engineering</source>, vol. <volume>36</volume>, no. <issue>2</issue>, pp. <fpage>369</fpage>&#x2013;<lpage>382</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S. K.</given-names> <surname>Akpatsa</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Li</surname></string-name> and <string-name><given-names>H.</given-names> <surname>Lei</surname></string-name></person-group>, &#x201C;<article-title>A survey and future perspectives of hybrid deep learning models for text classification</article-title>,&#x201D; in <conf-name>Proc. ICAIS</conf-name>, <conf-loc>Dublin, Ireland</conf-loc>, pp. <fpage>358</fpage>&#x2013;<lpage>369</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Jumadinova</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Bonham-Carter</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Zheng</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Camara</surname></string-name> and <string-name><given-names>D.</given-names> <surname>Shi</surname></string-name></person-group>, &#x201C;<article-title>A novel framework for biomedical text mining</article-title>,&#x201D; <source>Journal on Big Data</source>, vol. <volume>2</volume>, no. <issue>4</issue>, pp. <fpage>145</fpage>&#x2013;<lpage>155</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>J.</given-names> <surname>Devlin</surname></string-name>, <string-name><given-names>M. W.</given-names> <surname>Chang</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Lee</surname></string-name> and <string-name><given-names>K.</given-names> <surname>Toutanova</surname></string-name></person-group>, &#x201C;<article-title>Bert: Pre-training of deep bidirectional transformers for language understanding</article-title>,&#x201D; arXiv Preprint, arXiv1810.04805, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>T.</given-names> <surname>Wolf</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Debut</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Sanh</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chaumond</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rush</surname></string-name></person-group>, &#x201C;<article-title>Transformers: State-of-the-art natural language processing</article-title>,&#x201D; in <conf-name>Proc. the 2020 Conf. on Empirical Methods in Natural Language Processing: System Demonstrations</conf-name>, Online, pp. <fpage>38</fpage>&#x2013;<lpage>45</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Vaswani</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Shazeer</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Parmar</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Uszkoreit</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Jones</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Attention is all you need</article-title>,&#x201D; in <conf-name>Proc. Advances in Neural Information Processing Systems</conf-name>, <conf-loc>California, USA</conf-loc>, pp. <fpage>5998</fpage>&#x2013;<lpage>6008</lpage>, <year>2017</year>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>R.</given-names> <surname>Tang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Lu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Liu</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Mou</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Vechtomova</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Distilling task-specific knowledge from bert into simple neural networks</article-title>,&#x201D; arXiv Preprint, arXiv1903.12136, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>M.</given-names> <surname>Wasserblat</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Pereg</surname></string-name> and <string-name><given-names>P.</given-names> <surname>Izsak</surname></string-name></person-group>, &#x201C;<article-title>Exploring the boundaries of low-resource bert distillation</article-title>,&#x201D; in <conf-name>Proc. SustaiNLP: Workshop on Simple and Efficient Natural Language Processing</conf-name>, Online, pp. <fpage>35</fpage>&#x2013;<lpage>40</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>E.</given-names> <surname>Strubell</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Ganesh</surname></string-name> and <string-name><given-names>A.</given-names> <surname>McCallum</surname></string-name></person-group>, &#x201C;<article-title>Energy and policy considerations for deep learning in NLP</article-title>,&#x201D; arXiv Preprint, arXiv1906.02243, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A. S.</given-names> <surname>Maiya</surname></string-name></person-group>, &#x201C;<article-title>Ktrain: A low-code library for augmented machine learning</article-title>,&#x201D; arXiv Preprint, arXiv2004.10703, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>V.</given-names> <surname>Sanh</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Debut</surname></string-name>, <string-name><given-names>J.</given-names> <surname>Chaumond</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Wolf</surname></string-name></person-group>, &#x201C;<article-title>DistilBERT, a distilled version of BERT: Smaller, faster, cheaper and lighter</article-title>,&#x201D; arXiv Preprint, arXiv1910.01108, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>B.</given-names> <surname>B&#x00FC;y&#x00FC;k&#x00F6;z</surname></string-name>, <string-name><given-names>A.</given-names> <surname>H&#x00FC;rriyeto&#x011F;lu</surname></string-name> and <string-name><given-names>A.</given-names> <surname>&#x00D6;zg&#x00FC;r</surname></string-name></person-group>, &#x201C;<article-title>Analyzing ELMo and DistilBERT on socio-political news classification</article-title>,&#x201D; in <conf-name>Proc. the Workshop on Automated Extraction of Socio-Political Events from News 2020</conf-name>, <conf-loc>Marseille, France</conf-loc>, pp. <fpage>9</fpage>&#x2013;<lpage>18</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>L. N.</given-names> <surname>Smith</surname></string-name></person-group>, &#x201C;<article-title>A disciplined approach to neural network hyper-parameters: Part 1--learning rate, batch size, momentum, and weight decay</article-title>,&#x201D; arXiv Preprint, arXiv1803.09820, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>I.</given-names> <surname>Loshchilov</surname></string-name> and <string-name><given-names>F.</given-names> <surname>Hutter</surname></string-name></person-group>, &#x201C;<article-title>SGDR: Stochastic gradient descent with warm restarts</article-title>,&#x201D; arXiv Preprint, arXiv1608.03983, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>S. I.</given-names> <surname>Wang</surname></string-name> and <string-name><given-names>C. D.</given-names> <surname>Manning</surname></string-name></person-group>, &#x201C;<article-title>Baselines and bigrams: Simple, good sentiment and topic classification</article-title>,&#x201D; in <conf-name>Proc. the 50th Annual Meeting of the Association for Computational Linguistics</conf-name>, <conf-loc>Jeju Island, Korea</conf-loc>, pp. <fpage>90</fpage>&#x2013;<lpage>94</lpage>, <year>2012</year>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>I. L.</given-names> <surname>Laily</surname></string-name>, <string-name><given-names>I.</given-names> <surname>Budi</surname></string-name>, <string-name><given-names>A. B.</given-names> <surname>Santoso</surname></string-name> and <string-name><given-names>P. K.</given-names> <surname>Putra</surname></string-name></person-group>, &#x201C;<article-title>Mining Indonesia tourism&#x2019;s reviews to evaluate the services through multilabel classification and LDA</article-title>,&#x201D; in <conf-name>Proc. 2020 Int. Conf. on Electrical Engineering and Informatics</conf-name>, <conf-loc>Yogyakarta, Indonesia</conf-loc>, pp. <fpage>1</fpage>&#x2013;<lpage>7</lpage>, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Mutanov</surname></string-name>, <string-name><given-names>V.</given-names> <surname>Karyukin</surname></string-name> and <string-name><given-names>Z.</given-names> <surname>Mamykova</surname></string-name></person-group>, &#x201C;<article-title>Multi-class sentiment analysis of social media data with machine learning algorithms</article-title>,&#x201D; <source>Computers, Materials &#x0026; Continua</source>, vol. <volume>69</volume>, no. <issue>1</issue>, pp. <fpage>913</fpage>&#x2013;<lpage>930</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-22"><label>[22]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><given-names>L.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Zhou</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Duan</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Chen</surname></string-name></person-group>, &#x201C;<article-title>A hierarchical multi-input and output bi-GRU model for sentiment analysis on customer reviews</article-title>,&#x201D; in <conf-name>Proc. IOP Conf. Series: Materials Science and Engineering</conf-name>, <conf-loc>Xi'an in China</conf-loc>, vol. <volume>322</volume>, no. <issue>6</issue>, <year>2018</year>.</mixed-citation></ref>
<ref id="ref-23"><label>[23]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>A.</given-names> <surname>Joulin</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Grave</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Bojanowski</surname></string-name> and <string-name><given-names>T.</given-names> <surname>Mikolov</surname></string-name></person-group>, &#x201C;<article-title>Bag of tricks for efficient text classification</article-title>,&#x201D; arXiv Preprint, arXiv1607.01759, <year>2016</year>.</mixed-citation></ref>
<ref id="ref-24"><label>[24]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>O.</given-names> <surname>Kovaleva</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Romanov</surname></string-name>, <string-name><given-names>A.</given-names> <surname>Rogers</surname></string-name> and <string-name><given-names>A.</given-names> <surname>Rumshisky</surname></string-name></person-group>, &#x201C;<article-title>Revealing the dark secrets of BERT</article-title>,&#x201D; arXiv Preprint, arXiv1908.08593, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-25"><label>[25]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>H.</given-names> <surname>Mao</surname></string-name>, and <string-name><given-names>W. J.</given-names> <surname>Dally</surname></string-name></person-group>, &#x201C;<article-title>Deep compression: Compressing deep neural networks with pruning, trained quantization and huffman coding</article-title>,&#x201D; <source>Fiber</source>, vol. <volume>56</volume>, no. <issue>4</issue>, pp. <fpage>3</fpage>&#x2013;<lpage>7</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-26"><label>[26]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>G.</given-names> <surname>Hinton</surname></string-name>, <string-name><given-names>O.</given-names> <surname>Vinyals</surname></string-name> and <string-name><given-names>J.</given-names> <surname>Dean</surname></string-name></person-group>, &#x201C;<article-title>Distilling the knowledge in a neural network</article-title>,&#x201D; <source>Computer Science</source>, vol. <volume>14</volume>, no. <issue>7</issue>, pp. <fpage>38</fpage>&#x2013;<lpage>39</lpage>, <year>2015</year>.</mixed-citation></ref>
<ref id="ref-27"><label>[27]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>Z.</given-names> <surname>Lan</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Chen</surname></string-name>, <string-name><given-names>S.</given-names> <surname>Goodman</surname></string-name>, <string-name><given-names>K.</given-names> <surname>Gimpel</surname></string-name>, <string-name><given-names>P.</given-names> <surname>Sharma</surname></string-name> and <string-name><given-names>R.</given-names> <surname>Soricut</surname></string-name></person-group>, &#x201C;<article-title>Albert: A lite bert for self-supervised learning of language representations</article-title>,&#x201D; arXiv Preprint, arXiv1909.11942, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-28"><label>[28]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Jiao</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Yin</surname></string-name>, <string-name><given-names>L.</given-names> <surname>Shang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Jiang</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Chen</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Tinybert: Distilling bert for natural language understanding</article-title>,&#x201D; arXiv Preprint, arXiv1909.10351, <year>2019</year>.</mixed-citation></ref>
<ref id="ref-29"><label>[29]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>X.</given-names> <surname>Han</surname></string-name>, <string-name><given-names>Z.</given-names> <surname>Zhang</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Ding</surname></string-name>, <string-name><given-names>Y.</given-names> <surname>Gu</surname></string-name>, <string-name><given-names>X.</given-names> <surname>Liu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Pre-trained models: Past, present and future</article-title>,&#x201D; <source>AI Open</source>, vol. <volume>147</volume>, no. <issue>1</issue>, pp. <fpage>1834</fpage>&#x2013;<lpage>1841</lpage>, <year>2021</year>.</mixed-citation></ref>
<ref id="ref-30"><label>[30]</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Gonz&#x00E1;lez-Carvajal</surname></string-name> and <string-name><given-names>E. C.</given-names> <surname>Garrido-Merch&#x00E1;n</surname></string-name></person-group>, &#x201C;<article-title>Comparing BERT against traditional machine learning text classification</article-title>,&#x201D; arXiv Preprint, arXiv2005.13012, <year>2020</year>.</mixed-citation></ref>
<ref id="ref-31"><label>[31]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><given-names>S.</given-names> <surname>Minaee</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Kalchbrenner</surname></string-name>, <string-name><given-names>E.</given-names> <surname>Cambria</surname></string-name>, <string-name><given-names>N.</given-names> <surname>Nikzad</surname></string-name>, <string-name><given-names>M.</given-names> <surname>Chenaghlu</surname></string-name> <etal>et al.,</etal></person-group> &#x201C;<article-title>Deep learning--Based text classification: A comprehensive review</article-title>,&#x201D; <source>ACM Computing Surveys</source>, vol. <volume>54</volume>, no. <issue>3</issue>, pp. <fpage>1</fpage>&#x2013;<lpage>40</lpage>, <year>2021</year>.</mixed-citation></ref>
</ref-list>
</back>
</article>