<!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>Active Tweet Recommendation Based on User Interest Profiles</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>CCS Concepts</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Raheleh Makki Faculty of Computer Science, Dalhousie University</institution>
          ,
          <addr-line>Halifax, NS</addr-line>
          ,
          <country country="CA">Canada</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Research presented here has been jointly done with Dr. Axel J. Soto (National Centre for Text Mining, School of Computer Science, University of Manchester, UK. pervisors Prof. Stephen Brooks and Prof. Evangelos E. Milios (Faculty of Computer Science, Dalhousie University</institution>
          ,
          <addr-line>Hal-</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>The rapid growth of Twitter has made it one of the most popular information sources of current affairs. Twitter users gather information about their topics of interest through their followees' posts or by searching for relevant posts. However, users are often overwhelmed by the large number of tweets which makes it difficult for them to find relevant and non-redundant information about their interests. Information filtering and recommender systems can help users by suggesting informative tweets based on their interests. Considering the wide variety of topics in users' interest profiles and the sheer volume of tweets being published daily, it is difficult to have adequate and proper labeled data to train these systems on. We aim to tackle this problem by integrating active learning techniques into tweet recommendation, more specifically for finding relevant tweets and ranking them. Using active learning methods in the context of Twitter recommenders has not been well explored before. Our objective is to exploit these methods for improving the accuracy of tweet recommenders the most, while keeping the cost of labeling to a minimum.</p>
      </abstract>
      <kwd-group>
        <kwd>•Information systems → Recommender systems</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>With the constant growth of blogs, forums, and online
social networks, the need for information retrieval systems,
recommenders and analytical tools increases. On the other
hand, existing standard techniques may be inadequate to
overcome new challenges introduced by particular
characteristics of the data generated from these sources. Online
chats, tweets, blogs and any other data sources with
informal settings contain short texts riddled with spelling errors,
incorrect grammar, acronyms and non-standard words. In
addition, methods for processing and analyzing these type of
messages should be ideally real-time since they are usually
only interesting during short time after being published.</p>
      <p>
        Twitter has become one of the most popular social media
platforms with vast and various number of discussed topics
and shared information. Many users seek and collect
information about their areas of interest from Twitter.
However, considering the sheer volume of tweets published daily
(around 500 million tweets), users can be overwhelmed by
large amounts of tweets from their followees [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ].
Information filtering and recommender systems aim to find useful
and novel information based on the user’s preferred topics
and suggest them in a ranked order. Since users can have
diverse interests, each changing over time, and also as current
events are rapidly added to the vast set of topics of
discussion on Twitter [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], it is not appropriate to use old data for
training recommenders on. In addition, considering the cost
of labeling and the real-time nature of Twitter, it would be
infeasible to label large quantities of data for every user in
different time spans. In this Ph.D., we aim to introduce and
apply active learning strategies, which select a number of
instances to be labeled by an information source, in order
to improve the accuracy of the recommender systems while
minimizing the labeling cost.
2.
      </p>
    </sec>
    <sec id="sec-2">
      <title>PROPOSED METHOD</title>
      <p>We propose to integrate active learning strategies with
learning-to-rank and information filtering methods. Our
framework is presented in Figure 1, which shows the use
of active learning in both tweet relevance model and
ranking model of our recommender system. We briefly discuss
each component in this section.</p>
      <p>
        We assume that users specify the gist of their interest in
a few keywords. Therefore, we formulate a query from these
keywords and summarize our recommendation task as “At
time T , give a ranked list of most relevant and novel tweets
about query Q”. We consider the language model-based
retrieval using Dirichlet smoothing [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ] as our baseline
relevance model. This model retrieves a list of tweets ranked by
their relevance to the search query. Verifying the relevance
of retrieved tweets by active learning strategies can improve
the accuracy of tweet relevance model (see Section 3 for
some preliminary results). To take into account the novelty
of the recommended tweets, we cluster the retrieved tweets
and only include the tweet that was published earlier within
each cluster in the final recommendation list [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. We
consider these sequence of steps as our baseline recommender
system.
      </p>
      <p>
        In the baseline model, we rank retrieved tweets based on
their relevance score by the language model. It has been
shown that social attributes such as the number of retweets,
URLs or hashtags in the text of tweets, or followers of the
tweets’ authors contain information about the credibility of
tweets [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ] and should also be considered in ranking of tweets.
Having a set of features, learning-to-rank methods have been
used for constructing ranking models for tweet
recommendation [
        <xref ref-type="bibr" rid="ref14 ref3 ref4 ref9">3, 4, 14, 9</xref>
        ]. However, these methods need labeled
data for training the ranking model. Assuming the
availability of human labels or limited labeled data, active
learning and semi-supervised techniques focus on selecting the
best instances to be considered in the training data.
Using these techniques in recommender systems in general has
been studied before [
        <xref ref-type="bibr" rid="ref1 ref11 ref5 ref7">7, 11, 5, 1</xref>
        ]. However, adapting these
strategies for Twitter message recommendation has not been
explored much to the best of our knowledge.
      </p>
    </sec>
    <sec id="sec-3">
      <title>DATASET AND INITIAL EVALUATION</title>
      <p>
        In order to study how user involvement can improve the
performance of our tweet recommender system, we performed
some preliminary experiments using the TREC 2015
Microblog track (TRECMicro) dataset [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. We collected tweets
during the evaluation period of the TRECMicro using the
Twitter’s streaming API. We gathered 40,264,332 tweets,
out of which only English tweets (16,302,498) have been used
in our experiments. We consider the judgment scores
provided by the TRECMicro and the normalized Discounted
Cumulative Gain (nDCG) [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] as our gold standard and
evaluation metric respectively. nDCG is calculated over k
(k = 10 here) top suggested tweets for each user profile per
day. The final value is the average over the evaluation period
and all 51 user interest profiles (also provided by
TRECMicro). In cases where there are no relevant tweets to the
user interest in a particular day, the recommender system
should remain silent (achieving nDCG = 1) for that day,
otherwise any tweet recommendation penalizes the system
(nDCG = 0).
      </p>
      <p>The focus of the evaluation metric on the precision of the
recommended tweets requires including only tweets the
system is confident about. Considering a threshold and
discarding tweets with relevance score less than that
threshold is one possible way. However, not having labeled data
makes it difficult to tune this parameter for different users
with various interests. Therefore, we consider the most basic
strategy for selecting tweets for labeling (i.e. to be labeled
by the information source), which is to select only the top
recommended tweet for each user profile per day. If the top
selected tweet is not relevant to the user interest, we discard
all selected tweets for that day.</p>
      <p>The results of applying this simple strategy to the
relevance model is reported in Table 1. It also shows the
results of top 3 teams that participated in TRECMicro, which
indicates the potential of active learning techniques in
improving the performance of the tweet recommender systems.
TRECMicro categorized the systems based on the amount
of human involvement into three different categories:
automatic with no human input, manual preparation with
human input only before the evaluation starts and manual
intervention with human input all the time. Our proposed
approach using active learning falls under the category of
manual intervention.</p>
      <p>Type
manual intervention
manual
manual
automatic
automatic
4.</p>
    </sec>
    <sec id="sec-4">
      <title>FUTURE PLAN</title>
      <p>To overcome some of the challenges related to real-time
tweet recommender systems, we plan to introduce and
apply active learning strategies. These strategies select the
instances to be labeled by an information source in a way
that the quality of the recommended tweets improves the
most. Initial analysis, reviewing state-of-the-art methods,
and preliminary experiments has already been done. Our
future plan for the next year is to integrate active learning
into different retrieval and ranking models and investigate
their effectiveness in improving the results of our baseline
recommender system. In addition, we would like to analyze
the effect of different groups of features including
contentbased features and social attributes on the accuracy of tweet
relevance and ranking models.</p>
    </sec>
    <sec id="sec-5">
      <title>ACKNOWLEDGMENTS</title>
      <p>This research was funded by the Natural Sciences and
Engineering Research Council of Canada (NSERC) and The
Boeing Company.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>L.</given-names>
            <surname>Bl</surname>
          </string-name>
          <article-title>´edait´e and</article-title>
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          .
          <article-title>Pairwise preferences elicitation and exploitation for conversational collaborative filtering</article-title>
          .
          <source>In Proceedings of the 26th ACM Conference on Hypertext &amp; Social Media</source>
          , pages
          <fpage>231</fpage>
          -
          <lpage>236</lpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>A.</given-names>
            <surname>Bruns</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Burgess</surname>
          </string-name>
          .
          <article-title>Researching news discussion on twitter: New methodologies</article-title>
          .
          <source>Journalism Studies</source>
          ,
          <volume>13</volume>
          (
          <issue>5-6</issue>
          ):
          <fpage>801</fpage>
          -
          <lpage>814</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>E.</given-names>
            <surname>Diaz-Aviles</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Drumond</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Schmidt-Thieme</surname>
          </string-name>
          , and
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          .
          <article-title>Real-time top-n recommendation in social streams</article-title>
          .
          <source>In Proceedings of the sixth ACM conference on Recommender systems</source>
          , pages
          <fpage>59</fpage>
          -
          <lpage>66</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>Y.</given-names>
            <surname>Duan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Jiang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Qin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , and
          <string-name>
            <given-names>H.-Y.</given-names>
            <surname>Shum</surname>
          </string-name>
          .
          <article-title>An empirical study on learning to rank of tweets</article-title>
          .
          <source>In Proceedings of the 23rd International Conference on Computational Linguistics</source>
          , pages
          <fpage>295</fpage>
          -
          <lpage>303</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>M.</given-names>
            <surname>Elahi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>F.</given-names>
            <surname>Ricci</surname>
          </string-name>
          , and
          <string-name>
            <given-names>N.</given-names>
            <surname>Rubens</surname>
          </string-name>
          .
          <article-title>Active learning in collaborative filtering recommender systems</article-title>
          .
          <source>In E-Commerce and Web Technologies</source>
          , pages
          <fpage>113</fpage>
          -
          <lpage>124</lpage>
          .
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A.</given-names>
            <surname>Gupta</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Kumaraguru</surname>
          </string-name>
          .
          <article-title>Credibility ranking of tweets during high impact events</article-title>
          .
          <source>In Proceedings of the 1st Workshop on Privacy and Security in Online Social Media, page 2</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>D.</given-names>
            <surname>Li</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Luo</surname>
          </string-name>
          , and
          <string-name>
            <surname>X. Zhang.</surname>
          </string-name>
          <article-title>Selecting training data for learning-based twitter search</article-title>
          .
          <source>In Advances in Information Retrieval</source>
          , pages
          <fpage>501</fpage>
          -
          <lpage>506</lpage>
          .
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J.</given-names>
            <surname>Lin</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Efron</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Wang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Sherman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Voorhees</surname>
          </string-name>
          .
          <article-title>Overview of the TREC-2015 microblog track</article-title>
          .
          <source>In Proceedings of the TREC</source>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>F.</given-names>
            <surname>Martins</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          <article-title>Magalh˜aes, and</article-title>
          <string-name>
            <given-names>J.</given-names>
            <surname>Callan</surname>
          </string-name>
          .
          <article-title>Barbara made the news: mining the behavior of crowds for time-aware learning to rank</article-title>
          .
          <source>In Proceedings of the Ninth ACM International Conference on Web Search and Data Mining</source>
          , pages
          <fpage>667</fpage>
          -
          <lpage>676</lpage>
          ,
          <year>2016</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M. G.</given-names>
            <surname>Rodriguez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Gummadi</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Schoelkopf</surname>
          </string-name>
          .
          <article-title>Quantifying information overload in social media and its impact on social contagions</article-title>
          .
          <source>arXiv preprint arXiv:1403.6838</source>
          ,
          <year>2014</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>N.</given-names>
            <surname>Rubens</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kaplan</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sugiyama</surname>
          </string-name>
          .
          <article-title>Active learning in recommender systems</article-title>
          .
          <source>In Recommender systems handbook</source>
          , pages
          <fpage>735</fpage>
          -
          <lpage>767</lpage>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>G.</given-names>
            <surname>Shani</surname>
          </string-name>
          and
          <string-name>
            <given-names>A.</given-names>
            <surname>Gunawardana</surname>
          </string-name>
          .
          <article-title>Evaluating recommendation systems</article-title>
          .
          <source>In Recommender systems handbook</source>
          , pages
          <fpage>257</fpage>
          -
          <lpage>297</lpage>
          .
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>C.</given-names>
            <surname>Zhai</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Lafferty</surname>
          </string-name>
          .
          <article-title>A study of smoothing methods for language models applied to information retrieval</article-title>
          .
          <source>ACM Transactions on Information Systems (TOIS)</source>
          ,
          <volume>22</volume>
          (
          <issue>2</issue>
          ):
          <fpage>179</fpage>
          -
          <lpage>214</lpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>X.</given-names>
            <surname>Zhang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>He</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Luo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Li</surname>
          </string-name>
          .
          <article-title>Query-biased learning to rank for real-time twitter search</article-title>
          .
          <source>In Proceedings of the 21st ACM international conference on Information and knowledge management</source>
          , pages
          <fpage>1915</fpage>
          -
          <lpage>1919</lpage>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>