<!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>An Adaptive Technique for Weighting Multiple Factors in Followee Recommendation Algorithms</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Antonela Tommasel</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniela Godoy</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>ISISTAN Research Institute, CONICET-UNCPBA</institution>
          ,
          <addr-line>Tandil, Buenos Aires</addr-line>
          ,
          <country country="AR">Argentina</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>The accurate suggestion of interesting friends arises as a crucial issue in recommendation systems. This work argues that the criteria for recommending friends (or followees) needs to be adapted and combined according to each user's preferences. A technique is proposed for adapting such criteria to the characteristics of previously selected followees. Experimental evaluation showed that the technique improved the precision of static weighting strategies. Results highlighted the importance of adapting to changes in user preferences over time.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>Then, percentages are used as the similarity weights that will
be further updated according to user preferences.</p>
      <p>Updating Factor Weights. The computed weights are used for
assessing the similarity between each potential followee and
the target user in the recommendation process. The target user
is presented with the set of most similar potential followees.
For each accepted followee, i.e. each potential followee the
target user has accepted or manifested interest in, weights are
updated to reflect the new interests of the target user.
Ranking Recommended Followees. In standard
similaritybased algorithms, as all recommended candidates are similar
to the target user, they are likely to be similar to each other.
Thus, such algorithms will never uncover certain items, which
although less similar to the target user, are also important
[Hurley and Zhang, 2011]. Consequently, it would be desirable to
include novel or diverse items in the recommended list.
Novelty could be introduced to similarity-based algorithms aiming
at balancing both, the relevance of candidate followees (i.e.
its similarity to the target user) and the diversity of
recommendations. Novelty can be measured in terms of the degree
to which is unusual regarding the target user normal interests
(i.e. the previously selected followees). It can be computed
as åi2 f ollowees(u) absj(fSoilmloilwaereitsy((uu);ji) Similarity(u;p f )) , where u represents the
target user, p f represents the potential followee, f ollowees(u)
represents the previously selected users of u and Similarity is the
overall similarity. If previously selected followees are similar
to the target user, and the new potential followee is dissimilar
to the target user, he/she will also be dissimilar to previously
selected followees. The higher the absolute differences, the
higher the dissimilarity, and thus the novelty introduced.
Consequently, the novelty of a potential followee can be assessed
without computing the actual dissimilarity between the
potential followee and each previously selected followee.</p>
      <p>Finally, the potential followees are ranked by considering
the linear combination of relevance and novelty. The weight
of the novelty is computed as the percentage of the previously
selected followees for whom the novelty score was higher than
a pre-defined threshold. Similarly, the weight of the relevance
is computed as the percentage of the previously selected
followees for whom novelty was lower than the threshold. Both
weights are updated as previously described.
4 Experimental Evaluation</p>
      <p>This section presents the experimental evaluation performed
to assess the effectiveness of the proposed technique.
Factors for Followee Recommendation. Although the
presented technique could be applied to any arbitrary number
of recommending factors, this work focuses in the two main
followee recommendation factors: topology and content.</p>
      <p>Topology. Most link prediction algorithms are based on
network topology. The number of common followees is one of the
most common metrics applied to Twitter network. It can be
defined as jGGoouutt ((xx))\[GGoouutt ((yy))j , where x and y are nodes (i.e. users),
kx is the degree of node x, and G(x), Gout (x) and Gin(x) are the set
of neighbours, followees and followers of x , respectively.</p>
      <p>Content. The interest of a user can be characterised
by profiles based not only on the information they create
and publish (publishing profile), but also on the
information they consume (reading profile), for example the retweets.
The publishing profile of user u j is built by considering
all of the user tweets (tweets(u j)), which can be defined as:
pub pro f ile(u j)=tweets(u j). The reading profile of a user u j can
be defined as: read pro f ileRT (u j)=tweetsRT (uk) 8k2 f ollowees(u j). The
similarity between the reading profile of a user and the
publishing profile of their potential followees is assessed using the
cosine similarity.</p>
      <p>Experimental Settings. To evaluate the performance of the
proposed technique, potential followees were ranked and the
top-N users were selected. For each user, their actual
followees and a equal proportion of randomly selected
nonfollowees were added to the pool of potential followees to be
recommended. To simulate the actual behaviour of target users
over time, actual followees were added to the pool of potential
followees in the same order in which the user started following
them.</p>
      <p>The proposed technique (adaptive) was compared against
three static baselines: pure-topology, pure-content and
halftopology-content. Additionally, adaptive was compared to a
version that ignores the novelty factor: adaptive-no-novelty.</p>
      <p>The quality of recommendations was evaluated by selecting
a ranked sub-set of the potential followees and computing the
overall precision immediately after the weights were updated.
As there is no explicit feedback from target users available, the
evaluation assumes that items that were not originally part of
the followee set are uninteresting for the user. This assumption
might not be completely accurate as recommended users might
not be selected simply because the user was unaware of them.
As a result, precision might be underestimated.</p>
      <p>The pool of potential followees comprised 20 users, out of
which 10 were recommended to the user. Factors’ weights
were updated after 10 accepted recommendations. Initially,
the technique assumes that no followee has been selected.
Thus, all factors are assigned equal weights. The minimum
similarity threshold was set to 0:7 for the content-based factor,
and to 0:2 for the topology factor. The novelty threshold was
set to 0:05.</p>
      <p>Dataset. The dataset was obtained by crawling a set of 3,453
target users listing the language account as English, and
having at least 10 followees and 10 published tweets. All user
information was retrieved by means of the TwitterAPI1.
Experimental Results. Figure 1 shows the evolution of the
average recommendation precision for the first 70 weights
updates performed. As regards the baselines, the best results
were achieved when considering the pure-content alternative,
which achieved a precision higher than 0:95, with differences
up to a 58% regarding the worst baseline (pure-topology).
These results indicated that although the majority of the
followee relations were content driven, there were also followee
relations that were not found with a pure content oriented
strategy. Topology-based results further highlighted the fact
that the majority of the followee relations are content driven.</p>
      <p>Regarding the proposed technique, the adaptive-no-novelty
achieved the worst results. As a result, although the
combination of weights is adapted to each user, it is not sufficient
for further improving results. Also, it can be inferred that
although users have a particular preference for a certain type of
followees, they also select followees that do not exactly match
such preferences. Consequently, the search and ranking of
users should not be only guided by similarity, but also by
novelty. Adding novelty (adaptive) improved the best baseline. As
the figure shows, the adaptive alternative was able to achieve
an optimal precision after 26 weights updates. These results
evidenced the importance of recommending both similar and
novel followees. Finally, it is also shown the precision stability
once the preferences of users are learned and adapted.</p>
      <p>Regarding the differences between the weights predicted by
the technique, and the real preferences of the target users),
the absolute differences were below 0:1 for the 76% of target
users, highlighting the usefulness of the proposed technique
not only for adequately capturing users’ interests, but also for
adapting to the changes in user preferences over time.</p>
      <p>In summary, precision of recommendations can be
improved when considering an adaptive technique for defining
the weights of the recommendation factors. Results
emphasised the importance of adapting the relevance or weights of
the factors to changes in user preferences over time, and also
considering diversity in followee recommendations.
5 Conclusions</p>
      <p>This work proposed a technique for adapting the followee
selection criteria to the decisions of each particular user
regarding the characteristics of his/her previously selected
followees. Experimental evaluation showed that the proposed
technique helped to improve precision results regarding static
weighting strategies. Furthermore, results highlighted the
importance of adapting to the changes of the user preferences
over time.</p>
      <p>References</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <source>[Agarwal and Bharadwaj</source>
          , 2013]
          <string-name>
            <given-names>V.</given-names>
            <surname>Agarwal</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. K.</given-names>
            <surname>Bharadwaj</surname>
          </string-name>
          .
          <article-title>A collaborative filtering framework for friends recommendation in social networks based on interaction intensity and adaptive user similarity</article-title>
          .
          <source>Social Netw. Analys. Mining</source>
          ,
          <volume>3</volume>
          (
          <issue>3</issue>
          ):
          <fpage>359</fpage>
          -
          <lpage>379</lpage>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [Armentano et al.,
          <year>2011</year>
          ]
          <string-name>
            <given-names>M.</given-names>
            <surname>Armentano</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Godoy</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Amandi</surname>
          </string-name>
          .
          <article-title>A topology-based approach for followees recommendation in Twitter</article-title>
          .
          <source>In Proceedings of the ITWP at 22nd IJCAI</source>
          , pages
          <fpage>22</fpage>
          -
          <lpage>29</lpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <source>[Garcia and Amatriain</source>
          , 2010]
          <string-name>
            <given-names>R.</given-names>
            <surname>Garcia</surname>
          </string-name>
          and
          <string-name>
            <given-names>X.</given-names>
            <surname>Amatriain</surname>
          </string-name>
          .
          <article-title>Weighted content based methods for recommending connections in online social networks</article-title>
          .
          <source>In Proceedings of the 2nd RSWeb</source>
          , pages
          <fpage>68</fpage>
          -
          <lpage>71</lpage>
          , Barcelona, Spain,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <source>[Golder and Yardi</source>
          , 2010]
          <string-name>
            <given-names>S. A.</given-names>
            <surname>Golder</surname>
          </string-name>
          and
          <string-name>
            <given-names>S.</given-names>
            <surname>Yardi</surname>
          </string-name>
          .
          <article-title>Structural predictors of tie formation in twitter: Transitivity and mutuality</article-title>
          . In Ahmed K. Elmagarmid and Divyakant Agrawal, editors,
          <source>SocialCom/PASSAT</source>
          , pages
          <fpage>88</fpage>
          -
          <lpage>95</lpage>
          . IEEE Computer Society,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Hannon et al.,
          <year>2010</year>
          ]
          <string-name>
            <given-names>J.</given-names>
            <surname>Hannon</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bennett</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Smyth</surname>
          </string-name>
          .
          <article-title>Recommending Twitter users to follow using content and collaborative filtering approaches</article-title>
          .
          <source>In Proceedings of the 4th ACM Conference RecSys</source>
          , pages
          <fpage>199</fpage>
          -
          <lpage>206</lpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <source>[Hurley and Zhang</source>
          , 2011]
          <string-name>
            <given-names>N.</given-names>
            <surname>Hurley</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>Novelty and diversity in top-n recommendation - analysis and evaluation</article-title>
          .
          <source>ACM Trans. Internet Technol</source>
          .,
          <volume>10</volume>
          (
          <issue>4</issue>
          ):
          <volume>14</volume>
          :
          <fpage>1</fpage>
          -
          <lpage>14</lpage>
          :
          <fpage>30</fpage>
          ,
          <string-name>
            <surname>March</surname>
          </string-name>
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>