<!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>Modelling Techniques for Twitter Contents: A step beyond classification based approaches.</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Angel Castellanos</string-name>
          <email>acastellanos@lsi.uned.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Juan Cigarrán</string-name>
          <email>juanci@lsi.uned.es</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Ana García-Serrano</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Natural Language Processing and Information Retrieval Group, UNED Juan del Rosal</institution>
          ,
          <addr-line>16 (Ciudad Universitaria), 28040 Madrid</addr-line>
          ,
          <country country="ES">Spain</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In this paper we present our first participation at RepLab Campaign. Our work is focused in two contributions. The first one is the use of an IR method to address Polarity and Filtering tasks. These two tasks can be seen as the same problem: to find the most relevant class to annotate a given tweet. For that, we applied a classical IR approach, using the tweet content as query against an index with the models of the classes used to annotate tweets. To model these classes we propose the use of the Kullback Leibler Divergence (KLD), in order to extract their most representative terminology. Different data and ways to model these data (through KLD) are also proposed. The second contribution is related to the Topic Detection task. Instead a clustering based technique; we propose the application of Formal Concept Analysis (FCA) to represent the contents in a lattice structure. To extract topics from the lattice, we applied a FCA concept: stability. According to the results, our IR based approach has been proven as very satisfactory for the Polarity task, while for the Filtering task, it seems to be less suitable. On the other hand FCA modelling has been demonstrated as a promising methodology for Topic Detection, achieving high successful results.</p>
      </abstract>
      <kwd-group>
        <kwd>Formal Concept Analysis</kwd>
        <kwd>Stability</kwd>
        <kwd>Kullback Leibler Divergence</kwd>
        <kwd>Content Modelling</kwd>
        <kwd>ORM</kwd>
        <kwd>POS Tagging</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        In this paper we summarize our participation in the 2013 edition of the RepLab
Campaign [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. RepLab Campaign is focused on the Online Reputation Management
(ORM) task; that is, the reputation monitoring of entities and persons on the Web, and
more concretely in Twitter. Our participation focuses on three of the RepLab Tasks:
in the filtering and polarity tasks and, by other hand, in the topic detection task.
      </p>
      <p>The first two tasks (filtering and polarity) are usually addressed through
classification approaches: a data set is used to train classification systems and learns a set of
classes (related/unrelated, positive/neutral/negative) allowing the classification of new
contents. More sophisticated approaches, based on probabilistic techniques, have been
also recently proposed to address filtering and polarity tasks; one of them, maybe the
most widely used, is Topic Modelling.</p>
      <p>
        Both tasks (filtering and polarity) can be seen technically as the same task: given a
tweet to annotate, find the most similar class. For that, instead of the common state of
the art approaches, we propose the application of an IR based annotation that, given a
tweet to annotate, uses its content as query against an index containing the content
models of the classes to annotate the tweet. To generate these content models, we
apply a divergence based technique (Kullback Leibler Divergence) to find the most
representative terminology of each class. We have previously applied this technique
for content modelling, outperforming other content modelling techniques [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], and also
for content modelling for polarity and sentiment detection [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ].
      </p>
      <p>The other task in which we have participated this year is the topic detection task.
As in the previous tasks, classification approaches has been commonly used to
address the detection of topics. However, this approach poses a problem: often new
topics unseen in the training data appear along the time, making useless to detect them
the learnt classes. To solve that, unsupervised techniques based on clustering have
been proposed. But, even these techniques have many problems with the issue of
topics diversity.</p>
      <p>Given this problems, we propose a Formal Concept Analysis (FCA) based
approach. FCA allows the modelling of the contents (tweets) according to their
attributes (terminology) in a lattice structure. FCA also allows the adaptation for detecting
new topics while take advantage of knowledge provided by the training data. Once
the content was modelled through FCA, clusters/topics should be selected; however,
the number of concepts (possible topics) generated by FCA is potentially quite high.
In order to select proper cluster/topics, we applied the concept of stability, coming
from FCA field.</p>
      <p>The rest of the paper is organized as follows: In section 2 we present the IR based
approach applied for the Polarity and Filtering tasks, in section 3 we expose the novel
application of FCA for the Topic Detection task, in section 4 we present the results of
each task and, finally, in section 5 we present our conclusions and the feasible future
work.
2</p>
    </sec>
    <sec id="sec-2">
      <title>IR-based approach for Polarity and Filtering Tasks</title>
      <p>
        As we said before, filtering and polarity tasks can be as a classification problem. In
filtering task, tweets have to be classified in RELATED and UNRELATED, while in
polarity task they have to be classified in POSITIVE, NEGATIVE and NEUTRAL.
So, we proposed the same approach for both tasks. Instead of common approaches,
based on classification, we propose an IR-based approach. If we considered the
contents of the tweets to be classified and the contents of the classes (gathered from the
tweets in the training set annotated with them), these tasks can be seen as an IR task,
using the tweet content as query against an index containing the class contents. Then,
the classification will be dependent on the results of these queries. The work done for
both tasks includes:
 Annotation. A well-known problem in the use of tweets is the scarcity of
information. To limit the impact of this problem, tweet contents have been processed in
order to identify some features (hashtags, named entities, adjectives), which have
been added to the information used to model the class.
 Modelling. To represent each of the classes with their representative terminology,
the contents of the tweets annotated with them in the training set have been
modelled. The modelling technique is based on the comparison of class contents with
the content of the rest of the class/es, by applying the Kullback-Leibler Divergence
as weighting function [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The application of a divergence-based technique intends
to identify the terminology that better differentiate one class from the rest. The
different models generated for each class (see sections below) have been indexed
taking into account the relevance of each term in the model, according KLD
formulation.
 IR-based Classification. To classify tweets, their contents have been used as
query against the indexed models. Each tweet will be classified into the class with the
highest relevance according the results returned by the query.
      </p>
      <p>Specific details of these steps for each task, and the executed runs for each of them
are presented in the sections below.
2.1</p>
      <sec id="sec-2-1">
        <title>Filtering</title>
        <p>This task is focused on classify a set of tweets as related/unrelated to an entity. Our
approach is based on modelling the related and unrelated content to identify the more
representative terminology for every class in the collection. For that, we have
experimented with different data sources: a) Wikipedia entity pages; b) Content of the set of
tweets related to the entity and c) Content of the external webs which appear in the
related tweets. Furthermore, we annotated Twitter data with some features, helpful to
represent the entities: a) Named Entities (this annotation has been carried out through
Stilus Core1 tool) and b) Hashtags, given that they are usually used to identify a
specific topic in Twitter.</p>
        <p>Our modelling is based on the comparison between terms of a specific content with
terms present in the rest of the contents of the collection. In this context, it results in
comparing the related (unrelated) terms of an entity with the related (unrelated) terms
of the rest of the entities. Modelling the entities in this way, we will be able to say that
a tweet is related to an entity if, using the tweet content as query, the IR system
returns the entity model. It could be also interesting to identify the more representative
terms of the related contents of an entity according to their unrelated contents. So, for
each entity we have also modelled their related and unrelated content following this
approach, denoted from here as Related vs. Unrelated (RvsU) modelling.</p>
        <p>As our modelling is based on compare entities, since there are 4 domains in the
collection (university, automotive, music and banking) some domain-specific words
could be identified as entity-specific words (e.g. car and wheel can be set as
representative of the automotive entities). To cope with this, we proposed a
domain</p>
        <sec id="sec-2-1-1">
          <title>1 http://api.daedalus.es/stiluscore-info</title>
          <p>specific modelling (in contrast with the “generic modelling”): each entity is modelled
by comparing it only with the entities of its domain.</p>
          <p>Besides of modelling experimentation, we have experimented with different
IRbased methods. Firstly, given some tweet contents, we query against an index
containing the related models of each entity: is the tweet related to a given entity?
Nevertheless, looking at detail the collection there are much more tweets related than unrelated
(about the 75% of the tweets). Taking that into account we propose an inverse
approach by querying against the unrelated models: is not this tweet related with the
entity? The idea is to consider all the tweets as related, except those for which we
have solid evidences to the contrary.</p>
          <p>Even so, some tweets are undoubtedly related with the entity, thus there is no need
to check if the tweet is not related. This situation is addressed by querying against the
Wikipedia models: since Wikipedia contents are very accurate, if a tweet is related to
these contents, it will be related to the entity with a high probability.</p>
          <p>Taking into account all of these considerations we have conducted the following
experiments, summarized in Table 1:
Run
filtering_1
filtering_2
filtering_3
filtering_4
filtering_5
filtering_6
filtering_7
filtering_8
filtering_9
filtering_10
2.2</p>
        </sec>
      </sec>
      <sec id="sec-2-2">
        <title>Polarity</title>
        <p>This task is focused on identify the polarity of a tweet for the reputation of an entity.
We have followed the same approach as in the filtering task, modelling polarity
values (POSITIVE, NEGATIVE and NEUTRAL) of each entity with its contents related,
in the training set. In the same way that in the filtering task, we have experimented
with different types of information, modelling techniques and classification
approaches. To model each polarity we have used one single source: the content of the related
tweets. From this source we have gathered: a) Tweet Contents and b) Adjectives
identified in these tweet contents, using Stilus Core2. We have also applied generic and
specific modelling, as in the filtering task, and what we have called most similar
modelling. With this technique, given a tweet to be annotated, it searches for the most
similar tweet in the training set and it uses its polarity as annotation. If there is not</p>
        <sec id="sec-2-2-1">
          <title>2 http://api.daedalus.es/stiluscore-info</title>
          <p>similar tweet, the first approach is applied. The intuition is that if two tweets are
similar, their polarity has to be the same. With these considerations, we have developed
the following runs:
Topic Detection task is focused on, given a stream of tweets related to an entity;
identify topics in this stream. Usually this kind of task is addressed with a
classificationbased approach, but this approach is not valid for this task, because topics in the new
tweets may be not related to the training topics. All we know is: in the past these
topics appeared in the tweets; now there is a set of new tweets, try to take advantage of
the prior knowledge to detect topics in the new tweets.</p>
          <p>
            The best way to address this task is a clustering-based approach. However, a
clustering approach also has some drawback: How many clusters are? How can the
systems take into account the prior knowledge? Does the running of the systems has to
be fixed by the data in the training set or they have to show a certain degree of
adaptability? These entire considerations make the Monitoring task an specially
challenging task. To solve the clustering drawbacks we proposed a novel approach, especially
suitable for the context of this task, based on Formal Concept Analysis (FCA). FCA
can be seen as a powerful tool to automatically structure and classify all the resources
retrieved and enriched from the Internet. This theory fits on a lattice-based clustering
approach improving information access and exploratory tasks on pure Information
Retrieval (IR) scenarios [
            <xref ref-type="bibr" rid="ref5 ref6 ref7">5-7</xref>
            ].
FCA is a mathematical theory [
            <xref ref-type="bibr" rid="ref12">12</xref>
            ] of concept formation derived from lattice and
ordered set theories that provide a theoretical model to organize formal contexts:
collections of objects related with sets of attributes. The main construct of the theory is
the formal concept. A formal concept is a pair (O, A) with O is a set of objects (the
extend of the formal concept), and A a set of attributes (the intend of the formal
concept). In addition, O and A are connected as follows:
 If an object o in O is tagged with an attribute a, then a must is included in A (i.e,
the intend of the formal concept includes all the attributes shared by the objects in
the extend).
 Conversely, if an object o is tagged with all the attributes in A, then o must be
included in A (i.e., the extend of the formal concept includes all those objects filtered
out by the intend).
          </p>
          <p>Formal concepts can be ordered by their extends. More formally, (O,A)  (O’,A’)
 O  O’; in this case (O’,A’) is called a super-concept of (O,A) and, conversely,
(O,A) a sub-concept of (O’,A’). The order that results can be proved to be a lattice,
which is called the concept lattice associated to the formal context.</p>
          <p>In a concept lattice, two interesting kinds of formal concepts are object concepts
and attribute concepts. Indeed:
 The object concept associated with an object o is the most specific concept
including o in its extend. In order to construct it, it is possible to include in its intend all
the attributes of o, and to include in its extend, in addition to o, all those objects
tagged exactly with the same attributes than o.
 Conversely, the attribute concept associated with the attribute a is the most generic
concept including a in its intend. It can be constructed in a dual way to an object
concept: (i) add all the objects tagged by a to the extend, and (ii) in addition to a,
add all the attributes shared by those objects to the intend.
3.2</p>
        </sec>
      </sec>
      <sec id="sec-2-3">
        <title>Modelling</title>
        <p>As FCA allows modelling a set of objects according to their attributes, in order to
adapt this context to the Monitoring task, the tweets are identified as the objects,
terminology of the tweets is identified as the attributes and, consequently, formal
concepts can be identified as topics, containing a set of tweets according to a set of
common terminology.</p>
        <p>Since the modelling performance is highly dependent on the terminology, before
applying this modelling we have pre-processed the contents in the next way: we have
removed generic and domain stop-words; we have stemmed the terms; we have
disambiguated the named entities, unifying them in common labels (e.g. bmw_m3 and
m3 will be considered the same entity); and, finally, we have expand the terminology
with the identified hashtags (i.e. if there is a hashtag #m3, all the tweets with the term
m3 will be expand with the hashtag #m3). All of this pre-processing pursues expand
the content of the tweets in order to facilitate the finding of relationships between
contents.</p>
        <p>
          Although in the theoretical model all the tweet terms can be considered as
attributes, in the real scenario this would generate an unmanageable lattice with a huge
number of concepts. For that we have applied an algorithm for filtering attributes
according to their representativeness [
          <xref ref-type="bibr" rid="ref7">7</xref>
          ]
3.3
        </p>
      </sec>
      <sec id="sec-2-4">
        <title>Topic Annotation</title>
        <p>In spite of the attribute reduction, the number of generated formal concepts is very
high to consider every concept as a cluster. So, it remains the decision of what
concepts are suitable to represent a topic. In this sense, a desirable characteristic of the
concepts is the cohesion between their objects. Otherwise it would indicate that this
concept it isn’t really a cluster but an aggrupation of different topics/clusters.</p>
        <p>
          To reflect how much each concept in the lattice fits with this requirement (object
cohesion), we propose the use of the stability concept. Stability was first introduced in
[
          <xref ref-type="bibr" rid="ref9">9</xref>
          ] in relation to hypotheses generated from positive and negative examples, and it
was extended to formal concepts in [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]. In [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ] they present an algorithm to calculate
it based on an original concept lattice. Briefly explained, the stability of a concept (i.e.
also known intentional stability) indicates how much the concept intent depends on
particular objects of the extent. In other words, the stability of a concept is the
probability of preserving its intent after leaving out an arbitrary number of objects. Thus, a
high stability value indicates that the concept represents a cohesive set of tweets or,
what is the same, it can represent a proper cluster.
        </p>
        <p>We have experimented with different stability values as threshold to select the
clusters (all the concepts with a stability value higher than the threshold will be taken
as cluster), from 40% to 90%. We have also experimented with two values for
attribute selection in the reduction algorithm presented in the previous section. More
concretely, the experiments developed are:</p>
        <p>Run
topic_detection_1
topic_detection_2
topic_detection_3
topic_detection_4
topic_detection_5
topic_detection_6
topic_detection_7
topic_detection_8
topic_detection_9
topic_detection_10
4
4.1</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Results</title>
      <sec id="sec-3-1">
        <title>Filtering</title>
        <p>
          In the Table 4 it is shown the results achieved by our experiments in this task. Results
are expressed in terms of Reliability Sensitivity and F measure [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. For this task we
proposed the experimentation with 3 different data sources: Wikipedia (filtering_1
and filtering_2), contents of the external webs in the tweets (filtering_5), and Twitter;
in this sense, besides of the tweets contents (filtering_3 and filtering_4), we also used
named entities (filtering_7) and Hashtags (filtering_6) in the tweets.
        </p>
        <p>As general comments we can point out the low performance of the proposed
approaches, if we compare them with the best approach. Looking in detail the results;
regarding to the data type, the best results is obtained with the external webs contents,
followed by Wikipedia and finally Twitter contents; within Twitter contents, the
named entities achieves the highest performance, followed by twitter raw contents
and finally Hashtags. One aspect to remark here is that the performance obtained with
the external webs content is driven by the improvement in the sensitivity value; that
is, the use of these contents increases the coverage of the annotation process.</p>
        <p>Description</p>
        <p>On the other hand, the use of specific modelling doesn’t improve the performance
of the generic modelling, either using Wikipedia data (filtering_1 and filtering_3), or
Twitter data (filtering_2 and filtering_4). This confirms the results that we obtained
when we experimented with these approaches in the training step.</p>
        <p>Taking into consideration the use of unrelated models, this modelling obtains a
significant improvement of the results offered by the run used as baseline of these
approaches (filtering_4). This improvement is mainly due to the improvement of the
Reliability value, that is, they are more precise. Among these results, Related vs.
Unrelated based modelling (filtering_9) is the best performing method. Only the
approach using the Wikipedia Filter doesn’t get the baseline result despite of the
improvement of the Reliability value, due to the low Sensitivity value.
4.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Polarity</title>
        <p>
          In the Table 5 it is shown the results of the Polarity runs, expressed in terms of
Reliability, Sensitivity and F-Measure [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. In this task we experiment with 2 different
ideas. The first one was based on the data used to model: tweet contents (polarity_3 y
polarity_4) and adjectives in the tweets (polarity_5 and polarity_6). In this sense it is
remarkable the very low performance obtained by the adjective based approach;
looking in more detail these results, the low performance can be explained with the
extremely low sensitivity value. That is, the adjective based approaches only annotate a
small number of tweets; however almost without error, as it can be seen in the
Reliability value.
        </p>
        <p>The other approach that was proposed in this task is the use of the most similar
modelling. The results of this approach outperform the baseline modelling results
according to all of the measures. Finally, like in the filtering task, the application of
specific modelling doesn’t offer any improvement. In fact, the results for generic and
specific approaches can be considered as equal.
4.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Topic Detection</title>
        <p>
          Table 6 shows the results obtained for the experiments sent to the topic detection task.
Results are expressed in terms of Reliability Sensitivity and F measure [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Some
interesting general considerations are that in general their reliability values are very
high, some of them in the Pareto Frontier of the Reliability-Sensitivity Curve
(topic_detection_6 and topic_detection_10).
        </p>
        <p>Going into detail, these results can be divided according to the threshold applied to
the attribute reduction algorithm (1 and 5 %). The best performance according to F
measure is obtained by the first set of runs which use a threshold equal to 1%
(topic_detection_1 – topic_detection_5). If we focused on the stability value applied
(from 90% to 40%), as the stability value decreases also F-Measure decreases, but the
Reliability value increases. This latter behaviour relies in the fact that, the lower is the
stability value, the lower the number of generated clusters is; so, it makes sense this
precision improvement. If we look at the performance of runs which use a threshold
equal to 5%, the results barely differs between them. Given that the threshold for the
attribute selection algorithm is higher, less attributes for the application of FCA
algorithm are taken into account; leading on a general reduction in the stability value of
the generated concepts.</p>
        <p>In spite of good Reliability values, the general performance of our application is
quite low (according F-Measure). But here there is something affecting the
performance of our proposal. Previously to the application of FCA, we filtered out the
unrelated tweets. However we didn’t the filtering goldstandard at the time of sending the
runs, so we had to apply one of our filtering approaches; which as it can be seen
before, it doesn’t have very accurate results.</p>
        <p>In order to address this problem, we used the filtering goldstandard as a filter, once
it was released by the organizers, and we obtain the results shown in the Table 7. The
table shows only the experiments using a stability value of 90%, the value which a
higher performance achieves. Both runs outperform the sent runs, so the low
performance of our approach can be attributed to the low performance of the filtering step,
previous to the FCA modelling. However the improvement is much clearer for the
enhanced_run_1; in fact this result would be placed in the first third of the overall
RepLab results. This seems to indicate that a threshold equal to 5% is too restrictive
and it leaves out an important part of the knowledge contained in the tweet
terminology.</p>
        <p>As a final comment, we want to remark one strange result obtained during the
evaluation step. We can see that if we considered only two clusters (the root of the
lattice as one cluster and the rest of the lattice as another cluster) the results are
surprisingly good (see Table 8); in fact they improve the performance of the best
approach.
The work done in the RepLab campaign was divided in two sides. First, we
participated in the Filtering and Polarity tasks by proposing the application of an IR
approach to annotate tweets, instead of common classification approaches. For the Topic
Detection task our work was focused on the application of Formal Concept Analysis
in order to model tweet contents and to detect a set of topics in these contents. The
results obtained by our IR approach are opposite. While for the Filtering task we don’t
achieve satisfactory results, for the Polarity task our results are quite satisfactory,
comparing them with the rest of presented approaches.</p>
        <p>Analysing in more detail results, all of our ideas to enhance filtering models was
confirmed, outperforming baseline results. In general, the use of specific information
(named entities, content of external webs, Wikipedia) seems to be better than only the
use of tweet contents for this task. Also remark that the use of unrelated contents was
the best approach; as we supposed, on a collection where the contents was mostly
related to the entities, looking only for the unrelated contents is more precise.</p>
        <p>Focusing on Polarity task, our approach works well for the proposed task. The use
of models generated through the most similar approach has proven to be more
representative than baseline models, even though these models are more dependent on the
coverage of training set and that the test set are greater than the training set(1500 vs
750 tweets per entity). Results obtained by the adjective based approaches are
interesting; they achieved an almost perfect precision value; however the low coverage
made that these approaches achieved an extremely low F measure results.</p>
        <p>In relation with topic detection, results of the sent runs got a very satisfactory value
in terms of precision; however their general performance was not so good. But, as we
cited before, we had some problems with the pre-filtering step with our sent runs.
Once this problem was solved, by using filtering goldstandard, our FCA-based
approach results achieved a significant improvement, positioning them between the best
performing approaches according F-measure and in the first place according
Reliability. We want to specially remark our 2-cluster approach results, the best among all
proposals, according F-measure. At this point, a proper analysis has to be done here to
understand the reason for that and how to apply to our proposal.</p>
        <p>As future work, it would be interesting the application of the lessons learnt in the
filtering task for modelling enhancement (regarding to the data to use and the ways to
model) to other modelling proposals. Focusing on the work done for the polarity task,
results point out our approach as a promising way to address this task. Especially
interesting would be the use of adjective based modelling as a previous step of other
annotation approach, given their high performance in terms of precision.</p>
        <p>Finally, FCA has been proven as a promising technique for the topic detection task.
The results obtained by our enhanced runs demonstrate the validity of our approach
for addressing the topic diversity. Also a further analysis has to be done in order to
explain the results of 2 cluster approach and if it is reproducible in other contexts.</p>
        <p>Acknowledgments. This work has been partially supported by the Regional
Government of Madrid under Research Network MA2VIRMR (S2009/TIC-1542), and
HOLOPEDIA (TIN 2010-21128-C02). Special thanks to Daedalus for licencing the
utilization of Stilus Core.</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Amigó</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , Carrillo de Albornoz, J.,
          <string-name>
            <surname>Chugur</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Corujo</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Martín</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meij</surname>
            , E., de Rijke,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Spina</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          : Overview of RepLab 2013:
          <article-title>Evaluating Online Reputation Monitoring Systems</article-title>
          .
          <source>In: Proceedings of the Fourth International Conference of the CLEF initiative, CLEF</source>
          <year>2013</year>
          , Valencia,
          <string-name>
            <surname>Spain.</surname>
          </string-name>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Amigó</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Artiles</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verdejo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Combining evaluation metrics via the unanimous improvement ratio and its application to clustering tasks</article-title>
          .
          <source>Journal of Artifical Intelligence Research</source>
          ,
          <volume>42</volume>
          (
          <issue>1</issue>
          ):
          <fpage>689</fpage>
          -
          <lpage>718</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Castellanos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Recomendación de contenidos digitales basada en modelos del lenguaje: Diseño, experimentación y evaluación</article-title>
          .
          <source>Master Thesis</source>
          . UNED (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Castellanos</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cigarrán</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>García-Serrano</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          :
          <article-title>Using IR Techniques for topic-based sentiment analysis through divergence models</article-title>
          .
          <source>In: Workshop on Sentiment Analysis at SEPLN</source>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Cigarrán</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peñas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verdejo</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Browsing search results via formal concept analysis: Automatic selection of attributes</article-title>
          . In: Eklund,
          <string-name>
            <surname>P</surname>
          </string-name>
          . (eds.)
          <article-title>Concept Lattices</article-title>
          .
          <source>LNAI</source>
          , vol.
          <volume>2961</volume>
          , pp.
          <fpage>74</fpage>
          -
          <lpage>87</lpage>
          . Sydney, Australia.
          <source>Second International Conference on Formal Concept Analysis</source>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Cigarrán</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gonzalo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Peñas</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Verdejo</surname>
            ,
            <given-names>F:</given-names>
          </string-name>
          <article-title>Automatic selection of noun phrases as document descriptors in an fca-based information retrieval system</article-title>
          . In: Ganter,
          <string-name>
            <given-names>B.</given-names>
            , &amp;
            <surname>Godin</surname>
          </string-name>
          ,
          <string-name>
            <surname>R</surname>
          </string-name>
          . (eds.)
          <article-title>Formal Concept Analysis</article-title>
          ,
          <source>LNAI</source>
          , vol.
          <volume>3403</volume>
          , pp.
          <fpage>49</fpage>
          -
          <lpage>63</lpage>
          . Lens, France. Third International Conference (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Cigarrán</surname>
          </string-name>
          , J.:
          <string-name>
            <surname>Agrupación de Resultados de Búsqueda Mediante</surname>
          </string-name>
          Análisis Formal de Conceptos.
          <source>PhD. Thesis</source>
          . UNED (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Kullback</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Leibler</surname>
          </string-name>
          . R.A.:
          <article-title>On information and sufficiency</article-title>
          .
          <source>Annals of Mathematical Statistics</source>
          ,
          <volume>22</volume>
          (
          <issue>1</issue>
          ):
          <fpage>79</fpage>
          -
          <lpage>86</lpage>
          (
          <year>1951</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O.</given-names>
          </string-name>
          :
          <article-title>Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity</article-title>
          .
          <source>Journal of Automatic Documentation and Mathematical Linguistics</source>
          (
          <year>1990</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Kuznetsov</surname>
            ,
            <given-names>S.O</given-names>
          </string-name>
          :
          <article-title>On stability of a formal concept</article-title>
          .
          <source>Annals of Mathematics and Artificial Intelligence</source>
          ,
          <volume>49</volume>
          :
          <fpage>101</fpage>
          -
          <lpage>115</lpage>
          (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Roth</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Obiedkov</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kourie</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Towards concise representation for taxonomies of epistemic communities</article-title>
          .
          <source>Concept Lattices and Their Applications</source>
          , pp.
          <fpage>240</fpage>
          -
          <lpage>255</lpage>
          (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Wille</surname>
          </string-name>
          , R.: Ordered Sets, chap.
          <source>Restructuring lattice theory: An approach based on hierarchies of concepts</source>
          , pp.
          <fpage>445</fpage>
          -
          <lpage>470</lpage>
          . Prentice Hall (
          <year>1982</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>