<!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>UAMCLyR at RepLab 2014: Author Profiling Task?</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>E. Villatoro-Tello</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>G. Ram´ırez-de-la-Rosa</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>C. Sa´nchez-Sa´nchez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>H. Jime´nez-Salazar</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>W. A. Luna-Ram´ırez</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>C. Rodr´ıguez-Lucatero</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Departamento de Tecnolog ́ıas de la Informaci o ́n, Universidad Auto ́noma Metropolitana, Unidad Cuajimalpa, Ave. Vasco de Quiroga Num. 4871 Col Santa Fe</institution>
          ,
          <addr-line>Me ́xico D.F</addr-line>
        </aff>
      </contrib-group>
      <fpage>1547</fpage>
      <lpage>1558</lpage>
      <abstract>
        <p>This paper describes the participation of the Language and Reasoning Group of UAM at RepLab 2014 Author Profiling evaluation lab. This task involves author categorization and author ranking subtasks. Our method for author categorization uses a supervised approach based on the idea that we can use the information on Twitter's user profile, then by means of employing an attribute selection techniques we can extract attributes that are the most representative from each user's activity domain. For the author ranking subtask we use a two step chained method that uses stylistics attributes (e.g. lexical richness, language complexity) and behavioral attributes (e.g. posts' frequency, directed tweets) extracted from the users' profile and the posts. We use these attributes in conjunction with a Markov Random Fields for improving an initial ranking given by the confidence of Support Vector Machine classification algorithm. Obtained results are encouraging and motivate us to keep working on the same ideas.</p>
      </abstract>
      <kwd-group>
        <kwd>Author Profiling</kwd>
        <kwd>Supervised Text Classification</kwd>
        <kwd>Probabilistic Ranking Method</kwd>
        <kwd>Markov Random Field</kwd>
        <kwd>Communication Behavior</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>From its inception in 2006, Twitter has become one of the most important platform for
microblog posts. Recent statistics reveal that there are more that 250 million users that
write more than 500 million posts every day1, talking about a great diversity of topics.
As a consequence, several entities such as companies, celebrities, politicians, etc., are
very interested in using this type of platform for increasing or even improving their
presence among Twitter users, aiming at obtaining good reputation values.</p>
      <p>
        As an important effort for providing effective solutions to the above problem,
RepLab2 proposes a competitive evaluation exercise for Online Reputation Management
(ORM) systems. For this year RepLab campaign (RepLab 2014 [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]), the Author
Profiling task was one of the main evaluated tasks.
      </p>
      <p>The Author Profiling task consisted on two subtasks, namely the Author
Categorization and Author Ranking subtasks. On the one hand, the author categorization subtask
consists in detecting author’s activity domain, e.g., discovering if certain author is a
journalist, an activist, etc. On the other hand, the author ranking subtask consists in
discovering those users that could represent an opinion leader among a community, i.e.,
finding those users who are the most influential (opinion makers) within a community
of users.</p>
      <p>
        In recent years an increasing number of methods and systems are been developed to
tackle the author profiling task. Most of these methods deal with profiling long texts, for
instance, posts in a blog [
        <xref ref-type="bibr" rid="ref11 ref8">8,11</xref>
        ], conversations in a chatroom [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], etc. In these scenarios,
systems usually count with enormous collections of manually labeled examples, where
a set of profiles categories are usually known a priori. However, the task in the RepLab
is a bit different from these previous systems in that the possible set of profile categories
is unknown, thus the lack of examples in some categories adds complexity to this year’s
challenge.
      </p>
      <p>
        The author ranking subtask is as new as the social media has been. One of the
challenges here is to identify an author or authors that are influential to a particular
community. For Twitter, some methods [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ] use a variation of the PageRank algorithm,
taking advantage of the following-followers schema on Twitter. Some others methods
[
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], set the ranking of an author according to the number of tweets that are important.
However, in a very dynamic environment, some of these methods may have some
difficulties updating the ranks for every user or even more every tweet.
      </p>
      <p>Our proposed approach for facing the problem of author categorization is based
on the idea that information in the user’s profile description is good enough to find the
author’s activity domain. To accomplish this task our method uses different attribute
selection techniques to find the most representative characteristics, namely words, for
each activity domain. A variation for this approach employs a term expansion technique
that aims at improving the descriptive terms in each user’s profile.</p>
      <p>Additionally, our proposed approach for author ranking problem is based on the
idea that the rank (leadership) of an author can be detected by considering its writing
style, and its behavior within the Twitter’s community. To accomplish this task, our
method uses different stylistics attributes (lexical richness, language complexity, etc),
as well as some behavioral features (posts’ frequency, directed tweets, etc).</p>
      <p>
        Accordingly, this paper describes the participation of the Language and Reasoning
research group from UAM-C to the CLEF 2014 RepLab author profiling task (i.e.,
author categorization and author ranking subtasks) [
        <xref ref-type="bibr" rid="ref1 ref4">4,1</xref>
        ]. The main objectives of our
experiments were:
1. Determine if it is possible to categorize author based on solely the information that
every Twitter’s user share in the profile information.
2. Determine if it is possible to rank an user based on stylistics and behavioral
attributes extracted from their posts.
      </p>
      <p>The rest of this paper is organized as follows. The next section describes all the
steps considered in developing and performing all of our experiments for the author
categorization subtask. Then, Section 3 describe the proposed approaches for solving
the problem of author ranking. Finally, Section 4 presents the conclusions derived from
this work and outlines future work directions.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Author Categorization</title>
      <p>
        The Author Categorization subtask consisted in classifying Twitter profiles by type of
author (i.e, journalist, professional, authority, activist, investor, company or celebrity).
Since we were given the main categories on the training set (i.e., twitter profiles), we
faced the problem as a supervised approach, particularly as a Text Classification (TC)
task. As a first step, all documents contained in the training and test sets were
preprocessed: deleting stop words, URLs and using a Porter stemmer algorithm [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ]. Next,
we computed the Document Frequency (DF) score for each term contained in the
training collection. Then, terms were sorted according to their frequency values (i.e., DF
values). Finally, we applied a term selection technique, which consists of selecting sets
from 10% to 100% of terms according to their DF value.
      </p>
      <p>We selected as main classifier method the Support Vector Machines (SVM)
approach as implemented in Weka. Results are reported in terms of Precision, Recall and
F-score, while as a validation strategy we employed a 10 cross-fold-validation
technique.
sion is performed, we compute the DF score of all terms and follow a similar process
to the one described above.</p>
      <p>
        Finally, as our third and fourth set of experiments we applied as a term selection
strategy one of the methods that has been proved effective in thematic TC, namely the
transition point (ptT ) [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ]. The t pT represents a frequency value that accurately divides
the vocabulary in two subsets, those of low frequency and high frequency [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Some
empirical results [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] indicate that by means of preserving those terms surrounding the
t pT it is possible to solve (to some extent) some non-thematic TC tasks.
      </p>
      <p>Consequently, for our third and fourth experiments (second and third row from
Table 3) we applied the t pT instead of the DF as term selection strategy. Table 3 shows
obtained results on the training set when this strategy is employed.</p>
      <p>The first column in Table 3 indicates whether we applied or not a terms expansion
technique on users’ profiles. As can be observed, better results are obtained when no
expansion is performed.
2.1</p>
      <sec id="sec-2-1">
        <title>Submitted runs</title>
        <p>Based on the results obtained on the training set, we define the following as our official
experiments.</p>
        <p>UAM-CALYR-AC-1 : This experiment uses as a term selection strategy the DF score.</p>
        <p>According with experimental results (Table 1) we represented users’ profiles by
means of the 80% terms whit higher DF scores.</p>
        <p>UAM-CALYR-AC-2 : Similar to previous experiment, this configuration represents
users’ profiles with the 80% of terms. The main difference is that this experiments
applies a users’ profiles expansion using WordNet.</p>
        <p>UAM-CALYR-AC-3 : The transition point strategy is employed as term selection
strategy. No users’ profiles expansion is performed, and only the 40% of terms
surrounding the t pT are preserved.</p>
        <p>UAM-CALYR-AC-4 : The transition point strategy is employed as term selection
strategy. Users’ profiles expansion is performed by means of WordNet, and only
the 40% of terms surrounding the t pT are preserved.</p>
        <p>As can be observed in Table 4 our proposed experiments are able to achieve a
competitive performance. Notice that in terms of the F measure, our methods that use the
t pT as a term selection strategy are able to reach a 0.44 score. Generally speaking,
proposed approaches are able to obtain good levels of reliability compared to proposed
baselines and systems average, indicating to some extent that proposed approaches
allow better precision values without decreasing sensitivity values.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Author Ranking</title>
      <p>We approached the Author Ranking problem as two-step chained method. The first
phase is a supervised approach, and the later a unsupervised approach that uses a
Markov Random Field. The general schema of our proposed method is shown in Figure
1 and a detail description of each steps is as following.</p>
      <p>The supervised phase has as input two sets of attributes that aim at capturing
stylistics and behavioral characteristics from each user. Each set is composed as follows:
– Self-description (SD). Words in the user’s profile plus tags we use for mentions to
users (mentions), number of hashtags, URLs, and Twitter ID’s user appearing in
the profile (user-info).
– Statistics of use (SU). Number of total tweets, number of followers, number of
following, average of tweets per followers, ratio of following by followers, ratio of
followers by following, and author’s category activity.</p>
      <p>Our intuition is that opinion maker users tend to write profile descriptions in a more
professional fashion than non opinion makers. Also, they tend to link to external URL
that usually contains the user name on their Twitter ID. We also believe that influential
users follow fewer people than people following them.</p>
      <p>Once we extracted the set of attributes, we tackled the ranking problem as a binary
classification task (with classes opinion maker and non opinion maker). We use a SVM
to learn the model, and the final ranked list is generated according to the confidence of
the SVM classification algorithm.</p>
      <p>For our experiments, we wanted to find if the information of only the supervised
phase is enough for providing a proper author ranking. In this direction we propose
two experiments: i) using the complete set of extracted attributes (self-description and
statistics of use), and ii) using only statistics of use. Table 5 shows the results obtained
over the training set. According to these results, self descriptions add some information
that is relevant to correctly classify a user into opinion maker and non-opinion maker
categories so the rank can be assigned correctly.</p>
      <p>For the unsupervised phase, the ranking is obtained based on a Markov Random
Field (MRF) model that separates the opinion maker users from non-opinion makers,
generating a new list by positioning the relevant users (opinion makers) first, and the
others after.</p>
      <p>MRF are a type of undirected probabilistic graphical models that aim at modeling
dependencies among variables of the problem in turn. MRF modeling has appealing
features for problems that involve the optimization of a configuration of variables that have
interdependencies among them. Accordingly, MRFs allow the incorporation of
contextual information in a principled way. MRFs rely on a strict probabilistic modeling, yet
they allow the incorporation of prior knowledge by means of potential functions. For
those reasons, in this work we employed an MRF model for refining the initial ranking
of a set of users previously ordered by a supervised approach (Figure 1).</p>
      <p>
        For our performed experiments, we adopted a MRF configured as described in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ].
Accordingly, in our considered MRF each node corresponds to a user in the list. Each
user is represented as a random variable with 2 possible values: opinion maker and
nonopinion maker. Similarly to [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] we consider a fully connected graph, such that each
node (user) is connected to all other nodes in the field; that is, we defined a
neighbourhood scheme in which each variable is adjacent to all the others.
      </p>
      <p>
        Contrary to [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], we only considered the information provided by the interaction
potential3, which asses how much support provide the neighbouring same-valued
variables to some particular node fi so it keep its current value, and also how much support
give oppose-value variables to fi so it changes to the contrary value.
      </p>
      <p>
        Additionally, for estimating similarities among users we did not use textual features,
instead we propose a set of stylistic and behavioral features that are extracted from
users’ posts which are described below:
3 Originally, the work showed in [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] considers two potentials: i) interaction potential which
accounts for information of the association between surrounding nodes, and ii) observation
potential that accounts for information that is associated to a single node.
– Style-Behavior (SB). In order to determine the set of SB features we compute for
each tweet from each user the following features: number of URLs, hashtags, user
mentions, number of employed words, average size of words, user name length,
vocabulary richness, hapax’s number, average number of retweets, favorites, number
of characters per tweet, number of employed special symbols (not words), size of
user mentions and hashtags (in characters) and the average posting frequency time
with their respective standard deviation. At the end, all calculations are averaged so
that each user is represented by a vector of 16 elements.
      </p>
      <p>Our intuitive idea for proposing SB features is that opinion maker users would have
similar writing styles as well as similar posting behaviors. Hence, the optimal
configuration of the MRF would be able to gather both opinion-maker users and non-opinion
maker users.</p>
      <p>Finally, the initial configuration of the MRF is obtained by considering the output
provided by the supervised phase (Figure 1). That is, the subset of users that were
classified as opinion maker by the supervised phase are initialized as true opinion makers
within the MRF, and all other users as non-opinion makers. Then, the MRF
configuration of minimum energy (MAP) is obtained via stochastic simulation using the ICM
algorithm. At the end of this optimization process, a new re-ordered (improved) list is
produced.</p>
      <p>Our second set of experiments are directed to evaluate the unsupervised phase, thus
we can evaluate the contribution of proposed MRF at improving the initial author
ranking (i.e., improving the output of the supervised phase). To accomplish this goal, we
design three more experiments: i) using the ranked list from experiment SVM: SD+SU
as input for the MRF, and, for estimating similarities within the MRF users are
represented by means of features SD+SU+SB, ii) using the ranked list from experiment
SVM: SU as input for the MRF, and for similarities estimation users are represented
by means of SU+SB features, iii) using the ranked list from experiment SVM: SD+SU
as input for the MRF, and for similarities estimation users are represented by just SB
features.</p>
      <p>As can be observed in Table 6 the MRF ranking proposal improves the initial
ranking generated by the supervised phase (See Table 5). It is worth to remark that the best
result was obtained when just the style and behavior (SB) features, are employed to
estimate similarities within the MRF. These results indicate, to some extent, that opinion
makers do have similar writing styles as well as similar behavior patterns when using
Twitter. In addition, obtained results also indicate that features extracted from profile
information, i.e., SD or SU features, are insufficient and even noisy for the MRF
configuration, however the use of these attributes on a supervised fashion are a cheap and
efficient option to assign an initial ranking for authors.
3.1</p>
      <sec id="sec-3-1">
        <title>Submitted runs</title>
        <p>Based on the results obtained on the training set, we define the following as our official
experiments.</p>
        <p>UAM-CALYR-AR-1 : Using the supervised phase with SVM learning method and
attributes: self-description and statistics of use. That is, the same configuration of
experiment SVM:SD+SU, see Table 5.</p>
        <p>UAM-CALYR-AR-2 : Using the complete schema showed in Figure 1. SVM as
learning method with SD and SU attributes, generated ranking of these serves as input
for the MRF which employs SD+SU+SB for representing users when estimating
similarities within the MRF. This experiment uses the same configuration as
experiment SVM: SD+SU &amp; MRF: SD+SU+SB from Table 6.</p>
        <p>UAM-CALYR-AR-3 : Using the supervised phase only with SVM learning method
and statistics of use as attributes. That is the same configuration of experiment
SVM:SU, see Table 5.</p>
        <p>UAM-CALYR-AR-4 : Using the complete schema showed in Figure 1. SVM as
learning method with SU attributes, generated ranking of these serves as input for the
MRF which employs SU+SB for representing users when estimating similarities
within the MRF. This experiment uses the same configuration as experiment SVM:SU
&amp; MRF:SU+SB from Table 6.</p>
        <p>UAM-CALYR-AR-4 : Using the complete schema showed in Figure 1. SVM as
learning method with SD and SU attributes, generated ranking of these serves as input
for the MRF which employs just SB features for representing users when
estimating similarities within the MRF. This experiment uses the same configuration as
experiment SVM: SD+SU &amp; MRF: SB from Table 6.</p>
        <p>Table 7 shows official results obtained for our submitted experiments. The
secondlast row is the official baseline proposed by RepLab organizers (i.e. Followers). The
last row (All systems average) represents the Macro-average performance obtained by
all participant groups.</p>
        <p>It is worth mentioning that showed results in Table 7, represent the average MAP
performance among the three domains i.e., Automotive, Banking and Miscellaneous,
released as test set. As expected, our best result was achieved when the MRF uses just the
SB features for estimating similarities among users’ profiles. Hence, if we consider the
three test domains, the MAP performance obtained by our experiment
UAM-CALYRAR-5 represents the second best system during RepLab 2014 campaign, particularly for
the author ranking subtask.
In this paper, we have described the experiments performed by the Language and
Reasoning group from UAM-C in the context of the RepLab 2014 evaluation exercise. Our
proposed system was designed for addressing the problem of Author Profiling that
consists of two subtasks, namely author categorization and author ranking. The former
deals with detecting author’s activity domain, e.g. journalist, authority, activist,
company, celebrity, etc. The later consists in discovering which author have more influence
(opinion maker) and which of those are less influential or have no influence at all (non
opinion maker) among a community.</p>
        <p>We proposed a supervised method for tackling the author categorization task. The
main idea of such method was to perform attribute selection techniques based on
document frequency scores and the transition point strategy. This method relies only in the
information that authors provide on their Twitter profile. In its tuning phase we found
that using only the 80% of the total number of attributes is enough for performing well
in this task. An interesting conclusion of the obtained results on the test set is that using
term expansion by synonyms of the words appearing in the profiles is not useful. This
might be because profile’s text are usually not well written, thus the expansion only add
noisy data to an already noisy description.</p>
        <p>As future work for our proposed method for author categorization we plan to extend
it by generating an activity domain model using external resources such as WordNet or
Wikipedia. The idea of this modification is to generate enough (quality) information that
can be used as a prototype description for each category or domain. Accordingly, we
believe that terms expansion may perform better than our previous experiments since,
in this case, terms to be expanded would be far less noisy than profile descriptions.</p>
        <p>For the author ranking subtask we proposed a two-step chained method that consists
of several processes. The first phase is a supervised approach, and the later a
unsupervised approach that uses a Markov Random Field. A key element within our chain are
the features extraction processes. Computed characteristics aim at capturing stylistic
and behavioral features from authors. Our intuitive idea for proposing such features is
that opinion maker users would have similar writing styles as well as similar posting
behaviors. Some of the advantages of our proposed method is that it represents a fast
and not expensive technique to determine an initial rank for authors. Once an initial
rank has been provided, the MRF is able to improve the authors’ ranking considering
some stylistics and behavioral attributes.</p>
        <p>
          Obtained results indicate, to some extent, that opinion makers do have similar
writing styles as well as similar behavior patterns when using Twitter. In addition, obtained
results also indicate that features extracted from profile information are insufficient and
even noisy for the MRF configuration, however these represent a cheap and efficient
option for assigning an initial ranking for authors. As future directions we plan to define
and include an observation potential as proposed by [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]. By means of such potential,
some information that is associated to a single node/user could be incorporated to the
MRF and consequently a better distinction of opinion makers could be performed.
        </p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1. Enrique Amigo´,
          <string-name>
            <given-names>Jorge</given-names>
            <surname>Carrillo-de-Albornoz</surname>
          </string-name>
          , Irina Chugur, Adolfo Corujo, Julio Gonzalo, Edgar Meij, Maarten de Rijke, and
          <string-name>
            <given-names>Damiano</given-names>
            <surname>Spina</surname>
          </string-name>
          .
          <article-title>Overview of replab 2014: author profiling and reputation dimensions for online reputation management</article-title>
          .
          <source>In Proceedings of the Fifth International Conference of the CLEF Initiative</source>
          ,
          <year>September 2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2. Enrique Amigo´,
          <string-name>
            <given-names>Julio</given-names>
            <surname>Gonzalo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Felisa</given-names>
            <surname>Verdejo</surname>
          </string-name>
          .
          <article-title>A general evaluation measure for document organization tasks</article-title>
          .
          <source>In Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR '13</source>
          , pages
          <fpage>643</fpage>
          -
          <lpage>652</lpage>
          , New York, NY, USA,
          <year>2013</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>Daria</given-names>
            <surname>Bogdanova</surname>
          </string-name>
          , Paolo Rosso, and
          <string-name>
            <given-names>Thamar</given-names>
            <surname>Solorio</surname>
          </string-name>
          .
          <article-title>Modelling fixated discourse in chats with cyberpedophiles</article-title>
          .
          <source>In EACL 2012 Workshop on Computational Approaches</source>
          to Deception Detection, pages
          <fpage>86</fpage>
          -
          <lpage>90</lpage>
          , Avignon, France,
          <year>2012</year>
          . ACL.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Ferro N.-Halvey M. Cappellato</surname>
          </string-name>
          , L. and
          <string-name>
            <surname>editors (2014) Kraaij</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          <article-title>Clef 2014 labs and workshops, notebook papers</article-title>
          .
          <source>In CEUR Workshop Proceedings (CEUR-WS.org) ISSN 1613-0073</source>
          , volume
          <volume>1180</volume>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Shoubin</given-names>
            <surname>Kong</surname>
          </string-name>
          and
          <string-name>
            <given-names>Ling</given-names>
            <surname>Feng</surname>
          </string-name>
          .
          <article-title>A tweet-centric approach for topic-specific author ranking in micro-blog</article-title>
          .
          <source>In Proceedings of the 7th International Conference on Advanced Data Mining and Applications</source>
          - Volume
          <string-name>
            <surname>Part</surname>
            <given-names>I</given-names>
          </string-name>
          , ADMA'
          <volume>11</volume>
          , pages
          <fpage>138</fpage>
          -
          <lpage>151</lpage>
          , Berlin, Heidelberg,
          <year>2011</year>
          . Springer-Verlag.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Gilberto</surname>
          </string-name>
          Leon-Martago´n, Esau´ Villatoro-Tello,
          <article-title>He´ctor Jime´nez-Salazar, and Christian Sa´nchez-Sa´nchez. Ana´lisis de polaridad en twitter</article-title>
          .
          <source>Journal of Research in Computing Science</source>
          ,
          <volume>62</volume>
          :
          <fpage>69</fpage>
          -
          <lpage>78</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Dong</surname>
            <given-names>Liu</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Quanyuan Wu</surname>
          </string-name>
          , and Weihong Han.
          <article-title>Measuring micro-blogging user influence based on user-tweet interaction model</article-title>
          .
          <source>In Ying Tan</source>
          , Yuhui
          <string-name>
            <surname>Shi</surname>
          </string-name>
          , and Hongwei Mo, editors,
          <source>Advances in Swarm Intelligence</source>
          , volume
          <volume>7929</volume>
          of Lecture Notes in Computer Science. Springer Berlin Heidelberg,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>A.</given-names>
            <surname>Pastor</surname>
          </string-name>
          <article-title>Lo´pez-</article-title>
          <string-name>
            <surname>Monroy</surname>
          </string-name>
          , Manuel Montes y Go´mez, Hugo Jair Escalante, Luis Villasen˜orPineda, and
          <article-title>Esau´ Villatoro-Tello. INAOE's participation at PAN'13: Author proling task</article-title>
          .
          <source>In Notebook for PAN at CLEF 2013. Valencia, Espa n˜a</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <given-names>M. F.</given-names>
            <surname>Porter</surname>
          </string-name>
          .
          <article-title>Readings in information retrieval. chapter An Algorithm for Suffix Stripping</article-title>
          , pages
          <fpage>313</fpage>
          -
          <lpage>316</lpage>
          . Morgan Kaufmann Publishers Inc., San Francisco, CA, USA,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Berenice</surname>
          </string-name>
          Reyes-Aguirre,
          <article-title>Edgar Moyotl-Herna´ndez, and He´ctor Jime´nez-</article-title>
          <string-name>
            <surname>Salazar</surname>
          </string-name>
          . Reduccio´n de te´rminos ´ındice usando el punto de transicio´
          <source>n. Research on computing science</source>
          ,
          <volume>3</volume>
          :
          <fpage>127</fpage>
          -
          <lpage>130</lpage>
          ,
          <year>2003</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Upendra</surname>
            <given-names>Sapkota</given-names>
          </string-name>
          , Thamar Solorio, Manuel Montes y Go´mez, and Gabriela Ram´
          <string-name>
            <surname>ırez-De-LaRosa</surname>
          </string-name>
          .
          <article-title>Author profiling for english and spanish text</article-title>
          .
          <source>In Notebook for PAN at CLEF 2013</source>
          . Valencia, Espan˜a,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12. Esau´ Villatoro, Antonio Jua´rez, Manuel Montes, Luis Villasen˜or, and L. enrique
          <string-name>
            <surname>Sucar</surname>
          </string-name>
          .
          <article-title>Document ranking refinement using a markov random field model</article-title>
          .
          <source>Natural Language Engineering</source>
          ,
          <volume>18</volume>
          (
          <issue>2</issue>
          ):
          <fpage>155</fpage>
          -
          <lpage>185</lpage>
          ,
          <year>March 2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <given-names>G.K.</given-names>
            <surname>Zipf</surname>
          </string-name>
          .
          <article-title>Human behavior and the principle of least effort: an introduction to human ecology</article-title>
          . Addison-Wesley Press,
          <year>1949</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>