<!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>Topic Sentiment Joint Model with Word Embeddings</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Xianghua Fu</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Haiying Wu</string-name>
          <email>whywuhaiying@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Laizhong Cui</string-name>
          <email>cuilz@szu.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>College of Computer Science and Software Engineering, Shenzhen University</institution>
          ,
          <addr-line>Shenzhen Guangdong 518060</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <fpage>41</fpage>
      <lpage>48</lpage>
      <abstract>
        <p>Topic sentiment joint model is an extended model which aims to deal with the problem of detecting sentiments and topics simultaneously from online reviews. Most of existing topic sentiment joint modeling algorithms infer resulting distributions from the co-occurrence of words. But when the training corpus is short and small, the resulting distributions might be not very satisfying. In this paper, we propose a novel topic sentiment joint model with word embeddings (TSWE), which introduces word embeddings trained on external large corpus. Furthermore, we implement TSWE with Gibbs sampling algorithms. The experiment results on Chinese and English data sets show that TSWE achieves significant performance in the task of detecting sentiments and topics simultaneously.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        With the rapid development of e-commerce and social media, it is extremely urgent and
valuable to automatically analyze the reviews to detect sentiments and topics
simultaneously. Great effort on new methodologies for detecting topics and sentiments
simultaneously has flourished in the recent years [
        <xref ref-type="bibr" rid="ref1 ref2 ref3 ref4 ref5">1-5</xref>
        ].
      </p>
      <p>
        Several works extending probabilistic topic models[
        <xref ref-type="bibr" rid="ref6 ref7">6,7</xref>
        ] have been designed to
tackle the problem of the joint extraction of sentiments and latent topics from
documents in the recent years [
        <xref ref-type="bibr" rid="ref2 ref3 ref8">2, 3, 8</xref>
        ]. The joint sentiment topic model (JST) [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] extends
LDA to a four-layer model by adding an additional sentiment layer between the
document and the topic layers. Topic sentiment mixture (TSM) [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] jointly models topics and
sentiments in the corpus built on the basis of PLSI. These approaches infer sentiment
and topic distributions from the co-occurrence of words within documents. However,
when the training corpus is small or when the documents are short, the sentiment and
topic distributions might be not very satisfactory. Additionally, most of recent works
[
        <xref ref-type="bibr" rid="ref2 ref3 ref9">2, 3, 9</xref>
        ] try to incorporate some polarity lexicons into their models as the prior
knowledge. However, these approaches still have their limitations, for example if the
polarity lexicons are not rich, the improvement of the prior is very limited. As a result,
we have to seek for other approaches.
      </p>
      <p>
        Most recently, word embeddings are gaining more and more attention, since they
show very good performance in a broad range of natural language processing (NLP)
tasks [
        <xref ref-type="bibr" rid="ref10 ref11 ref12">10-12</xref>
        ]. For example, [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] incorporates latent feature vector representations of
words to LDA model, and [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ] employs latent topic models to assign topics for each
word in the text corpus, and learns topical word embeddings (TWE). But these models
only complete the task of mining topics. Little attention has been devoted to topic
sentiment model with word embeddings so far. In this paper, we propose a new topic
sentiment model which incorporates word embeddings. To the best of our knowledge, it is
the first work to formulate topic sentiment model with word embeddings.
      </p>
      <p>In contrast with other topic sentiment modeling frameworks, our model is
distinguished from them as follows: (1) we incorporate word embeddings trained on very
large corpora. It significantly improves the sentiment-topic-word mapping and extends
semantic and syntactic information of words. (2) experiments are performed on four
real online review data sets for two kinds of language (English and Chinese), which
show that our model is used more extensive. (3) we also compare the performance on
incorporating the sentiment polarity and without introducing sentiment polarity
respectively to demonstrate that our new model is fully unsupervised. We find that our
unsupervised model is highly portable to other domains for the sentiment classification task
and achieves significant performance in the task of sentiment analysis, and extracting
sentiment-specific topics.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Topic and Sentiment Model with Word Embeddings</title>
      <p>
        In this section, we propose a novel topic sentiment model with word embeddings called
TSWE, as shown in Fig. 1. TSWE is formed by taking the original topic sentiment
model JST [
        <xref ref-type="bibr" rid="ref2 ref3">2, 3</xref>
        ] and replacing their Dirichlet multinomial component with a two
components mixture of a sentiment-topic-to-word Dirichlet multinomial component and a
word embeddings component. Our model defines the probability that it generates a
word from embeddings component as the multinomial distribution with:
      </p>
      <p>The negative log likelihood according to our model factorizes topic-wise into
factors for each topic associated with sentiment. we derive:</p>
      <p>
        Then we apply L-BFGS implementation [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] from the Mallet toolkit [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] to derive
the topic vector that minimizes .
2.2
      </p>
      <sec id="sec-2-1">
        <title>Generative process for the TSWE model</title>
        <p>The formal definition of the generative process of TSWE model is as follows:
For each of sentiment-topic pair ( , )</p>
        <p>generate the word distribution of the sentiment-topic pair ~
For each document</p>
        <p>draw a multinomial distribution ~
For each sentiment label under document</p>
        <p>draw a multinomial distribution ~
For each word in document
-draw a sentiment label ~
-draw a topic ~
-draw a binary indicator variable ~
-draw a word ~
2.3</p>
      </sec>
      <sec id="sec-2-2">
        <title>Gibbs sampling for TSWE model</title>
        <p>
          In this section, we introduce the Gibbs sampling algorithm [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] for the TSWE
model.The detailed derivation process on Gibbs Sampling for topic models can refer
the literature [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ].
        </p>
        <p>The Posterior probability can be obtained from the joint probability as follows:
Samples derived from the Markov chain are then used to estimate , and
picted in equation (4), (5), (6).
(2)
(3)
as
de(4)
(5)</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Experiment</title>
      <p>In this section, we explore the performance of TSWE model on document-level
sentiment classification and topic extraction evaluations on different kinds of datasets for
English and Chinese.
3.1</p>
      <sec id="sec-3-1">
        <title>Experimental setup</title>
      </sec>
      <sec id="sec-3-2">
        <title>3.1.1 Training word embeddings</title>
        <p>
          We train 300 dimensional word embeddings on two corpus by using the Google
word2vec toolkit [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ]: Chinese Wikipedia1 and English Wikipedia2.
        </p>
      </sec>
      <sec id="sec-3-3">
        <title>3.1.2 Experimental datasets</title>
        <p>We perform experiments on two kinds of sentiment mining datasets, Chinese and
English. Chinese datasets consists of three categories of product reviews datasets3 including
book, hotel, and computer, with 1000 positive and 1000 negative examples for each
domain. English corpora is the polarity dataset version 2.04 which is introduced by Pang
and Lee in 2004, consisting of 1000 positive and 1000 negative movie reviews, which
we call MR04 dataset.</p>
        <p>Preprocessing: We remove the repetitive comments and stop words, the words that
word frequencies are less than 2 or larger than 15 and the words that are not found in
Google embeddings representations trained from Chinese Wikipedia corpus and
English Wikipedia corpus. In addition, we perform word segment for Chinese datasets
3.2</p>
      </sec>
      <sec id="sec-3-4">
        <title>Parameter Setting</title>
        <p>
          We set the symmetric prior hyper-parameter =0.01 in our TSWE model. The
symmetric hyper-parameter is set to , where is the average document length and
is total number of sentiment labels, as noted by [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ]. The is set to the standard
setting .
3.3
        </p>
      </sec>
      <sec id="sec-3-5">
        <title>Experimental Results and Analysis</title>
        <p>In this section, we present and discuss the experimental results of both document-level
sentiment classification and topic extraction.</p>
      </sec>
      <sec id="sec-3-6">
        <title>3.3.1 Sentiment classification evaluation</title>
        <p>We use the common metrics to evaluate classification performance: Accuracy. Table 1
presents classification accuracy results obtained by TSWE on the computer data set
with the number of topics set to either 1 or 20. By varying , as shown in Table 1,
the TSWE model obtains its best result at =0.1, where the is set 0.1 to 0.5 is better
than =0.0 on computer data sets. That shows the word embeddings is effective in
capturing positive and negative sentiments. So we fix at 0.1, and report experimental
results based on this value for the rest of this section.
5 http://www.cs.pitt.edu/mpqa/
6 http://www.datatang.com/datares/go.aspx?dataid=603399</p>
      </sec>
      <sec id="sec-3-7">
        <title>3.3.2 Topic extraction evaluation.</title>
        <p>
          The other goal of evaluation task is to extract topics and evaluate the effectiveness of
sentiment topic. First we need to evaluate the topic clustering performance under the
corresponding sentiment polarity. We use two common metrics to evaluate the
performance: perplexity and normalized mutual information(NMI)[
          <xref ref-type="bibr" rid="ref18">18</xref>
          ]. More formally, for
a test set of documents, the perplexity is:
2400
1600
y
t
i
x
e
l
rep 800
p
0
computer
hotel
        </p>
        <p>MR04</p>
        <p>book
1
5
10
20
40
60
80</p>
        <p>100
K
topics extracted from computer data set with JST and TSWE. Each row shows the top
15 words for corresponding topics. We can see that some words of TSWE such as
“cooling,f an,r adiator,v oice , temperature, workmanship, operation”a rea boutt hec om-­
puter Heat-dissipationp roblem,a nds omew ordss ucha s“ good, quietness, perfect, like,
nice, suitable” are the emotional tendencies of the computer Heat -dissipation problem.
It shows that TSWE can extract topic and sentiment simultaneously. Overall, the above
analysis illustrates the effectiveness of TSWE in extracting opinionated topics under
sentiment from a corpus.
In this paper, we propose a novel unsupervised generative model (TSWE) for jointly
mining sentiments, sentiment-specific topics from online reviews. To the best of our
knowledge, this is the first work to model topic sentiment joint model with word
embeddings. Most importantly, the experiments on real review data sets for English and
Chinese show that TSWE is effective in discovering sentiments and topics
simultaneously. In the future work, we will explore how to properly introduce the lexicon with
HowNet lexicon to improve the performance of detecting sentiments and
sentimentspecific topics.</p>
      </sec>
      <sec id="sec-3-8">
        <title>Acknowledgements.</title>
        <p>This research is supported by the National Nature Science Foundation of China under
Grants 61472258, 61402294, National Key Technology Research and Development
Program of the Ministry of Science and Technology of China (2014BAH28F05),
Science and Technology Foundation of Shenzhen City under Grants
JCYJ20140509172609162 and JCYJ20130329102032059.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Dermouche</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kouas</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Velcin</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loudcher</surname>
            ,
            <given-names>S.:</given-names>
          </string-name>
          <article-title>A Joint Model for Topic-Senti ment Modeling from Text</article-title>
          .
          <source>In: ACM/SIGAPP Symposium On Applied Computing (SAC)</source>
          .
          <article-title>(</article-title>
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Joint sentiment/topic model for sentiment analysis</article-title>
          .
          <source>In: Proceedings of the 18th ACM conference on Information and knowledge management</source>
          , pp.
          <fpage>375</fpage>
          -
          <lpage>384</lpage>
          . ACM, (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>He</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Everson</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rüger</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Weakly supervised joint sentiment-topic detec tion from text. Knowledge and Data Engineering</article-title>
          , IEEE Transactions on
          <volume>24</volume>
          ,
          <fpage>1134</fpage>
          -
          <lpage>1145</lpage>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Pavitra</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kalaivaani</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Weakly supervised sentiment analysis using joint sentiment topic detection with bigrams</article-title>
          .
          <source>In: Electronics and Communication Systems (ICECS)</source>
          ,
          <year>2015</year>
          2nd International Conference on, pp.
          <fpage>889</fpage>
          -
          <lpage>893</lpage>
          . IEEE, (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Brody</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elhadad</surname>
            ,
            <given-names>N.:</given-names>
          </string-name>
          <article-title>An unsupervised aspect-sentiment model for online reviews</article-title>
          . In: Human Language Technologies:
          <article-title>The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics</article-title>
          , pp.
          <fpage>804</fpage>
          -
          <lpage>812</lpage>
          . Association for Computational Linguistics, (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Blei</surname>
            ,
            <given-names>D.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ng</surname>
            ,
            <given-names>A.Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jordan</surname>
            ,
            <given-names>M.I.</given-names>
          </string-name>
          :
          <article-title>Latent dirichlet allocation</article-title>
          .
          <source>the Journal of machine Learning research 3</source>
          ,
          <fpage>993</fpage>
          -
          <lpage>1022</lpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Probabilistic latent semantic indexing</article-title>
          .
          <source>In: Proceedings of the 22nd an nual international ACM SIGIR conference on Research and development in information retrieval</source>
          , pp.
          <fpage>50</fpage>
          -
          <lpage>57</lpage>
          . ACM, (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Mei</surname>
            ,
            <given-names>Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ling</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wondra</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Su</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhai</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Topic sentiment mixture: modeling facets and opinions in weblogs</article-title>
          .
          <source>In: Proceedings of the 16th international conference on World Wide Web</source>
          , pp.
          <fpage>171</fpage>
          -
          <lpage>180</lpage>
          . ACM, (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.-T.,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
          </string-name>
          , J.,
          <string-name>
            <surname>Sun</surname>
          </string-name>
          , J.-T.,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Sentiment Topic Model with Decomposed Prior</article-title>
          . In: SDM, pp.
          <fpage>767</fpage>
          -
          <lpage>775</lpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>D.Q.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Billingsley</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Du</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Johnson</surname>
          </string-name>
          , M.:
          <article-title>Improving Topic Models with La tent Feature Word Representations</article-title>
          .
          <source>Transactions of the Association for Computational Linguistics</source>
          <volume>3</volume>
          ,
          <fpage>299</fpage>
          -
          <lpage>313</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chua</surname>
          </string-name>
          , T.-S.,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Topical Word Embeddings</article-title>
          . In: AAAI, pp.
          <fpage>2418</fpage>
          -
          <lpage>2424</lpage>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zaheer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dyer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Gaussian LDA for topic models with word embeddings</article-title>
          .
          <source>In: Proceedings of the 53nd Annual Meeting of the Association for Computational Linguistics</source>
          . (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>D.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nocedal</surname>
          </string-name>
          , J.:
          <article-title>On the limited memory BFGS method for large scale optimiza tion</article-title>
          .
          <source>Mathematical programming</source>
          <volume>45</volume>
          ,
          <fpage>503</fpage>
          -
          <lpage>528</lpage>
          (
          <year>1989</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>McCallum</surname>
            ,
            <given-names>A.K.</given-names>
          </string-name>
          :
          <article-title>{MALLET: A Machine Learning for Language Toolkit}</article-title>
          . (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Walsh</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Markov chain monte carlo and gibbs sampling</article-title>
          . (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Heinrich</surname>
          </string-name>
          , G.:
          <article-title>Parameter estimation for text analysis</article-title>
          .
          <source>Technical report</source>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sutskever</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          :
          <article-title>Distributed representa tions of words and phrases and their compositionality</article-title>
          .
          <source>In: Advances in neural information processing systems</source>
          , pp.
          <fpage>3111</fpage>
          -
          <lpage>3119</lpage>
          . (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Manning</surname>
            ,
            <given-names>C.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Raghavan</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Schütze</surname>
          </string-name>
          , H.:
          <article-title>Introduction to information retrieval</article-title>
          . Cambridge university press Cambridge (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>