<!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>
      <journal-title-group>
        <journal-title>May</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>An Emotion-driven Approach for Aspect-based Opinion Mining</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Marco Polignano ()</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Pierpaolo Basile</string-name>
          <email>pierpaolo.basile@uniba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Marco de Gemmis</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Giovanni Semeraro</string-name>
          <email>giovanni.semeraro@uniba.it</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>University of Bari \Aldo Moro", Dept. of Computer Science</institution>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2018</year>
      </pub-date>
      <volume>2</volume>
      <fpage>8</fpage>
      <lpage>30</lpage>
      <abstract>
        <p>The remarkable ability to understand the opinion of a user about a speci c topic of discussion allows intelligent systems to provide more speci c and personalized suggestions especially when no other information is available. The strategies for opinion mining, also known as sentiment analysis, are in last years topic of in-depth studies. In this work, we present an approach of text mining for detecting the topic of discussion for textual contents and the emotion that the writer feels while writing it. Conversely to the classic strategies of sentiment analysis, we enrich the standard polarity prediction task with more ne-grained information about user's emotion. By using this information, the nal behavior of the personalized system could be designed by taking into account the view about the topic of the speci c user. For performing this task, we adopted a hybrid approach which uses both lexicons and semantic representation of sentences for the operation of aspect classication. Training data for the aspects detection module have been extracted from already categorized last year world news. The emotional labeling approach is, instead, based on the posts left by users on Facebook, which have been annotated using the emoticon encountered. The evaluation has been conducted on a dataset of tweets opportunely collected using hash-tags which refer both to the topic of discussion and the emotional opinion.</p>
      </abstract>
      <kwd-group>
        <kwd>Opinion Mining</kwd>
        <kwd>Sentiment Analysis</kwd>
        <kwd>Emotions</kwd>
        <kwd>Aspects Detection</kwd>
        <kwd>User Modeling</kwd>
        <kwd>Social Network Sites</kwd>
        <kwd>Natural Language Processing</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The high di usion of many social platforms has made possible the collection of
information about di erent aspects of the user's life. In this scenario, starting
from user-generated contents, the system should be able to detect the topic of
the discussion and the opinion of the user about it. This operation, recently,
has become popular with the name of opinion mining and sentiment analysis. A
prominent area of application is the analysis of e-commerce user reviews.
Sentiment analysis for the construction of a holistic user pro le can take advantages
of a more ne-grained emotional annotation of relevant aspects of a topic. In a
general domain, such as "travels", it could be interesting to note that the
information "the user is scared by traveling", is completely di erent from "the user
is angry about traveling". In the rst case, a personalized system will never
suggest to the user to take an airplane to far holiday countries. In the second case,
it can start to recommend many o ers and discounts for traveling again maybe
with a di erent airline company. According to this idea, we suggest the
adoption of a general approach for annotating user-generated content with a topic
of discussion (if possible, with a speci c aspect the user is talking about), and
an emotional label. In particular, we focused on eighth general areas of
application: technology, travels, style, sports, politics, music, movies, and art. In Sec.
3, we propose a strategy for automatically annotate a sentence with one topic
of the discussion, by learning a dynamic semantic representation of words from
newspapers. Moreover, in Sec. 5 we use a word2Vec semantic annotation [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ] of
words for detecting the sentiment of text associated with the aspects recognized.
Finally, in Sec. 6, the approach has been evaluated on a set of tweets annotated
with hash-tags corresponding to the considered topics and emotions.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>The opinion mining is a complex task which commonly merges the results of two
sub-tasks which are resolved independently and combined in a single result only
at the end of the process. The rst is the aspect opinion extraction; the second
is the sentiment annotation.
2.1</p>
      <sec id="sec-2-1">
        <title>Approaches for aspect opinion annotation</title>
        <p>
          The opinion mining on a textual content has the purpose of discovering one or
more aspects or entities which the writer is talking about. A common approach
for dealing with opinion extraction is topic modeling [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ] based on unsupervised
probabilistic models such as pLSA (Probabilistic Latent Semantic Indexing) [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ]
and LDA (Latent Dirichlet Allocation) [
          <xref ref-type="bibr" rid="ref1">1</xref>
          ]. In each document, a latent aspect is
chosen according to a multinomial distribution, controlled by a Dirichlet prior
[
          <xref ref-type="bibr" rid="ref14">14</xref>
          ].In that way it is possible to estimate the probability that a word is used
in a speci c topic of discussion, providing the information required for the task
of words classi cation and aspects extraction. The weakness of the process is
based on the lack of precision and internal cohesion of the topic words which in
a domain of opinion mining can be an important missing characteristic. Despite
this classic approach, recently supervised techniques, based on Neural Network
are showing interesting performance improvements over the task. A common
procedure is the use of word embeddings [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ] and NLP features, such as words
and bi-grams for feeding that algorithms. Liu [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] uses the RNNs (Recurrent
Neural Networks) and amazon embeddings for successfully identify the opinion
target over the SemEval2014 competition1. In this work, we will follow the idea
of using word-embeddings and natural language elaboration of text for
obtaining relevant features for annotating sentences with the correspondent topic of
discussion using an SVM classi er.
2.2
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>Emotional labeling for opinion mining</title>
        <p>
          The emotional labeling of aspects, detected in spans of text, is commonly
approached by strategies of polarity annotation (positive, negative, neutral /
objective). Most of them are based on the polarity score associated with each word
in a standard lexicon or thesaurus [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. There are many types of lexicons at
stateof-the-art that contain nouns, adverbs and verbs, uni-grams, bi-grams and also
misspelling and morphological variants annotated with a numeric value which
can be in a range [ 1; 1]. In all that cases the main limitation is the presence
of only most-used frequent words in a standard domain (news documents). In
real-world domains, such as that of reviews or social media, they are not able
to correctly detect all the di erent contractions and variations in words which
are encounter. A strategy of acting is, conversely, provided by machine learning
algorithms which have been commonly used for the task in the last decade. One
of the pioneers has been Pang [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ] that classi es reviews utilizing an SVM and a
Naive Bayes algorithm for the binary classi cation of subjective sentences.
Approaches based on an ensemble of classi ers have also been proposed. Wang [
          <xref ref-type="bibr" rid="ref16">16</xref>
          ],
combines ve di erent learners: Naive Bayes, Maximum Entropy, Decision tree,
K-NN, and SVM. Most of these approaches, formalize the sentences
considering only the syntactic aspect of the words, ignoring the semantic. Conversely,
Tang [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] proposed a strategy for learning sentiment-speci c words embeddings
able to formalize the semantic di erences between opposite polarity words using
three neural networks for learning sentiment-speci c word embedding (SSWE).
The approach was evaluated on a dataset of Tweets, comparing it with some of
the most famous classical approaches based on SVM and Naive Bayes obtaining
breaking results. These outcomes demonstrated the importance to include word
embeddings in strategies of text classi cation, supporting the interest showed in
this work for that approach.
3
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Opinion mining based on user emotions</title>
      <p>The state of the art described in Sec. 2 points out many issues about opinion
mining, including the limitations derived by annotating a single review with only
a binary polarity label. In some cases, to overcome the limit more ne-grained
intervals of polarity have been added such as "almost positive" or "almost
negative", but the information about what kind of emotion the user is trying to
expose is still missing.</p>
      <p>
        The opinion mining strategy proposed in this work aims to de ne a general
1 http://alt.qcri.org/semeval2014/task4/
model for annotating textual sentences, including textual sources which are not
reviews, with a macro topic of discussion and an emotional label. We decided
to adopt the Ekman model of emotions [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] which include six primary emotional
reactions: joy, sadness, fear, disgust, surprise, anger. We decided, furthermore,
to assume that each speci c sentence to process has been already analyzed and
removed from the processing pipeline if it has been considered neutral/objective.
Each sentence, in our discussion, is deemed to be self-reliant and about only one
topic of discussion with a main emotional opinion. These assumptions help us
to do not focus the work on common issues already deeply approached in
stateof-the-art, and, on the contrary, to exhaustively describe the two annotation
strategies proposed. The process starts with some self-reliant sentences provided
as an input of the "Emotion-driven Opinion Mining" pipeline. The sentences
provided are pre-processed for removing additional extra characters which can
produce noise for the analysis. In particular, we removed "HTML" characters,
emails and not UTF-8 letters. Hashtags, commonly used in Twitter, are replaced
with the special sequence T AG concatenated with the original piece of text.
Users cited through @ are, instead, replaced with the EN T IT Y sequence. A
similar approach is used for links which are replaced with U RL . The "emoji"
in the text have been opportunely annotated using the library "Java-Emoji" 2
in the format ":&lt; nameOf Emoji &gt;:". The text opportunely pre-processed is
then analyzed independently by the two annotation modules which are detailed
in following sections. The result provided by the system is then a topic label
among technology, politics, travel, style, sport, music, movies, art; and an
emotional tag among joy, fear, sadness, anger, surprise, disgust. These labels can be
consequently used for further operations of pro ling or personalization.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>Topic detection module</title>
      <p>The module of topic detection task usually involves approaches to span analysis
or aspect detection. In our approach, we consider only one topic of discussion
at a sentence level. Consequently, it is possible to formalize the topic detection
as a multi-class classi cation problem. We decided to use a supervised approach
based on SVM as consequence of the optimal results obtained by this algorithm
in literature. Eight main topics of discussion have been considered relevant:
technology, politics, travel, style, sport, music, movies, art; but the set
is easily extensible when new data about di erent topics are provided as a
training set of the model. In order to collect enough data for training the model,
we developed a crawler of web news already classi ed by humans in that
categories. In particular, we chose " ipboard.com" 3 as a platform candidate for the
task. The website provides a set of thematic news classi ed in a huge number of
categories by the user which shares or writes it. They are free to be read, and
they are available through "RSS". When invoked, it provides a list of the last
ten news about a speci c topic published on the social platform. We collected</p>
      <sec id="sec-4-1">
        <title>2 https://github.com/vdurmont/emoji-java 3 https://flipboard.com/</title>
        <p>all the articles about the de ned topics from the rst of June 2017 to the 31st
of December 2017. For each one, we stored the abstract provided by the RSS
system, and the content of the article obtained by visiting its published link and
stripped by "HTML" tags using Jsoup library 4.</p>
        <p>Dataset. The dataset collected contains in total more than 400.000 articles
subdivided as follow, and it is available at: http://bit.ly/EOM dataset</p>
        <p>Each news collected is formalized through its link, title, summary and textual
content in English language. The table 1 describes the distribution of the
articles among the categories and the section of the dataset used for training the
algorithm. It is important to note that it has been resized for dealing with the
computational cost necessary for processing them. In particular, only the 27,69%
of the original dataset has been used, keeping intact the original ratio which
identi es the sports category as the most discussed on the web. Moreover, the 60%
of the resized dataset has been used as a training set of the method. The last
40% is used half as dev dataset for the optimization of the parameters and the
last half as a training set.</p>
        <p>
          Methodology. The implementation of the SVM algorithm used in this work
is the one provided by LibSVM 5 [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. We used the C-Support Vector Classi
cation for solving a Multi-class Classi cation problem approached with a
'oneagainst-one' implementation. For each pair of classes a C-SVM is constructed
for optimizing the error minimization problem:
min 1 wtw + C
w;b;" 2
        </p>
        <p>l
X "i
i=1
(1)
4 https://jsoup.org/
5 https://www.csie.ntu.edu.tw/~cjlin/libsvm/
where w are the features vectors for each xi; i = 1; 2; :::l training vectors, is the
error and C &gt; 0 is the regularization parameter. This observation points out the
necessity to optimize the choice of C for obtaining accurate results. Moreover,
changing the dimensionality and the content of the features vectors w it is
possible to obtain completely di erent results.</p>
        <p>
          Vectorial representation of text. We modeled the representation of the
content of articles using both a binary n-grams representation and word embeddings
features vectors. The transformation of the plain-text into unigrams and bigrams
have been implemented through the Apache Lucene Standard Analyzer class 6.
The class uses a default English set of stop-words and a grammar-based tokenizer
with a max length of tokens set to 2. For each n-gram, we use its frequency in the
document as a numerical feature. The formalization through a vector of word
embeddings has been approached averaging the singular embedding vectors of the
words encountered in the document into only one per document. In particular,
the word-embedding procedure used is word2vec [
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] introduced by Mikolov. In
particular, we used the whole corpus of 400K news for training, through CBOW
(Continuous Bag-of-Words) and ten epochs of learning, 100 dimensionality
vectors of words with a minimum number of occurrences in the collection equal to
5. Moreover, for including the in uence of the writing style used on Twitter we
used a corpus of 1.3 millions of generic tweets collected during the week from the
22nd to the 28th of January 2018 for training, at the same way, 50 dimensionality
vectors. The nal vectorial representation of each news is then the concatenation
of three groups of features: bag-of-words (unigrams and bigrams), 100 features
of word2vec space learned on the news, 50 features of word2vec space learned
on tweets.
        </p>
        <p>Optimization of parameters. The model has been optimized considering two
parameters: the C regularization parameter of the SVM and the features used for
representing the information. We started testing four settings for the C value: 1,
2, 4, 8 xing the representation of the data as the concatenation of the all features
available. After we found the better C value, we tested the same algorithm on
the news represented respectively by bag-of-words, bag-of-words + embeddings
news, bag-of-words + embeddings tweets, bag-of-words + embeddings news +
embeddings tweets. With this experimental setting, we aim to understand if the
inclusion of embeddings can support a better classi cation process. The
evaluation, in both the optimization experiments, has been conducted on the "dev"
dataset of the news extracted from Flipboard (Tab. 1). We used as evaluation
metrics the accuracy of the classi er and the macro Precision, Recall and
F1measure. The macro metrics are obtained just averaging the values of evaluation
obtained for each class. In particular, for the F1 measure, its macro version is
obtained calculating it on averaged precision and recall. On the contrary,
micro metrics are calculated summing all the true positives, true negatives, false
positives and false negatives obtained for each class and nally calculating a
sin6 https://lucene.apache.org/core/
gular metric value. The results show that a C value equal to 2, allows obtaining
better results considering accuracy, precision, recall and F1 measure. Moreover,
the best formalization of information is obtained using bag-of-words and both
news, tweets word2vec embeddings. The nal con guration used for the topic
detection module is then the one with a C value equal to 2 and all the three
group of features available.</p>
        <p>Internal evaluation of performance. The subset of news kept as "test"
dataset have been evaluated with this obtained con guration of the classi er
in order to be sure about its performance also on the news unrelated to the
optimization process. It is interesting to note that the results (Accuracy: 0.9195,
P: 0.9137, R: 0.8965, F1: 0.905) preserve the performance obtained in the
optimization tests. Moreover, the values of the accuracy obtained on that dataset
are statistically better for p &lt; 0:05, using a two-tailored Chi2 test, than the
obtainable predicting the topic label randomly (0,125) or using the most frequent
class in the dataset (Sport 0,286). The results allow us to con rm the validity of
the approach.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Emotion detection module</title>
      <p>
        The emotion detection module aims to detect the emotion expressed by each
piece of text according to what writer wants to communicate. As consequences
of the assumption of self-reliant and mono-thematic made in this work, we detect
the presence of only one main emotion associated with the sentence. The task
has been approached with the methodology of dynamic lexicon describe in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
In this work, we extended the already presented model, going to include a
preprocessing emoji/emoticons classi er and enriching the set of dynamic words
used for each emotional class with those available in a state-of-the-art NRC
lexicon [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. Moreover, we trained our word2vec probabilistic space also over the
generic Tweeter dataset, concatenating the two set of features in a way similar
to them used in the topic detection module (Sec. 3).
      </p>
      <p>Methodology. The approach used for the task is articulated in four steps:
classi cation of sentences which come from the training dataset with emotional
labels using emoji/emoticons; generation of the emotional lexicon from the
annotated sentences; creation of word embedding centroids with the most frequent
words for each class; use of a similarity function for detecting the most similar
centroid for the piece of text to annotate. The approach used for text labeling
is based on the idea that it is possible to automatically annotate user's post on
Social Media Sites (SMSs) using emoticons. Each smile has been associated with
a main emotional sense with a straightforward strategy. We identify the most
common emotions7 included in UNICODE standard version 9 and we
manually classify them (also considering their main writing variations). Moreover,</p>
      <sec id="sec-5-1">
        <title>7 https://it.wikipedia.org/wiki/Emoticon</title>
        <p>
          we extended this list with most of the new emoji codes 8 which are, as
previously, associable with a main emotional class. Posts which contains discordant
emoji have been excluded. Due to the page limits of the article, the full list
of emoji/emoticons used is not here presented but the list is available in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
The sentences annotated by the approach just described, are divided into six
independent lists, one for emotion. The sentences within each list are tokenized
using TweetNLP, and the frequency list of each token is calculated. The
frequencies are normalized over the maximum frequency detected in the list, and
the tokens are ranked according to the values obtained. Only the tokens whose
frequency is higher than 1% of the number of whole sentences are considered
relevant. Finally, words falling in more than one list are removed, to keep only
the distinctive words for each class. The weighted list of words is used as a
lexicon which fully represents each emotional class. The learning phase consists in
computing the word2vec centroid of each emotional class. The six lists of words
previously generated are the sources used as input lexicon. The lexicon is then
subdivided into six meta-documents, and each one is transformed in a word2vec
centroid by averaging the vectors associated with each word belonging to the
meta-document. Given a class (e.g., joy ), each word in this list is associated
with word an embedding vector and then averaged with others. For removing
the dependency of each word from the centroid of the whole distributional space,
we subtract it at every step of the sum. The average is weighed with the relative
frequency associated with each word [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ]. The annotation phase is based on the
Tanimoto Similarity between the numerical vector of the considered piece of text
and the numerical centroid of each class. The label of the corresponding highest
score will be provided as output.
        </p>
        <p>
          Dataset. The datasets used for the approach is myPersonality 9 [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]. The
myPersonality dataset contains information about 4 millions Facebook users and 22
millions posts over their timeline. The dataset annotated have been subdivided
into training and test. We kept 20.000 sentences for each class randomly chosen
as posts for creating the six emotional meta-documents. Moreover, 1.000 phrases
for each emotional class have been used for evaluating the internal validity of the
approach. We modeled the representation of SMSs posts using word embeddings
features vectors. In particular, we used the whole corpus of 2.4M annotated posts
in myPersonality for training, through CBOW and ten epochs of learning, 100
dimensionality vectors of words with a minimum number of occurrences in the
collection equal to 5. Moreover, as already done in Sec. 3 for the topic
detection module, we extended the data representation used in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], concatenating,
for each word, another word2vec vector of 50 features learned on the dataset of
1.3M generic tweets.
        </p>
        <p>Extension of centroids words with a standard lexicon. In the approach
used for this emotion detection module, we manipulated the list of words in each
8 https://unicode.org/emoji/charts/full-emoji-list.html
9 http://mypersonality.org/
meta-document. First of all, we limited the words obtained by the analysis of
annotated posts, to the 100 most frequent. This decision has been taken
considering that the huge number of words can create centroid vectors too much
similar each other, losing part of its semantic information. Moreover, we decided
to enrich each list with the 20 words extracted from a standard lexicon most
frequent in our training dataset. The lexicon adopted is NRC Word-Emotion
Association Lexicon. It is an extensive English dictionary in which each word is
linked to one or more emotions among the eight available (anger, fear,
anticipation, trust, surprise, sadness, joy, and disgust).</p>
        <p>Emoji-based classi er. This simple classi er uses the presence of smiles
inside the text as the main element to consider for assigning a primary emotion to
the phrase. A counter for the correspondent emotion is incremented every time
that an emoji/emoticon, previously manual classi ed in the six xed emotional
classes, is found in the text. This counting is used for de ning an order of the
most probable emotion associated with the phrase. If two or more emotions
obtain the same number of increments, then the component will be not able to
classify the text correctly, and the sentence will be processed by the approach
previously described. On the contrary, the emotional label provided as output
by the emotion detection module will be the class predicted by the Emoji-based
classi er.</p>
        <p>
          Internal evaluation of performance. Unlike what presented in [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ], in this
work the semantic representation of posts has been extended, the lexicon used
has been integrated, and the emoji classi er has been added as a pre-classi cation
module. These changes have been internally evaluated on the portion of
myPersonality dataset reserved for testing purposes. It has been observed a shallow
increment of performances for the new version of the approach called DYN-TH+
(DYN-TH Average F1: 0,3549; DYN-TH+ Average F1: 0,3611).
6
        </p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>Evaluation of the approach</title>
      <p>The complete pipeline of "Emotion-driven Opinion Mining" has been evaluated
through a dataset of 4.898 tweets collected using prede ned hash-tags. In
particular, messages which contain both hash-tags about emotions and has-tags
about the topic of interest have been crawled. For the emotional hash-tags we
used: #happy, #sad, #anger, #fear, #disgust, #surprise. For the topic related
hash-tags, we de ned for each one a list of words which refers to micro-topic
relevant for it. As an example, for the topic technology, we used the hashtags:
#tech, #technology, #phone, #sony, #iphone, #nokia, #samsung, #microsoft,
#linux, #mac, #ios, #windows, etc. The crawling task started on the 20th of
January 2018 and ended the 20th of February 2018.</p>
      <p>Observing the Tab. 2 it is immediately evident what is the main problem of
the dataset collected. The "joy" tweets are 71.74% of the whole dataset which
results very unbalanced. Moreover, messages associated with disgust and surprise
are very low and inevitably challenging to detect. For this reason, we decided
to do not consider them in the evaluation. Despite the highlighted issues, we
decided to use it for the evaluation due to the di culties to nd another dataset
already annotated with both topics and emotional labels. Besides, the dataset
has been collected directly from the web, and it re ects what is the real behavior
of the users on SMSs. They commonly tend to share more often positive things
than negative when communicating on that platforms. This characteristic has
been considered an added value more than an issue which on the contrary is
often present in arti cial or ad-hoc datasets.</p>
      <p>The results resumed in Tab. 3 con rm our hypothesis about the di culties
of the task in a real scenario. The topic detection module performed an accuracy
of 0,6772 that is about the 30% less than the results obtained in internal
evaluations, as the same of the other measures. Considering that the classi cation task
has to work with eight di erent classes and spontaneous messages, we can hold
to be true the result obtained. An issue observed during the annotation is the
di culty of the classi er to match domain relevant entities, as consequence of the
pre-processing step performed on the text. Entities such as "Barack Obama",
often encountered during the training phase, are never matched in tweets because
they are often recalled using hash-tags or "@ citations", which are
automatically transformed in a unique sequence of characters entirely di erent from the
real entity name. In a similar way, the emotion detection module obtained an
accuracy of 0,5587 and a macro F1 measure of 0,2650 which, also in this case,
is about the 30% less than the internal evaluation. In that case, we note that
the module does not work well on emotions with associated few messages which
result challenging to recall. We consequently encourage the further studies to use
larger datasets for increasing that statistic. The complete pipeline performed on
Twitter messages produces results which could be interpreted as lower than
expected, but they are obtained considering as "true positive" only the annotation
which correctly predicts both the labels. This strong assumption consequently
caused a signi cant reduction of the performance measured because the module
should be able to detect one pair ftopic,emotiong among the possible 48 (eight
aspects six emotions). The accuracy of 0,3498 is in line with the di culties
of the task and, undoubtedly better than a classic random strategy which can
obtain only a result of 0,0250 and the use of the most frequent pair (joy; music)
that can obtain an accuracy of 0,1672. The di erences in accuracy obtained are
statistically signi cant using a two-tailored Chi2 test for p &lt; 0:05. The results are
consequently very encouraging and can be considered as one of the rst baselines
for further studies about Emotional-driven Opinion mining approaches.
7</p>
    </sec>
    <sec id="sec-7">
      <title>Conclusion</title>
      <p>The proposed approach of Emotion-driven Opinion Mining has demonstrated to
be an e ective strategy for:
{ discovering the topic of discussion of a message from Social Media Sites
{ detecting the primary emotion related with the social textual content
Traditional opinion mining strategies are commonly applied in the domain of
reviews where xed sets of aspects and internal structures of the comments can
support a more accurate detection. Moreover, the user opinion is annotated
using a polarity level which does not provide a ne-grain overview of the emotional
state of the user. Producing more detailed emotional annotations is a challenging
task, but nowadays they are essential features for enriching the user pro le and
to adopt in personalized systems. In this work, we provide a complete pipeline
which, starting from the plain text, can accomplish this task. The proposed
module of topic detection is based on an SVM algorithm trained on a dataset of
more than 400k real news classi ed according to eight topics: technology, politics,
travel, style, sport, music, movies, art. They have been processed and
formalized through a conjunct vector of unigrams, bigrams, and word embeddings. The
emotions detection module is based on word embedding centroids of the most
signi cant words of a speci c emotional class dynamically detected by a corpus
of spontaneous messages: 2M of the Facebook post and 1.3M of tweets. The
result of the nal Emotion-driven Opinion mining has shown baseline results for
the challenging task on a dataset of 1k annotated tweets. To encourage further
studies in this area of Opinion Mining and to ensure reproducibility of our
experiments, we distributed all the datasets which have been collected and used in
this work. They are available at: http://bit.ly/EOM_dataset</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <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>Journal of machine Learning research 3(Jan)</source>
          ,
          <volume>993</volume>
          {
          <fpage>1022</fpage>
          (
          <year>2003</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <issue>2</issue>
          .
          <string-name>
            <surname>Chang</surname>
            ,
            <given-names>C.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lin</surname>
            ,
            <given-names>C.J.:</given-names>
          </string-name>
          <article-title>LIBSVM: A library for support vector machines</article-title>
          .
          <source>ACM Transactions on Intelligent Systems and Technology</source>
          <volume>2</volume>
          ,
          <issue>27</issue>
          :1{
          <fpage>27</fpage>
          :
          <fpage>27</fpage>
          (
          <year>2011</year>
          ), software available at http://www.csie.ntu.edu.tw/~cjlin/libsvm
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Crain</surname>
            ,
            <given-names>S.P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>S.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zha</surname>
          </string-name>
          , H.:
          <article-title>Dimensionality reduction and topic modeling: From latent semantic indexing to latent dirichlet allocation and beyond</article-title>
          .
          <source>In: Mining text data</source>
          , pp.
          <volume>129</volume>
          {
          <fpage>161</fpage>
          . Springer (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ekman</surname>
            ,
            <given-names>P.:</given-names>
          </string-name>
          <article-title>An argument for basic emotions</article-title>
          .
          <source>Cognition &amp; emotion 6(3-4)</source>
          ,
          <volume>169</volume>
          {
          <fpage>200</fpage>
          (
          <year>1992</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Probabilistic latent semantic analysis</article-title>
          .
          <source>In: Proceedings of the Fifteenth conference on Uncertainty in arti cial intelligence</source>
          . pp.
          <volume>289</volume>
          {
          <fpage>296</fpage>
          . Morgan Kaufmann Publishers Inc. (
          <year>1999</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Mining and summarizing customer reviews</article-title>
          .
          <source>In: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining</source>
          . pp.
          <volume>168</volume>
          {
          <fpage>177</fpage>
          .
          <string-name>
            <surname>ACM</surname>
          </string-name>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kosinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Matz</surname>
            ,
            <given-names>S.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gosling</surname>
            ,
            <given-names>S.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popov</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stillwell</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Facebook as a research tool for the social sciences: Opportunities, challenges, ethical considerations, and practical guidelines</article-title>
          .
          <source>American Psychologist</source>
          <volume>70</volume>
          (
          <issue>6</issue>
          ),
          <volume>543</volume>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Joty</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meng</surname>
          </string-name>
          , H.:
          <article-title>Fine-grained opinion mining with recurrent neural networks and word embeddings</article-title>
          .
          <source>In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing</source>
          . pp.
          <volume>1433</volume>
          {
          <issue>1443</issue>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corrado</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Dean</surname>
            ,
            <given-names>J.:</given-names>
          </string-name>
          <article-title>E cient estimation of word representations in vector space</article-title>
          .
          <source>arXiv preprint arXiv:1301.3781</source>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yih</surname>
          </string-name>
          , W.t.,
          <string-name>
            <surname>Zweig</surname>
          </string-name>
          , G.:
          <article-title>Linguistic regularities in continuous space word representations</article-title>
          .
          <source>In: Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies</source>
          . pp.
          <volume>746</volume>
          {
          <issue>751</issue>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Mohammad</surname>
            ,
            <given-names>S.M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Turney</surname>
          </string-name>
          , P.D.:
          <article-title>Crowdsourcing a word-emotion association lexicon 29(3</article-title>
          ),
          <volume>436</volume>
          {
          <fpage>465</fpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Pang</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lee</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Vaithyanathan</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Thumbs up?: sentiment classi cation using machine learning techniques</article-title>
          .
          <source>In: Proceedings of the ACL-02 conference on Empirical methods in natural language processing-</source>
          Volume
          <volume>10</volume>
          . pp.
          <volume>79</volume>
          {
          <fpage>86</fpage>
          .
          <article-title>Association for Computational Linguistics (</article-title>
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Polignano</surname>
          </string-name>
          , M.,
          <string-name>
            <surname>de Gemmis</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Narducci</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Semeraro</surname>
          </string-name>
          , G.:
          <article-title>Do you feel blue? detection of negative feeling from social media</article-title>
          .
          <source>In: Conference of the Italian Association for Arti cial Intelligence</source>
          . pp.
          <volume>321</volume>
          {
          <fpage>333</fpage>
          . Springer (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Poria</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cambria</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gelbukh</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Aspect extraction for opinion mining with a deep convolutional neural network</article-title>
          .
          <source>Knowledge-Based Systems 108</source>
          ,
          <fpage>42</fpage>
          {
          <fpage>49</fpage>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wei</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>N.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhou</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qin</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          :
          <article-title>Learning sentiment-speci c word embedding for twitter sentiment classi cation</article-title>
          . In:
          <article-title>Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)</article-title>
          .
          <source>vol. 1</source>
          , pp.
          <volume>1555</volume>
          {
          <issue>1565</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Ma, J.,
          <string-name>
            <surname>Xu</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gu</surname>
          </string-name>
          , J.:
          <article-title>Sentiment classi cation: The contribution of ensemble learning</article-title>
          .
          <source>Decision support systems 57</source>
          , 77{
          <fpage>93</fpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>