<!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>Identifying Influential Users' Professions via the Microblogs They Forward</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Yuan Wang</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hangyu Mao</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Zhen Xiao</string-name>
          <email>xiaozheng@net.pku.edu.cn</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Computer Science, Peking University</institution>
          ,
          <addr-line>Beijing 100871</addr-line>
          ,
          <country country="CN">China</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <fpage>33</fpage>
      <lpage>44</lpage>
      <abstract>
        <p>For most social media sites, how to find out (influential) users' professions is an important task. Much work has been conducted to explore this task through mining user-generated textual content or analyzing the social network structure. In this paper, we innovatively solve this task by only examining which microblog messages an influential user has forwarded. First, we define hot microblog messages under two standards and identify them from a large number of candidate messages. Each of the identified messages points to a specific hot event. Next, we group similar hot messages together based on their word similarity, semantic similarity, and forwarders' similarity. Last, we represent users with the hot messages they forwarded and design an identification method to identify their professions. Moreover, we collect a real-world dataset to conduct experiments and prove that our method performs significantly better than the traditional method.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Online microblogging services have become an integral part of the daily life for most
Netizens. These services expect to know more about their users’ profiles, since user
profile plays an important role in commercial services, such as personalized
recommendation and online advertising. However, user profile is usually not easily obtained,
because users are reluctant to expose their profiles to the public. Fortunately, some
work has been conducted to solve this problem. A traditional practice is cutting
users’ messages into bags of words and training a classifier. This practice can achieve an
acceptable result on simple tasks such as predicting gender and age [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], but it can not
solve more complex tasks [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ].
      </p>
      <p>Profession, which is founded upon specialized educational training, is a critical
social profile of influential users. In Weibo, the largest microblogging service in China,
influential users are mainly organized by their professions. They are more likely to
follow other users that have the same profession with them. It is important to correctly
identify influential users and their professions for microblogging services.</p>
      <p>Message forwarding (e.g. retweeting on Twitter.com and reposting on Weibo.com)
is one of the most popular functions in the existing microblogging services. In Weibo,
users can forward messages or any interesting content on the web, such as real blogs,
Copyright c 2017 for the individual papers by the papers’ authors. Copying permitted for
private and academic purposes. This volume is published and copyrighted by its editors.
photos and external links. In this paper, if a weibo message was forwarded by any user,
we define it as forwarded message, otherwise we define it as non-forwarded message.
Based on a large dataset, we find that about 60% of weibo messages are forwarded
messages. For most users, the messages they forwarded are exactly what they are interested
in. Users’ professions can be reflected by the messages they forwarded to some extent.
But the traditional “bag of words” model will completely undermine the information
contained in users’ forwarding behaviors. Naturally, in this paper, we ask and try to
answer the following question: can we represent microblog users with the messages they
forwarded, and predict their professions more accurately than the traditional method?</p>
      <p>The task confronts some challenges which make it non-trivial. The first challenge is
that there exist too many forwarded messages. If we consider each forwarded message
as a feature, the feature vector will be very large and sparse. We observe that most
of these messages only have been forwarded by no more than 3 weibo users. In this
paper, we define them as non-hot forwarded messages and define other messages that
are forwarded by more users as hot forwarded messages. In our experiment, we discard
the non-hot messages. Another challenge is that even though we can filter out non-hot
messages, the number of remaining hot messages is still quite large. We observe that,
every hot message points to a hot event (e.g. a breaking news or a recently released
movie). We should come up with some methods to group similar hot weibo messages
together.</p>
      <p>In this paper, we propose an efficient framework of Profession Identification by
using Forwarding Behaviors (PIFB). As Figure 1 shows, first, we identify the hot
forwarded messages from a large number of candidates. Each of these identified messages
points to a specific hot event. Next, we introduce three methods to group similar
messages together, downsizing our message sets. Then, influential users can be represented
with the merged hot messages that they have forwarded. Finally, we predict users’
professions, and the results are more accurate than those in the traditional method.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Dataset and Professions</title>
      <p>We collect 41,531 manually annotated influential users from Weibo (http://weibo.com).
To avoid robot users, we only collected verified users. Weibo conducts manual
verifications to make sure that the verified users provide real and authentic information. These
users belong to 11 representative professions. As Table 1 shows, the professions include
“media”, “entertainment”, “sports”, and “IT”, etc.</p>
      <p>We also collect users’ latest 500 weibo messages. These messages can be classified
into two categories: forward action and post action. In general, forward action consists
of trace and content. Trace contains the information that through which users the current
user can see the final messages. Content can be extended to any forms as long as it can
be shared by users with their followers, such as videos and blogs. A simple example is
shown below: if a user froward the message:</p>
      <p>RT @Raj RT @Sheldon : It took 50 years :::
| tr{azce } | con{tzent }</p>
      <p>This forward action indicates that “It took 50 years ...” was originally posted by
“Sheldon” and was forwarded by “Raj”, and now is forwarded by the current user again.</p>
      <p>In general, post action only contains the “content” part, representing that the current
user posted an original message.
3</p>
    </sec>
    <sec id="sec-3">
      <title>The Framework of PIFB</title>
      <p>In this section, we formalize our problem as a classification task and introduce the main
steps of PIFB.
3.1</p>
      <sec id="sec-3-1">
        <title>Hot Message Identification</title>
        <p>This paper focus on influential user’s behaviors about the forwarded messages. A
critical step is to identify the hot forwarded messages. In this part, we define hot messages
under two standards.</p>
        <p>Absolutely Hot Message We argue that if a message has been forwarded by more
users, the information behind it will be more. And the forwarding behaviors about this
message can help our profession prediction more. Nowadays, Weibo has become the
the biggest “News Site” in China. Most traditional news organizations open their
official accounts in Weibo and these accounts are all very active. They usually publish the
breaking news timely and make the news spread quickly. There also exist many
Chinese celebrities in Weibo, including actors, singers and entrepreneurs, etc. They post
their personal views or daily lives in their accounts. They generally have a great
number of followers and their daily updates are likely to get thousands of forwards. So, in
this paper, if a weibo message has been forwarded by more than a certain times (for
example, 500), it will be regarded as the first kind of “hot forwarded message” (absolutely
hot).
Relatively Hot Message The 11 professions, showed in Table 1, are not “evenly
matched” on attracting attentions. Nearly all the high forwarded messages are all posted
by “entertainment” and “sports” stars. For an “estate” account, it is not easy to post an
absolutely hot message, because “estate” accounts usually have relatively less followers
and lower forwarding rate. If we only adopt the absolutely hot messages as described
in the previous paragraph, it is very possible that we only get the messages posted by a
small subset of that 11 categories (may be 2-4). Therefore, as a supplement to the first
standard, we define another kind of hot message. In our dataset, if a message’s owner
has f followers (f &gt;500) and this message has been forwarded by more than f =5 times,
it will be regarded as the second kind of “hot forwarded message” (relatively hot).</p>
        <p>After identifying all these two types of “hot messages”, we can build a matrix M ,
whose columns denote hot messages and rows denote users. This matrix represents all
the forwarding relationships between weibo users and hot messages. M will have too
much columns, if we don’t filter out the non-hot messages. Even though we do only
consider the hot messages, the number of column is also very big. To slim down M , we
propose three methods to group similar messages together in the next.
3.2</p>
      </sec>
      <sec id="sec-3-2">
        <title>Group Similar Hot Messages Together</title>
        <p>In most microblogging services, users can be divided into two categories:
information producer and information consumer. The information producer mainly includes
the news site accounts, self-media accounts, and profit-seeking accounts with legions
of followers. Their main purpose is making their microblogs broadcast as widely as
possible to expand their influence and get more new followers. Whenever there is a news,
producers will timely post their relevant microblogs. The producers are very likely to
post similar contents, because the texts may be pasted from the same source. The
information consumer mainly refers to normal weibo users. More than 90% weibo users can
be classified into this category. Their most important action is reading and forwarding
messages. Normally, hot messages are more likely to attract them.</p>
        <p>If the hot messages only contain a video link or a web link, it is easy to determine
whether they are similar. But if they contain some text contents, the task will be more
difficult. In the next, we introduce three methods to solve it.</p>
        <p>
          Simhash As described above, the information producers are likely to post similar
weibo messages. The most direct idea is that merging similar hot messages based on their
word similarity. Simhash [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] is a widely used dimensionality reduction technique in
calculating the document similarity. This model can map high dimensional document
vectors to small-sized fingerprints. With the help of simhash, we can transform such a
high-dimensional vector into a k-bit fingerprint where k is quite small, such as 64. An
important characteristic of simhash is that, similar documents have similar hash values.
For instance, if there are two documents that only differ in a single word, the
cryptographic hash functions will hash them into two completely different values. However,
simhash will hash them into similar fingerprints. This characteristic is very important
in calculating the document similarity.
        </p>
        <p>In this method, we firstly calculate the simhash values of all the hot messages.
After that, we can group the similar messages together, if the hamming distance of their
simhash fingerprints is less than or equal to 3.</p>
        <p>
          Paragraph Vector The simhash can only calculate the documents’ similarity based on
their word similarity. It can not deal with situation that, two documents have the similar
semantics but written with different words. [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ] proposes “Paragraph Vector” (P2V), an
unsupervised framework that learns continuous distributed vector representations for
pieces of texts. This method can be applied to variable-length paragraphs, and
transform them into fixed-length vectors. In this model, every weibo message is mapped to
a unique vector, represented by a column in a matrix and every word is also mapped
to a unique vector, represented by a column in another matrix. The paragraph vectors
and word vectors are concatenated to predict the next word. They are trained using
stochastic gradient descent and the gradient is obtained via backpropagation. Details can
be found in the original paper. After being trained, the distance between two paragraph
vectors will be small if they talk about a same topic. It is not sensitive about the
synonym. These vectors can be used as features directly to conventional machine learning
models, such as logistic regression or k-means.
        </p>
        <p>We firstly calculate hot messages’ representative vectors by using the “Paragraph
Vector” method. The length of vector is set to 400 according to the original paper. After
that, we calculate their distances. A pair of hot messages can be grouped together if
their distance is smaller than a threshold.</p>
        <p>
          User-Weibo Matrix Factorization The first method is based on message’s word
similarity and the second is based on the semantic similarity. They are both directly
calculated by the weibo contents. As described in section 3.1, we have generated the user-weibo
relationship matrix M . So we can further find more similar messages based on which
users have forwarded these messages. Hofmann [
          <xref ref-type="bibr" rid="ref5">5</xref>
          ] introduced the PLSA, which
developed probabilistic latent semantic models for performing collaborative filtering. In
this step, PLSA models users (u2U ) and documents (d2D) as random variables, taking
values from the space of all possible users and documents respectively. The relationship
between them is learned by modeling the joint distribution of users and documents as
a mixture distribution. The hidden variables t (t2T , kT k=k) represent the topics
between U and D. The model can be written in the form of mixture model as the next
equation:
        </p>
        <p>k
P (ujd; ) = X p(ujt)p(tjd)
t=1</p>
        <p>(1)</p>
        <p>Based on this model, we can transform the user-weibo matrix into two new matrices.
The first is user-topic matrix, which represents each user with a vector of k topics. The
second is document-topic matrix, which represents each document with a vector of k
topics too. In the second matrix, if the documents contain similar topics, their vectors
are more likely similar. We can group two similar hot messages together, if the distance
between their vectors is under a threshold. In this paper, we empirically set k to 400 and
name this method UWMF.
3.3</p>
      </sec>
      <sec id="sec-3-3">
        <title>Profession Prediction</title>
        <p>After merging similar hot messages, users can be represented as more compact vectors.
Each element of these vectors represents a merged hot message, and the elements will
be used as features in our multi-class classifier.</p>
        <p>
          Over the last several decades, many kinds of discriminant classifier have been
created. In our experiment, we compare Logistic Regression (LR) and Gradient Boosted
Decision Tree (GBDT). We choose GBDT as our default multi-class classifier, because
we find that GBDT performs better in most instances. Hence, in the following part we
only show the results obtained with GBDT [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ].
4
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>Experiment Results</title>
      <p>In this section, we first statistically study our dataset. After that, we identify the hot
weibo messages and merge the similar ones. At last, we compare our methods with the
baseline method comprehensively.
4.1</p>
      <sec id="sec-4-1">
        <title>Observation</title>
        <p>We firstly count influential user’s forwarding rates on different professions. As Figure
2(a) shows, different professions have different forwarding rates on average. It is a little
surprise that the “estate” and “government” accounts forwarded more messages
compared with the “finance” accounts. Overall, the difference between different professions
is not significant. In our dataset, about 58% of weibos are all forwarded messages. For
about 66% users, more than half of their messages are forwarded messages. Figure 2(b)
shows the distribution of how many messages users forwarded (in their latest 500
messages) in our dataset. We find that about 95% users forwarded more than 50 messages.
In this paper, our goal is to predict users professions only based on their forwarding
behaviors, so we discard other 5% users who forwarded no more than 50 messages in
our experiment.</p>
        <p>As described in section 3.1, we define the absolutely hot message and the relatively
hot message separately. To better understand these two types, we calculate how many
times that users’ latest 500 weibo messages have been forwarded on average by
category. As Figure 2(c) shows, these numbers of different categories are very unbalanced.
The “entertainment” and “literature” accounts attract much more forwarding behaviors
than “estate” accounts. The main reason is that the “entertainment” and “literature”
accounts have relatively more followers. If we only adopt absolutely hot messages (for
example, the threshold is set to 500), it is possible that we can not get any hot
messages posted by “estate”. So identifying relatively hot messages is very necessary in
our model.</p>
        <p>Users forward how many messages
in their latest 500 messages</p>
        <p>Users forward how many messages</p>
        <p>in their latest 500 messages
500
sd400
r
a
row300
ff
o
re200
b
m
uN100
3500
3000
2500
tn2000
u
oC1500
1000
500</p>
        <p>00
0 Me En Es FiPGroofeIsTsioSpnsFa Ed li Ga 00 F1o0r0ward h2o00w man3y00messa4g00es 500
(a) Users forward how many messages (b) The distribution of user’s
forwarding behavior
7 x 104</p>
        <p>How many times users’ latest 500
messages were forwarded</p>
        <p>The length distribution of
forwarded messages
0 Me En Es FiPGroofeIsTsioSpnsFa Ed li Ga 5L0engt1h00of for1w50arde2d00Weib2o50 300
(c) Number of users’ 500 messages (d) Length distribution of forwarded
were forwarded messages</p>
        <p>Weibo limits message length to 140 Chinese characters or 280 English characters.
Figure 2(d) shows the length distribution of hot messages in our dataset. We can find
that there exist two peaks. The first peak represents the hot messages that only contain
10-20 characters. These messages are likely to be posted by star users who have millions
of fans. This kind of message usually additional contains a picture or a video link. The
second peak represents the messages that contain 140 Chinese characters. This kind of
message generally contains rich semantics.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Identify Hot Messages</title>
        <p>As described in section 3.1, if a message has been forwarded by more than a certain
number of times, it will be considered as an absolutely hot message. It is apparent that
how to set the threshold is a double-edged sword. If we set the threshold to a smaller
value (more hot messages), on one hand, user can be represented with more messages
and our model’s expression ability will be increased; on the other hand, our model
should handle more features and need to take the risk of over-fitting. As Table 2 shows,
we set the threshold to 500, 2,000, and 10,000 separately. When the threshold is set
to 500, we can get 731,153 hot weibo messages. This number is too large and most
of these messages have been forwarded by no more than 5 users in our dataset (40
thousand users). Then, we filter out such messages from our hot message sets, leaving
100,219 valid messages. In the prediction tasks, we compare the performance of these
three thresholds and choose 500 as the default value.</p>
        <p>As section 3.1 shows, if a message’s owner has f followers (f &gt;500) and this
message has been forwarded by more than f =5 times, we regard this weibo message as a
relatively hot message. Just as the absolutely hot messages, we also filter out the
messages that have been forwarded by no more than 5 users in our dataset, and get 61,806
relatively hot messages.</p>
        <p>Eventually, we collect 162,025 hot messages in total (100,219 absolutely hot &amp;
61,806 relatively hot).
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Group Similar Hot Messages Together</title>
        <p>
          In this part, we evaluate the performance of our three methods on clustering similar hot
messages. As Table 3 shows: (1) In the simhash method, we choose 64 as the default
length of hash value. In this step, we group similar messages together, if their hamming
distance is less than or equal to 3. We can merge our 162,025 hot messages, identified
from section 4.2, into 57,624 hot events. (2) In the second method, we choose 400 as
the default size of paragraph vector, and merge similar messages according to their
Euclidean distances. In this step, we can merge the 162,025 hot messages into 32,118
hot events. (3) In the third method, we also choose 400 as the size of hidden variables,
and adopt Euclidean distance to measure their similarities. In this step, we can merge
the 162,025 hot messages into 27,129 hot events. In our experiment, the lengths of
these three vectors (64, 400, 400) are chosen empirically [
          <xref ref-type="bibr" rid="ref10 ref8">8, 10</xref>
          ]. We validate the other
hyper-parameters (where to stop merging) with the validation set, and find the best stop
points.
        </p>
        <p>In practice, we serially combine all these three methods. At first, we adopt the
simhash to find similar hot messages, making users’ representative vectors more
compact. On the basis of this results, we adopt the second method, further compressing
users’ vectors. At last, we perform the third method based on the current results. After</p>
      </sec>
      <sec id="sec-4-4">
        <title>No. Merging Strategy # before # after</title>
        <p>1 Simhash 162,025 57,624
2 P2V 162,025 32,118
3 UWMF 162,025 27,129
4 Simhash+P2V+UWMF 162,025 17,196
these three steps, our 162,025 hot messages can cluster together into 17,196 hot events.
In the next, we will study whether these optimizations can improve our profession
identification tasks.
4.4</p>
      </sec>
      <sec id="sec-4-5">
        <title>Results of Prediction</title>
        <p>We randomly divide our 40 thousand labeled users into training set (60%), validation
set (20%), and test set (20%). We regard user’s labeled profession as the gold standard,
and select accuracy, macro-averaging precision/recall/F-Measure as evaluation metrics.</p>
        <p>To verify the validity of our method, we build a baseline model. The feature
candidates of baseline model include: (1) Words in user’s original messages; (2) Words in
user’s forwarded messages; (3) Mentioned user ids in messages; (4) URLs in messages;
(5) Hash tags in messages. There exist hundreds of thousands of feature candidates and
we have to perform feature selection to downsize our feature sets. Following the valid
experience in feature selection for text classification, we use 2 statistic to select
representative features. We evaluate performance with different numbers of features, and
select 9200 feature candidates. We compare LR and GBDT on these features and find
they have similar performance. To be consistent with our model, we also choose GBDT
as the default baseline classifier.</p>
        <p>From Table 4, we can observe the evaluation results. We find that the baseline
model achieves a performance of 62.38% in accuracy and our three models all get better
results than it. This comparison proves user’s forward behavior is effective in
profession identification. As Table 4 shows, along with the implementation of three merging
strategies, our three models can make the prediction gradually improved. Our model in
the fourth line that serially adopts all three merging strategies achieves the best result
(accuracy=73.98, F1=73.87). This result indicates that effective clustering of similar
messages is necessary, for there exist too many forwarded messages.</p>
        <p>To better understand the prediction errors, we present the details of the best result.
In Table 5, the value of ith row and jth column represents the ratio of the users in
profession i being identified as profession j.</p>
        <p>To make the data more intuitive, we illustrate the ratio in each entry using different
shades of color. We can observe that: (1) Our model performs differently on different
professions. The recall scores (value on the diagonal) of most professions are bigger
than 70%, with only “fashion” and “literature” less than 65%. The main reason is that
the forward behavior of these two professions has no special characteristics. (2) The
“media” accounts occupy about a quarter of our user collections. Our model tends to
predict the uncertain user as “media” account, making the precision score of “media”
relatively lower (51.3%). (3) The behaviors of some professions are quite similar. For
example, the “entertainment” user and “fashion” user have the similar interests, they
usually follow and interact with each other. It makes the boundary between these two
professions not very clear for identification.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Related work</title>
      <p>
        User’s attributes can be inferred from user-generated text data and social network
structure. [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] showed that users’ age and gender can be predicted from people’s webpage
browsing logs. [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ] showed users’ profiles can be predicted by their mobile phone apps.
[
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] analyzed tens of thousands of blogs and indicated significant differences in writing
style and word usage between different gender and age groups. [
        <xref ref-type="bibr" rid="ref1 ref11">1, 11</xref>
        ] predicted user’s
gender and age based on their twitter linguistic characteristics. [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] identified weibo
users’ profiles only via the videos they talk about. [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] identified users’ political
orientation and ethnicity by leveraging their network structure and linguistic characteristics.
[
        <xref ref-type="bibr" rid="ref17 ref4">4, 17</xref>
        ] predicted users’ profiles based on their social network structure and chick ins.
      </p>
      <p>
        Recently, there are some researches on identify users’ professions. [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ] presented an
efficient framework for profession identification in Weibo. This work identified users’
professions based on both personal information and network structure. [
        <xref ref-type="bibr" rid="ref16 ref7">7, 16</xref>
        ] showed
that computers’ judgments of people’s personalities based on their Facebook Likes are
more accurate than judgments made by their close acquaintances.
6
      </p>
    </sec>
    <sec id="sec-6">
      <title>Conclusion</title>
      <p>In this paper, we present an efficient framework PIFB to predict influential users’
professions by only examining which microblogs they have forwarded. In the first step, we
identify the hot weibo messages from a large number of candidate messages, and
represent users with the hot messages they forwarded. After that, we group hot messages
together if they talk about the similar topics. This step can make users’ representative
vectors more compact. At last, we design a multi-class classifiler to predict their
professions. The experiments on a real-world dataset demonstrate the effectiveness of PIFB.
Our method performs significantly better than the traditional “bag of words” based
method.</p>
    </sec>
    <sec id="sec-7">
      <title>Acknowledgments</title>
      <p>The authors would like to thank the anonymous reviewers for their comments. This
work was supported by the National Natural Science Foundation of China under Grant
No.61572044. The contact author is Zhen Xiao.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Burger</surname>
            ,
            <given-names>J.D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Henderson</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zarrella</surname>
          </string-name>
          , G.:
          <article-title>Discriminating gender on twitter</article-title>
          .
          <source>In: Proceedings of the EMNLP</source>
          . pp.
          <fpage>1301</fpage>
          -
          <lpage>1309</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Charikar</surname>
            ,
            <given-names>M.S.</given-names>
          </string-name>
          :
          <article-title>Similarity estimation techniques from rounding algorithms</article-title>
          .
          <source>In: Proceedings of the thiry-fourth annual ACM symposium on Theory of computing</source>
          . pp.
          <fpage>380</fpage>
          -
          <lpage>388</lpage>
          . ACM (
          <year>2002</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Guestrin</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Xgboost: A scalable tree boosting system</article-title>
          .
          <source>In: Proceedings of SIGKDD</source>
          . pp.
          <fpage>785</fpage>
          -
          <lpage>794</lpage>
          . ACM (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Culotta</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kumar</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cutler</surname>
          </string-name>
          , J.:
          <article-title>Predicting the demographics of twitter users from website traffic data</article-title>
          .
          <source>In: Proceedings of AAAI</source>
          . pp.
          <fpage>72</fpage>
          -
          <lpage>78</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Hofmann</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Latent semantic models for collaborative filtering</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS) 22(1)</source>
          ,
          <fpage>89</fpage>
          -
          <lpage>115</lpage>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Hu</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zeng</surname>
            ,
            <given-names>H.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Niu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Demographic prediction based on user's browsing behavior</article-title>
          .
          <source>In: Proceedings of WWW</source>
          . pp.
          <fpage>151</fpage>
          -
          <lpage>160</lpage>
          . ACM (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kosinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stillwell</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Graepel</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Private traits and attributes are predictable from digital records of human behavior</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>110</volume>
          (
          <issue>15</issue>
          ),
          <fpage>5802</fpage>
          -
          <lpage>5805</lpage>
          (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Le</surname>
            ,
            <given-names>Q.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mikolov</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          :
          <article-title>Distributed representations of sentences and documents</article-title>
          .
          <source>In: Proceedings of ICML</source>
          . pp.
          <fpage>1188</fpage>
          -
          <lpage>1196</lpage>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Malmi</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Weber</surname>
            ,
            <given-names>I.</given-names>
          </string-name>
          :
          <article-title>You are what apps you use: Demographic prediction based on user's apps</article-title>
          .
          <source>arXiv preprint arXiv:1603.00059</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Manku</surname>
            ,
            <given-names>G.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jain</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Das</surname>
            <given-names>Sarma</given-names>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          :
          <article-title>Detecting near-duplicates for web crawling</article-title>
          .
          <source>In: Proceedings of WWW</source>
          . pp.
          <fpage>141</fpage>
          -
          <lpage>150</lpage>
          . ACM (
          <year>2007</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Nguyen</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gravel</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trieschnigg</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meder</surname>
          </string-name>
          , T.:
          <article-title>”how old do you think i am?”; a study of language and age in twitter</article-title>
          .
          <source>In: Proceedings of ICWSM</source>
          . AAAI Press (
          <year>2013</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Pennacchiotti</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Popescu</surname>
            ,
            <given-names>A.M.:</given-names>
          </string-name>
          <article-title>A machine learning approach to twitter user classification</article-title>
          .
          <source>In: Proceedings of ICWSM</source>
          . pp.
          <fpage>281</fpage>
          -
          <lpage>288</lpage>
          (
          <year>2011</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Schler</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Koppel</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Argamon</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pennebaker</surname>
            ,
            <given-names>J.W.:</given-names>
          </string-name>
          <article-title>Effects of age and gender on blogging</article-title>
          . In: AAAI Spring Symposium: Computational Approaches to Analyzing Weblogs. vol.
          <volume>6</volume>
          , pp.
          <fpage>199</fpage>
          -
          <lpage>205</lpage>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Tu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sun</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <source>Social Media Processing: 4th National Conference, SMP</source>
          <year>2015</year>
          , Guangzhou, China,
          <source>November 16-17</source>
          ,
          <year>2015</year>
          , Proceedings, chap.
          <source>PRISM: Profession Identification in Social Media with Personal Information and Community Structure</source>
          , pp.
          <fpage>15</fpage>
          -
          <lpage>27</lpage>
          . Springer Singapore, Singapore (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ma</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>Improving users' demographic prediction via the videos they talk about</article-title>
          .
          <source>In: Proceedings of EMNLP</source>
          (
          <year>2016</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kosinski</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stillwell</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          :
          <article-title>Computer-based personality judgments are more accurate than those made by humans</article-title>
          .
          <source>Proceedings of the National Academy of Sciences</source>
          <volume>112</volume>
          (
          <issue>4</issue>
          ),
          <fpage>1036</fpage>
          -
          <lpage>1040</lpage>
          (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17.
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yuan</surname>
            ,
            <given-names>N.J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhong</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xie</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>You are where you go: Inferring demographic attributes from location check-ins</article-title>
          .
          <source>In: Proceedings of WSDM</source>
          . pp.
          <fpage>295</fpage>
          -
          <lpage>304</lpage>
          . ACM (
          <year>2015</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>