<!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>UNED-READERS: Filtering Relevant Tweets using Probabilistic Signature Models</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>NLP Group</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan del Rosal</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Madrid</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Spain</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>henry.anaya</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>anselmo</string-name>
        </contrib>
        <contrib contrib-type="author">
          <string-name>bcabaleiro}@lsi.uned.es http://nlp.uned.es/</string-name>
        </contrib>
      </contrib-group>
      <pub-date>
        <year>2013</year>
      </pub-date>
      <abstract>
        <p>This paper describes the (usupervised) knowledge-based approach to lter relevant tweets for a given entity that is followed by the UNED-READERS system at RepLab 2013. The approach relies on a new way of contextualizing entity names from relative large and broad collections of texts using probabilistic signature models (i.e., discrete probability distributions of words lexically related to the knowledge or topic underlying set of entities in background text collections). The contextualization is intended to recover relevant information about the entity (speci cally, lexically related words) from background knowledge. Results obtained in the ltering task are presented.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>In the last few years, Twitter has become an increasingly popular platform for
users to communicate with each other by sharing their latest updates in the form
of short messages called tweets. 1 Because tweets are compact and fast, Twitter
has become widely used to spread and share many kinds of information, such as
breaking news, personal updates, spontaneous ideas, or opinions about brands,
services, celebrities, etc. [6].</p>
      <p>This phenomenon has attracted the attention of information analysts, who
see in tweet datasets a valuable input source to carry out a plethora of studies.
The large and ever increasing volume of available tweets obliges to make use of
automatic methods and tools to interpret and analyze them. Nevertheless, tweets
are particularly challenging for being interpreted and analized automatically,
since they are shorts piece of texts (i.e., 140 characters) usually posted using a
nonstandard language with similarities to SMS style [3, 4].</p>
      <p>Currently, a major problem concerning the analysis of tweets is that of
deciding whether a given tweet containing the name of an entity is actually refering
or not to the entity. This is because entity names are often ambiguous. For
instance, a tweet containing the word \Ford" might refer to the motor company,
but also might be about the Ford Models (the modeling agency), Tom Ford (the
lm director), etc. [5].
1 http://www.twitter.com</p>
      <p>In this paper, we address the above problem by proposing a methodology
to contextualize entity names with probabilistic models from relative large and
broad text collections, so that a model of these entities can be applied to decide
whether a tweet contains or not a reference to a given entity. By
\contextualize" we refer to the process of recovering relevant information about the entity
(speci cally, lexically related words) from background knowledge.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Contextualizing Entities with Probabilistic Signature</title>
    </sec>
    <sec id="sec-3">
      <title>Models</title>
      <p>Given a collection of text documents C = fd1; : : : ; dN g with vocabulary V =
fw1; : : : ; wM g, we propose to contextualize a set of entity names q = fwi1 ; : : : ; win g
in the same domain (e.g., automotive, education, music/artists) according to C
(8j 2 f1; : : : ; ng, we assume that wij 2 V) by means of a probabilistic signature
model; that is, a discrete probability distribution of words lexically related to
the knowledge or topic underlying the set of entities in the collection.</p>
      <p>
        To de ne such a probabilistic signature model for the text element q
(hereafter referred to as the signature model for q), we rely on a posterior probability
distribution of words fp(wjq)gw2V that is de ned from the following equation:
p(wjq) = p(qjw) p(w)
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        )
where p(w) represents a prior for word w in C, and p(qjw) is a conditional
probability estimated from a statistical (stochastic) mapping between words =
fp(wijwj )g1 i M;1 j M (8j 2 f1; : : : ; M g, PiM=1 p(wijwj ) = 1) that is based on
word co-occurrences from local contexts in C, as in [2].
      </p>
      <p>The aim is to base the signature model on the likelihood with which words
in the vocabulary V are mapped to (or entail) words in q.</p>
      <p>Nevertheless, as the posterior fp(wjq)gw2V can actually assign high
probability values to either meaningless words (such as prepositions, conjunctions,
common verbs, etc.) or words with a relative high prior or frequency in C (for
example, ambiguous words with di erent interpretations in the collection), we
propose to learn the signature model that contextualizes q from a re ned version
of the posterior distribution of words fp(wjq)gw2V , namely, fpq(w)gw2V , that
is obtained by minimizing the following cross entropy value:</p>
      <p>Hq =</p>
      <p>X p(wjq) log (1
w2V
) pq(w) +
p(w)
where is a mixture weight that accounts for the proportion of \background
noise" in fp(wjq)gw2V and fp(w)gw2V is a background probability distribution
of words (e.g., the distribution of words in C).</p>
      <p>
        Let z represents the topic underlying q in the context of C. Then, we de ne
the signature model of q as the discrete distribution:
sq(w) / pq(w)
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        )
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        )
where w ranges over the set of words Vq (Vq
if both:
V) such that a word w0 is in Vq
(i) w0 is among the set of words with the higher probablity values under pq, and
(ii) the probability value of including w0 in z (i.e., p(zjw0) = (
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) pq(w0)=((
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) pq(w0)+ p(w0))) is greater than a threshold (for example, the probability
of including w0 in complement of z that can be de ned as p(zjw0) = 1
p(zjw0)).
      </p>
      <p>To estimate the re ned that minimize Hs;q, we rely on an Expectation
Maximization procedure that starting from initial values for fpq(w)gw2V , namely
fp(q0)(w)gw, it iteratively approximates the values of fps(w)gw for each w 2 V
until convergence by means of the following updates in the kth iteration:
where Zw is:
p(qk)(w) = P
p(wjq)Zw
w0 p(w0jq)Zw0
Zw =
(1</p>
      <p>
        ) p(qk 1)(w)
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) p(qk 1)(w) + p(w)
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        )
(
        <xref ref-type="bibr" rid="ref5">5</xref>
        )
3
      </p>
    </sec>
    <sec id="sec-4">
      <title>RepLab 2013 Results</title>
      <p>From the above formulation of signature models, we devise an (unsupervised)
knowledge-based system for ltering tweets as it was asked by the Replab 2013
ltering task [1].</p>
      <p>The RepLab dataset comprises about 105; 000 tweets in the test set, each
one containing the canonical name of at least one entity in a selected set of 61
entities from four domains: automotive, banking, universities and music/artists.
The source languages of the tweets in this dataset include English and Spanish.</p>
      <p>The idea underlying our system is to consider {as positive evidence{ the
overlapping between the vocabularies of the tweets and the vocabulary of the
topic signature models obtained for the four di erent sets of entity names that
comprise each domain of entities in Replab 2013 (i.e., automotive, banking,
universities and music/artists).</p>
      <p>The signature models were obtained by contextualizing each set of entity
names according to webtext (a collection of about 1; 700; 000 text documents in
English).</p>
      <p>
        We have submitted the following four runs:
(
        <xref ref-type="bibr" rid="ref1">1</xref>
        ) The system considers only tweets in English, and regards that the input
tweet is related to the given entity if it contains at least 2 words in the
signature obtained for the corresponding set of domain entities.
(
        <xref ref-type="bibr" rid="ref2">2</xref>
        ) The system considers only tweets in English, and regards that the input
tweet is related to the given entity if it contains at least one word in
the signature obtained for the corresponding set of domain entities after
removing from the tweet the name of the entity.
(
        <xref ref-type="bibr" rid="ref3">3</xref>
        ) The system considers tweets in any language and regards that the input
tweet is related to the given entity if it contains at least 2 words in the
signature obtained for the corresponding set of domain entities.
(
        <xref ref-type="bibr" rid="ref4">4</xref>
        ) The system considers only tweets in any language and regards that the
input tweet is related to the given entity if it contains at least one word
in the signature obtained for the corresponding set of domain entities after
removing from the tweet the name of the entity.
      </p>
      <p>Since signature models wer obtained from a collection of texts in English,
the aim of runs 3 and 4 is to measure the quality of signatures build from an
English corpus to lter tweets in Spanish.</p>
      <p>We present the obtained results in terms of the following measures: Precision,
Recall, F1(Precision,Recall), Reliability, Sensitivity and F1(Reliability,Sensitivity).
The last three of these measures were considered as the o cial mesaures of
RepLab 2013 [1].</p>
      <p>Tables 1 and 2 sumarize the results obtained by our four runs. As it can
be appreciated, our run relative good values of Precision, Recall and F1 if we
take into account that our signature models are base only in English texts. The
fact that recall values are lower than those of precision can be explained since
the proposed contextualization is base on a completely di erent collection of
documents and in this way the learned models focus on modeling domain aspects
rather than typical aspects observed in tweets such as irony and sarcasm-based
aspects related to entities.</p>
      <p>It is worth mentioning that our runs are completely unsupervised, and do
not use the training data provided to this task at all.</p>
      <p>Results obtained by runs 1 and 2 can not be compared to those ones obtained
by runs 3 and 4 because they are applied to di erent input data.</p>
      <p>Interestingly, when regarding the o cial RepLab 2013 measure of Reliability,
which is a precision-based measure, it can be seen that the results obtained by
runs 3 and 4 are smaller than those obtained by runs 1 and 2 even when the
values of Precision of runs 1 to 4 are similar. Besides, these values of Reliability
are smaller than those of Sensitivity, which is a recall-based measure, while Recall
values are always smaller than Precision values.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusions</title>
      <p>In this paper, we have described the UNED-READERS system that participated
in the ltering task at RepLab 2013. This knowledge-based system relies on a
new way of contextualizing entity names from relative large and broad collections
of texts using probabilistic signature models. The learned contexts can be shown
useful to model domain vocabulary if we consider the obtained values of Precision
and Recall. The submitted system is completely unsupervised. It does not use
the training set provided by the competition.</p>
      <p>Acknowledgments. This work has been partially supported by the Spanish
Ministry of Science and Innovation, through the project Holopedia
(TIN201021128-C02), and by the Spanish Government (MINECO) in the framework of
CHIST-ERA program (READERS project).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Enrique</given-names>
            <surname>Amigo</surname>
          </string-name>
          , Jorge Carrillo de Albornoz, Irina Chugur, Adolfo Corujo, Julio Gonzalo, Tamara Mart n, Edgar Meij, Maarten de Rijke, and
          <string-name>
            <given-names>Damiano</given-names>
            <surname>Spina</surname>
          </string-name>
          . Overview of replab 2013:
          <article-title>Evaluating online reputation monitoring systems</article-title>
          .
          <source>In Fourth International Conference of the CLEF initiative, CLEF</source>
          <year>2013</year>
          ,
          <article-title>Valencia, Spain</article-title>
          . Proceedings, Springer LNCS,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>Lisette</given-names>
            <surname>Garc</surname>
          </string-name>
          a-Moya,
          <string-name>
            <given-names>Henry</given-names>
            <surname>Anaya-Sanchez</surname>
          </string-name>
          , and
          <string-name>
            <surname>Rafael</surname>
          </string-name>
          Berlanga-Llavori.
          <article-title>A language model approach for retrieving product features and opinions from customer reviews</article-title>
          .
          <source>IEEE Intelligent Systems</source>
          ,
          <volume>99</volume>
          (PrePrints):
          <fpage>1</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3. Max Kaufmann and
          <string-name>
            <given-names>Jugal</given-names>
            <surname>Kalita</surname>
          </string-name>
          .
          <article-title>Syntactic normalization of twitter messages</article-title>
          .
          <source>In International Conference on Natural Language Processing</source>
          , Kharagpur, India,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <given-names>Gustavo</given-names>
            <surname>Laboreiro</surname>
          </string-name>
          , Lu s Sarmento, Jorge Teixeira, and
          <string-name>
            <given-names>Eugenio</given-names>
            <surname>Oliveira</surname>
          </string-name>
          .
          <article-title>Tokenizing micro-blogging messages using a text classi cation approach</article-title>
          .
          <source>In Proceedings of the fourth workshop on Analytics for noisy unstructured text data</source>
          , pages
          <volume>81</volume>
          {
          <fpage>88</fpage>
          . ACM,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Damiano</given-names>
            <surname>Spina</surname>
          </string-name>
          , Julio Gonzalo, and
          <string-name>
            <given-names>Enrique</given-names>
            <surname>Amigo</surname>
          </string-name>
          .
          <article-title>Discovering lter keywords for company name disambiguation in twitter</article-title>
          .
          <source>Expert Systems with Applications</source>
          ,
          <volume>40</volume>
          :
          <fpage>4986</fpage>
          {
          <fpage>5003</fpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>Wayne</given-names>
            <surname>Xin</surname>
          </string-name>
          <string-name>
            <surname>Zhao</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Jing</given-names>
            <surname>Jiang</surname>
          </string-name>
          , Jianshu Weng, Jing He,
          <string-name>
            <surname>Ee-Peng Lim</surname>
            , Hongfei Yan, and
            <given-names>Xiaoming</given-names>
          </string-name>
          <string-name>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Comparing twitter and traditional media using topic models</article-title>
          .
          <source>In Advances in Information Retrieval</source>
          , pages
          <volume>338</volume>
          {
          <fpage>349</fpage>
          . Springer,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>