<!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>Exploiting Social Ties for Search and Recommendation in Online Social Networks - Challenges and Chances</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Kerstin Bischoff</string-name>
          <email>bischoff@L3S.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>L3S Research Center / Universität Hannover Appelstrasse 4 30167 Hannover</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2010</year>
      </pub-date>
      <abstract>
        <p>Online social networking is a huge trend. On Facebook or MySpace people connect with their friends or make new friends. They form new (indirect) connections by reading and adopting from other peoples' blogs or tweets. Similarly, in tagging systems like Delicious or Flickr people share tagged resources with friends or unknown, similar users. Ofine social networks have long been studied in sociology, epidemiology, etc. However, the new online networks o er new ways to revisit old theories as well as to nd emerging trends with respect to information di usion and sharing in the Web 2.0. The goal is to explore and exploit relational ties in a way to enable the mining of useful knowledge and e ective information propagation/di usion. Assuming no or only potential ties explicitly given, the focus is rst on the analysis of collaborative tagging and its potentials for user pro ling, recommendations and search. Some rst related studies, approaches and ideas for future work address the identi cation and exploitation of weak and strong ties in online networks.</p>
      </abstract>
      <kwd-group>
        <kwd>eol&gt;social network analysis</kwd>
        <kwd>social ties</kwd>
        <kwd>collaborative tagging</kwd>
        <kwd>search</kwd>
        <kwd>recommendation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        With the advent of the Web 2.0 online social networking has
become a huge trend. On platforms like Facebook or
MySpace people connect with their friends or make new friends.
They form new (indirect) connections by reading and
adopting from other peoples' blogs or tweets. Similarly, in
collaborative tagging systems like Last.fm, Delicious or Flickr
people share bookmarks and tagged resources with friends
or unknown, similar users. Reasons are manifold: staying in
touch, socializing, nding answers/experts, share resources
and knowledge, etc. O ine social networks have long been
studied under the perspective of sociology, epidemiology,
and even thermodynamics. However, online networks o er
new ways to revisit old theories as well as to nd emerging
trends in information di usion and sharing in the Web. For
search and recommendation, the topic of tie strength is
interesting. In `real' social networks, strong (i.e. family, close
friends) and weak ties (loose acquaintances) have been found
to show di erent characteristics e.g. with respect to services
o ered (see section 3). As McAfee [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ] pointed out, di erent
kinds of ties, if supported by the right technology, may
offer di erent potential bene ts for information exchange and
collaboration (adapted from [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]):
      </p>
      <sec id="sec-1-1">
        <title>Strong ties: Collaboration in a closed group, e.g. coworkers (BSCW, CVS, Wikis)</title>
      </sec>
      <sec id="sec-1-2">
        <title>Weak ties: Innovation, Non-redundant information, Network bridging (Email, Social networking systems)</title>
      </sec>
      <sec id="sec-1-3">
        <title>Potential ties: E cient search, Tie formation (Blogo</title>
        <p>
          sphere, Bulletin boards, Folksonomies)
The goal is to explore and exploit relational ties in a way to
enable the mining of useful knowledge and e ective
information propagation/di usion so that people are provided the
information they need. Focusing on absent, potential and
weak ties, we will present rst research results, algorithms
and ideas for future work. To better understand
`collective intelligence' expressed via tags, i.e. statistical patterns
found in folksonomies, we start by describing an analysis
of di erent tagging systems and summarize some
experiments on how to exploit social annotations to enrich
metadata for multimedia resources. Web 2.0 tools and
environments like the personalized Internet radio and social music
network Last.fm1 have made collaborative tagging so
popular: any user can assign freely selected words, in the form
of keywords or category labels, to shared content { thereby
describing and organizing these resources. As a result, a
huge amount of manually created metadata describing all
kinds of resources as well as user interests is now available.
Such semantically rich user generated annotations are
especially valuable for recommending, searching and browsing
multimedia resources, such as music, where these metadata
enable retrieval on the newly available textual descriptions
represented by tags. However users' motivations for tagging
resources, as well as the types of tags di er across systems.
These tags represent quite a few di erent aspects of the
resources they describe [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ] and more research is needed on how
these tags or subsets of them can be used e ectively for user
pro ling and search in social networks. Weak and strong ties
and the corresponding topics of information di usion and
social search are considered next. Weak ties are often `bridges'
connecting di erent communities, thus bringing new
information (e.g. job seeking). Strong ties o er mutual support,
trust, but likely share knowledge, preferences, values and
friends. The section will cover the related issues of
identifying tie strength or characterizing friendship relations in
online networks. It introduces recent ideas to analyze and
exploit such networks to improve common approaches to
search and recommendation.
        </p>
      </sec>
    </sec>
    <sec id="sec-2">
      <title>2. TAGS FOR USER PROFILING, SEARCH</title>
    </sec>
    <sec id="sec-3">
      <title>AND RECOMMENDATIONS</title>
      <p>As they o er a promising way to estimate similarity between
resources, users and resources or between di erent users,
the usefulness and reliability of tags is important for many
search and recommendation algorithms. In the rst section
the focus will be on analyzing tag usage patterns and their
implications for user pro ling, search and recommendation.
Then, we will present approaches exploiting tags to enrich
resources or user pro les with additional information { music
moods and themes as well as picture moods.</p>
    </sec>
    <sec id="sec-4">
      <title>2.1 Usefulness of tags for profiling and search</title>
      <p>
        Here we present results of an in-depth study [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] of tagging for
di erent kinds of resources and systems { Web pages
(Delicious), music (Last.fm) and images (Flickr ). Tags serve
various functions based on system features like resource type,
tagging rights, etc. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ], and not all these tags are equally
useful for user pro ling or for interpersonal retrieval. For
being able to improve tag based user pro ling and search,
we rst need to know how tags are used and which types of
annotations we can expect to nd along with resources. [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]
identi es organizational motivations for tagging, other more
social motivations include opinion expression, attraction of
attention, and self-presentation.
      </p>
      <p>Our analysis revealed the necessity and usefulness of a
common tag classi cation scheme for di erent collections, which
allows the comparison of the types of tags used in di erent
tagging environments. For example, the distributions of tag
types strongly depend on the resources they annotate: for
Flickr and Delicious the most frequently used tags (50% of
the cases) refer to topic concepts (i.e. what the resource is
about), while for Last.fm, type-related tags (e.g. genres) are
the most prominent ones. Other interesting results of this
analysis refer to the added value of tags to existing content:
More than 50% of existing tags bring new information to the
resources they annotate. For the music domain this is even
the case for 98.5% of the tags. Especially for multimedia
data, such as music, pictures or videos, the gain provided
by the newly available textual information is substantial,
since with most prominent search engines on the Web, users
are currently still constrained to search for multimedia using
textual queries. A large amount of tags is also accurate and
reliable; in the music domain for example 73.01% of the tags
also occur in online music reviews written by experts.
Regarding search, our studies showed that most of the tags
can be used for search and that in most cases tagging
behavior exhibits approximately the same characteristics as
searching behavior. However, some noteworthy di erences
have also been observed. Namely, for the music domain, the
usage context (i.e. situation suitable for listening to a
particular song { e.g. \pool party") is very useful for search, yet
underrepresented in the tagging material. Similar, for
pictures and music opinions or qualities (e.g. characteristics,
moods) queries occur quite often, although people tend to
neglect this category for tagging. Clearly, supporting and
motivating tags within these categories could provide
additional information valuable for search.</p>
    </sec>
    <sec id="sec-5">
      <title>2.2 Knowledge mining from tags</title>
      <p>
        Our analysis [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ] showed some clear gap between the tagging
and the querying vocabulary for music as well as pictures.
For pictures, a large portion of tags refer to location
information. However, queries targeting images much more
often name subjective aspects, e.g. \scary", \rage" or \funny".
For music, tags predominantly name the genre (i.e. type),
though when searching for music, the majority of queries
falls into these categories: 30% of the queries are
themerelated, 15% target mood information. In this section we
will shortly present an approach for detecting moods and
themes for songs [
        <xref ref-type="bibr" rid="ref2 ref3 ref5">2, 3, 5</xref>
        ] and emotions in photos [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. It relies
on collaborative tagging and aims at bridging exactly this
gap identi ed. The methods proposed can be used in various
ways: as part of an application where the recommendations
are presented to the user for selection, for indexing and thus
enriching the metadata indexes to improve searchability, or
to automatically create mood-based picture catalogs.
      </p>
      <sec id="sec-5-1">
        <title>2.2.1 Datasets</title>
        <p>
          For our experiments we gathered data from several sources
(for details please refer to [
          <xref ref-type="bibr" rid="ref3 ref4">3, 4</xref>
          ]):
        </p>
        <sec id="sec-5-1-1">
          <title>From the Allmusic.com website we collected the labels of 178 di erent moods and 73 themes together with music tracks that fall into these categories.</title>
        </sec>
        <sec id="sec-5-1-2">
          <title>For 13,948 songs obtained from Allmusic.com, we could get user tags from the social music platform Last.fm.</title>
        </sec>
        <sec id="sec-5-1-3">
          <title>To investigate whether lyrics can provide added value</title>
          <p>in the task of mood and theme recommendation, we
also obtained the lyrics for our tracks from
lyricsdownload.com and lyricsmode.com.</p>
          <p>
            For the purpose of deriving mood labels for pictures,
we manually selected Flickr groups that correspond
to the emotion/mood labels in the hierarchy of
human emotions presented in [
            <xref ref-type="bibr" rid="ref25">25</xref>
            ]. The taxonomy
comprises the six primary emotions \Love", \Joy",
\Surprise", \Anger", \Sadness", and \Fear", each of which
has more ne-grained secondary emotions. We found
corresponding Flickr groups for 17 out of the 25
secondary emotions, including the six primary emotion
labels. For all pictures in the identi ed groups we
downloaded all associated user tags from Flickr.
          </p>
        </sec>
      </sec>
      <sec id="sec-5-2">
        <title>2.2.2 Picture Mood Recommendation Algorithm</title>
        <p>The assumption on which we base our recommendation is
that the existing tags attached to music songs or photos
can possibly provide information regarding the
corresponding mood (or theme). The user given tags are used as
input features for training a classi er over all mood or theme
classes. Here we also make use of the Weka2 implementation
for the Nave Bayes Multinomial classi er, which produces
for all pictures in the test set probability distributions over
all classes of moods. For music, training and evaluation is
done using the Allmusic.com ground truth, created
manually by music experts. All distinct tags span the feature
vector of a song, weighted by the frequency with which the
tag occurred for a song. Similarly, all pictures pertaining
to a speci c mood class (i.e. social group on Flickr )
represent the positive training examples, while pictures taken
randomly from the rest of the classes build up the set of
negative examples. The number of positive and negative
examples for a class was equally balanced. In order to ensure a
fair classi cation of the data, here all tags related to a mood
or emotion were deleted using WordNet synset information.</p>
      </sec>
      <sec id="sec-5-3">
        <title>2.2.3 Experiments and Results</title>
        <p>
          Music. Di erent experimental runs were performed using
either tags, lyrics, or both plus varying classes to be
predicted. Since the 178 mood terms from Allmusic.com are
hardly distinguishable for a non-expert, these labels were
manually mapped to the hierarchy of basic human primary
and secondary emotions (see 2.2.1). This resulted in 22
secondary mood terms and six primary classes. For themes,
the eleven classes were reduced to nine by applying a
WordNet based clustering accounting for word overlap in synsets.
The best performing methods are those using tags as input
features, while classi cation based on lyrics performs worst.
Combining tags and lyrics achieves good results, sometimes
even slightly outperforms tag-based method. While
incorporating lyrics features led to good results for genre [
          <xref ref-type="bibr" rid="ref3">3</xref>
          ], they do
not seem to be indicative of the mood of a song. For themes,
there is a slight, yet rarely signi cant, e ect. For the case
of theme recommendations, given the original eleven themes
we achieve a H@3 of 0.80 based on tags and lyrics. The best
results, H@3 of 0.88, are achieved for the algorithm using
a combination of tags and lyrics as features and applying a
WordNet synonymy based clustering on the theme classes.
Compared to themes, mood recommendations do not
perform as well when using many classes, achieving only a H@3
of 0.64 for the manually clustered 22 secondary emotions.
Reducing the number of clusters to the 6 rst level classes
of basic human emotions boosts the performance
considerably and for the best method using tags and lyrics as input
features we achieve a H@3 value of 0.89. Micro-evaluating
results per speci c class, shows that some classes are
relatively easy to recommend. Others may require special
attention or some level of disambiguation. In general, those class
labels that are harder to recommend appear more ambiguous
with the corresponding annotations being mostly subjective.
2http://www.cs.waikato.ac.nz/ ml/weka/
Themes like \Late Night" or \Summertime" strongly depend
on each person's individual associations.
        </p>
        <p>Pictures. A rst set of experiments aimed at
recommending mood labels corresponding to the primary human
emotions. In this case, the classes to be learned by the
classiers consisted of the union of all data belonging to all
underlying secondary emotions (e.g. the Love class comprises all
data gathered from the Flickr groups for A ection, Lust and
Longing). For the experimental runs on secondary emotion
label recommendations, each secondary emotion class
represented a class to be learned. We perform a 10-fold cross
validation and evaluate the performance of our method
according to standard IR metrics. All recommendations
corresponding to the primary human emotions achieved very high
quality, with a value close to 1 for H@3 and even a H@1
between 0.61 and 0.91 - they clearly outperform a baseline
random classi er. We also compute the overall performance
over all primary emotion classes, as averages weighted by
the number of instances corresponding to each class. The
results are very good, with a value of 0.97 for H@3 and 0.93
for M RR. For primary emotions, correlation between class
size and performance is medium: Pearson's r is 0.45 for H@3
and 0.63 for H@1, RP , and M RR. Thus, when
misclassifying instances the classi er is biased to incorrectly assigning
one of the two dominant classes \Fear" or \Sadness". The
overall weighted results for the secondary human emotion
label recommendations are almost identical with the case of
primary emotions. Again, we nd a classi er bias towards
popular classes, correlation between a priori probability of
a class and performance is smaller for secondary emotions
(Pearson's r is between 0.32 and 0.37 for the di erent
evaluation measures). Looking at the di erent mood classes
individually, six out of 17 achieve 0.88 or higher for H@1
and 0.93 or more for H@3. For four moods, \A ection",
\Zest", \Irritation" and \Lust", performance is considerably
lower with H@3 ranging from 0.18 to 0.52. The main reason
is the relatively small number of pictures contained in each
of these groups, which made learning more di cult.
Compared to the music mood and theme recommendations,
inference of moods/emotions for picture resources is of higher
quality. This is probably due to the data which was used as
ground truth: mood-related Flickr groups, manually created
by users. The ground truth gathered from AllMusic.com
had to be mapped to the hierarchy of human emotions to
reduce the extremely high number of classes. This process
potentially introduces some noise into the data. The results
con rm once more the hypothesis on which we based our
recommendation approach: existing tags can give good
indications regarding the corresponding moods of the pictures/
moods and themes of music songs.</p>
      </sec>
    </sec>
    <sec id="sec-6">
      <title>3. SEARCH AND RECOMMENDATIONS</title>
    </sec>
    <sec id="sec-7">
      <title>IN SOCIAL NETWORKS</title>
      <p>
        From sociology as well as social network analysis as a
discipline in its own right quite some descriptive statistics and
generative models have become popular to characterize
social networks. Well-known is that weak ties often act as
bridges and thus hold potential for new information and the
generation of creative ideas, job o ers (e.g. [
        <xref ref-type="bibr" rid="ref10 ref6">6, 10</xref>
        ]). On the
other hand, strong ties o er support and trust (e.g. see [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ])
and show tendencies for homophily and transitivity [
        <xref ref-type="bibr" rid="ref20 ref9">20, 9</xref>
        ].
This means they likely share knowledge, preferences, values
and friends. While many `real-world' studies had to cope
with design issues (amount of data, retrospective informant
accuracy, etc.), online networks o er huge and interesting
datasets to work with. With respect to exploiting online
social connections for search and recommendation, two broad
areas need to be studied:
      </p>
      <sec id="sec-7-1">
        <title>How can ties be modeled based on implicit and explicit</title>
        <p>indicators found in online social networks? How can
these ties be characterized? Do we nd homophily and
heterophily as expected from o ine social relations?
How do these ties evolve over time?</p>
      </sec>
      <sec id="sec-7-2">
        <title>How useful are weak and strong ties in search and</title>
        <p>recommendation (information propagation)? How can
they be incorporated to show their potential bene t in
information systems (e.g. diversity/non-redundancy)?
Are there restrictions by contexts or domains?
We address related work, open issues for both topics in the
following sections to then conclude with planed future work.</p>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>3.1 Inferring and characterizing tie strength</title>
      <p>
        In sociological theory, an impressive amount of work has
been done regarding the measurement of tie strength. A lot
of reliable indicators have been identi ed, e.g. interaction
frequency, duration, intimacy (e.g. [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]), etc. ([
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] for a quick
overview). Kahanda and Neville [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ] recently presented a
machine learning approach to automatically identify strong
friends. The authors formulated a link strength prediction
task: For each friend pair (u,v) given their user pro le
attributes like age, gender, etc., their interactions (writing on
the friend's wall, tagging a photo), and network
information (e.g. number of mutual friends) a supervised learning
method decides whether they are \top friends". Evaluation
on data from the public Purdue Facebook network, where
users can nominate best friends within the \Top friends"
application, showed that with an AUC of 87% best friends
can be successfully distinguised from weak ties. Those best
classi cation results were achieved on network-transactional
features (i.e., moderate transactional activity like wall posts
by interactions with other users).Thus, user interactions are
highly predictive, but it is also necessary to consider such
transactional events in the context of user behavior within
the larger social network. Surprisingly, attribute similarity
features lead to classi cation results close to a random
classi er, indicating that the homophily assumption does not
hold for this Facebook network or the important attributes
are not available in Facebook.
      </p>
      <p>
        In a similar work, Gilbert and Karahalios [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] predict tie
strength as a linear combination of 74 Facebook variables
(e.g. last comment, num friends, wall words). Besides
comparable results, a mapping of (sociological) dimensions to
the di erent variables is provided enabling generalization of
the approach. In [
        <xref ref-type="bibr" rid="ref27">27</xref>
        ], Yamamoto &amp; Matsumura analyzed
optimal heterophily between senders and receivers in terms
of blogging in uence (tracked via re-occurring terms and
links) and domain knowledge. They found that the
majority of pairs favor small heterophily, in particular people
most often adopt topics or products when the sender is just
slightly more in uential.
      </p>
    </sec>
    <sec id="sec-9">
      <title>3.2 Approaches exploiting ties</title>
      <p>
        Approaches for e ciently searching and propagating
information in online communities build strongly upon methods
developed in social networks analysis. Real networks like the
WWW, the Internet, spreading of diseases/epidemics,
social, biological and linguistic networks have so far been
studied mostly with respect to structure. Graph theoretic
measures like density, indegrees, outdegrees, centrality,
diameter, (structural) cohesion, etc. indicate the potentials and
bottlenecks of a network. As an example, one experimental
nding recently receiving a lot of attention is the
`smallworld phenomenon' (also `6 degrees of separation')[
        <xref ref-type="bibr" rid="ref10 ref14">14, 10</xref>
        ].
While early works investigated patterns of communication in
small, closed groups, recent work analyzed communication
ows in huge social networks e.g. based on mobile phone calls
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], instant messaging [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], or the cascading propagation of
information through the blogosphere [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. In their studies,
[
        <xref ref-type="bibr" rid="ref21">21</xref>
        ] found that weak ties are crucial for the structural
integrity of the network. Strong ties, on the other hand, are
important for sustaining local groups/cliques. Concerning
information propagation both types of connections are not
su cient, the rst due to infrequent, rare contact, the
latter due to being bound to their local groups. Epidemic or
gossip-based algorithms adapt such established patterns to
enable e cient spread of information for distributed
computing or in Peer-2-Peer systems [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
      </p>
      <p>
        Similarly, social search and recommendation algorithms try
to exploit the communication and interaction patterns found
in social networks as well as, for example, the trust and
similarity typical for strong ties. Referral Web is a rst
approach to integrate social networks and Collaborative
Filtering (CF) [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Here, a social network was constructed
from cooccurring names in the WWW, for example, links
on a home page or co-authorship. Queries that can be
answered based on this network have the form \which
connection do I have to XY" or \documents about databases by
people close to XY". [
        <xref ref-type="bibr" rid="ref26">26</xref>
        ] models real-world information ows
in order to give recommendations and rank users according
to in uence based on the usage of certain communications
paths. For this, di usion rate between users is computed
based on access time/order to the same documents. The
automatic evaluation shows that standard CF algorithms
can be outperformed in accuracy by up to 80%. Moreover,
the underlying social network can be used to overcome the
sparsity/missing data problem, for example, by applying
factor analysis on the user-item-matrix enriched with explicit
user connections [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ]. For personalized recommendations of
new posts concerning some news item, [
        <xref ref-type="bibr" rid="ref24">24</xref>
        ] extend their CF
recommender system in a way that strong social network
ties (here: members of a thematic group) indicate a high
value of a post with respect to completeness and simplicity.
Weak ties, in contrast, imply diversity of opinions. From
ratings given to posts the system learns a user's preference
regarding completeness and diversity, to which
recommendations are adapted. [
        <xref ref-type="bibr" rid="ref23">23</xref>
        ] presents a framework for social
search and recommendation that integrates classical CF
attributes for users and resources with an ontology and social
connectivity (explicit friendship or `spiritual', i.e. similar
interests modeled via tags) within a scoring model. A small
evaluation study shows that `spiritual' connections in
particular improve search results signi cantly, but not for all
kinds of queries. Social query expansion by tags used by
friends, however, did not lead to improved performance. In
a related work, [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ] demonstrated that social search,
implemented as search among all friends having used a query term
as tag before, possibly combined with an authority score for
users can yield the best precision for search in Flickr. Also
for e ciently searching inside collaborative tagging networks
like Delicious incorporating social connections between users
and between tags proved useful. A top-k algorithm
combined with dynamic tag expansion and dynamically
extending search over socially connected users can answer queries
considerably faster than traditional approaches [
        <xref ref-type="bibr" rid="ref22">22</xref>
        ].
      </p>
    </sec>
    <sec id="sec-10">
      <title>4. CONCLUSIONS &amp; FUTURE WORK</title>
      <p>Online social networks o er great data to analyze and
experiment with for enhancing user pro ling, search and
recommendation. The concept of tie strength seems a promising
framework for identifying the diverse potentials di erent
online social relations can bring. First, collaborative tagging
provides reliable, non-redundant and interpersonally
valuable metadata, that can be used to enhance searchability
of resources as well as estimate user-user or user-item
similarities. For this, no explicit friendship relationships have
to be given. The results of our comparative tagging
analysis provide more insight into the use of di erent kinds of
tags for improving search. With respect to weak and strong
ties, more research is needed on how to model ties based
on explicit or implicit (e.g. tags) indicators. We plan to
conduct experiments on learning tie strength and
exploiting it for search and recommendation within other kinds of
social networks, e.g. the music platform Last.fm. For
different domains, system designs and available transactional
data, results may deviate from the previous studies. So far,
there are still no unambiguous results regarding homophily
in recent online networks. Characterizing the relationships
people form online and studying how these relations (or their
attributes like taste pro le similarity) evolve over time are
important to assess the value of ties for improving search and
recommendations. Applying standard social network
analysis procedures on the new large datasets will also shed
additional light on larger community structures around strong
and weak ties in general. More importantly, few work has
been done so far on how to incorporate tie strength into
information retrieval and recommendation. First experiments
will use tie strength within the similarity computation of
users (to users and items). Information di usion within
personal networks will be studied and a model derived on which
social recommendations can be build.</p>
    </sec>
    <sec id="sec-11">
      <title>5. ACKNOWLEDGMENTS</title>
      <p>This work was partially supported by the GLOCAL project
funded by the European Commission (Contract No. 248984).</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>M.</given-names>
            <surname>Bender</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Crecelius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kacimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. X.</given-names>
            <surname>Parreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Weikum</surname>
          </string-name>
          .
          <article-title>Exploiting social relations for query expansion and result ranking</article-title>
          .
          <source>In Proceedings ICDEW</source>
          <year>2008</year>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bischo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Firan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Paiu</surname>
          </string-name>
          .
          <article-title>Can all tags be used for search?</article-title>
          <source>In Proceedings CIKM</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bischo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Firan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Paiu</surname>
          </string-name>
          .
          <article-title>How do you feel about \dancing queen"?: deriving mood &amp; theme annotations from user tags</article-title>
          .
          <source>In Proceedings JCDL</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bischo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Firan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Paiu</surname>
          </string-name>
          .
          <article-title>Bridging the gap between tagging and querying vocabularies: Analyses and applications for enhancing multimedia ir</article-title>
          .
          <source>Journal of Web Semantics</source>
          , Special Issue on \
          <article-title>Bridging the Gap" - Data Mining and Social Network Analysis for Integrating Semantic Web and Web 2</article-title>
          .0,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>K.</given-names>
            <surname>Bischo</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C. S.</given-names>
            <surname>Firan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Paiu</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Nejdl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Laurier</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Sordo</surname>
          </string-name>
          .
          <article-title>Music mood and theme classi cation - a hybrid approach</article-title>
          .
          <source>In Proceedings ISMIR</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>R. S.</given-names>
            <surname>Burt</surname>
          </string-name>
          .
          <article-title>Structural holes and good ideas</article-title>
          .
          <source>American Journal of Sociology</source>
          ,
          <volume>110</volume>
          :
          <fpage>349</fpage>
          {
          <fpage>399</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>A.</given-names>
            <surname>Demers</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Greene</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Hauser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            <surname>Irish</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Larson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Shenker</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Sturgis</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Swinehart</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Terry</surname>
          </string-name>
          .
          <article-title>Epidemic algorithms for replicated database maintenance</article-title>
          .
          <source>In Proceedings PODC '87</source>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>E.</given-names>
            <surname>Gilbert</surname>
          </string-name>
          and
          <string-name>
            <given-names>K.</given-names>
            <surname>Karahalios</surname>
          </string-name>
          .
          <article-title>Predicting tie strength with social media</article-title>
          .
          <source>In Proceedings CHI</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>M.</given-names>
            <surname>Granovetter</surname>
          </string-name>
          .
          <article-title>The strength of weak ties</article-title>
          .
          <source>The American Journal of Sociology</source>
          ,
          <volume>78</volume>
          :
          <fpage>1360</fpage>
          {
          <fpage>1380</fpage>
          ,
          <year>1973</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Granovetter</surname>
          </string-name>
          .
          <article-title>The strength of weak ties: a network theory revisited</article-title>
          .
          <source>Sociological Theory</source>
          ,
          <volume>1</volume>
          :
          <fpage>201</fpage>
          {
          <fpage>233</fpage>
          ,
          <year>1983</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>D.</given-names>
            <surname>Gruhl</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Guha</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Liben-Nowell</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.</given-names>
            <surname>Tomkins</surname>
          </string-name>
          .
          <article-title>Information di usion through blogspace</article-title>
          .
          <source>In Proceedings WWW</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>I.</given-names>
            <surname>Kahanda</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Neville</surname>
          </string-name>
          .
          <article-title>Using transactional information to predict link strength in online social networks</article-title>
          .
          <source>In Proceedings ICWSM</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>H.</given-names>
            <surname>Kautz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Selman</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Shah</surname>
          </string-name>
          .
          <article-title>Referral web: combining social networks and collaborative ltering</article-title>
          .
          <source>Communications of the ACM</source>
          ,
          <volume>40</volume>
          (
          <issue>3</issue>
          ):
          <volume>63</volume>
          {
          <fpage>65</fpage>
          ,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>J.</given-names>
            <surname>Leskovec</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Horvitz</surname>
          </string-name>
          .
          <article-title>Planetary-scale views on a large instant-messaging network</article-title>
          .
          <source>In Proceedings WWW</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>D. Z.</given-names>
            <surname>Levin</surname>
          </string-name>
          and
          <string-name>
            <given-names>R.</given-names>
            <surname>Cross</surname>
          </string-name>
          .
          <article-title>The strength of weak ties you can trust: The mediating role of trust in e ective knowledge transfer</article-title>
          .
          <source>Management Science</source>
          ,
          <volume>50</volume>
          (
          <issue>11</issue>
          ):
          <volume>1477</volume>
          {
          <fpage>1490</fpage>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>H.</given-names>
            <surname>Yang</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. King.</surname>
          </string-name>
          <article-title>Sorec: social recommendation using probabilistic matrix factorization</article-title>
          .
          <source>In Proceedings CIKM</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>C.</given-names>
            <surname>Marlow</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Naaman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Boyd</surname>
          </string-name>
          , and
          <string-name>
            <given-names>M.</given-names>
            <surname>Davis</surname>
          </string-name>
          . Ht06, tagging paper, taxonomy, ickr, academic article, to read.
          <source>In Proceedings HYPERTEXT</source>
          ,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          [18]
          <string-name>
            <given-names>P. V.</given-names>
            <surname>Marsden</surname>
          </string-name>
          and
          <string-name>
            <given-names>K. E.</given-names>
            <surname>Campbell</surname>
          </string-name>
          .
          <article-title>Measuring tie strength</article-title>
          .
          <source>Social Forces</source>
          ,
          <volume>63</volume>
          (
          <issue>2</issue>
          ):
          <volume>482</volume>
          {
          <fpage>501</fpage>
          ,
          <year>1984</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          [19]
          <string-name>
            <given-names>A.</given-names>
            <surname>McAfee</surname>
          </string-name>
          .
          <article-title>How to hit the enterprise 2.0 bullseye</article-title>
          . online: http://andrewmcafee.org/
          <year>2007</year>
          /11/ how to hit
          <source>the enterprise 20 bullseye/</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          [20]
          <string-name>
            <surname>M. McPherson</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <string-name>
            <surname>Smith-Lovin</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Cook</surname>
          </string-name>
          .
          <article-title>Birds of a feather: Homophily in social networks</article-title>
          .
          <source>Annual Review of Sociology</source>
          ,
          <volume>27</volume>
          :
          <fpage>415</fpage>
          {
          <fpage>444</fpage>
          ,
          <year>2001</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          [21]
          <string-name>
            <given-names>J.-P.</given-names>
            <surname>Onnela</surname>
          </string-name>
          , J. Saramaki, J. Hyvonen, G. Szabo,
          <string-name>
            <given-names>D.</given-names>
            <surname>Lazer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Kaski</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kertesz</surname>
          </string-name>
          ,
          <article-title>and</article-title>
          <string-name>
            <given-names>A.-L.</given-names>
            <surname>Barabasi</surname>
          </string-name>
          .
          <article-title>Structure and tie strengths in mobile communication networks</article-title>
          .
          <source>Proc. Natl. Acad. Sci.</source>
          ,
          <volume>104</volume>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref22">
        <mixed-citation>
          [22]
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Crecelius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kacimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. X.</given-names>
            <surname>Parreira</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Weikum</surname>
          </string-name>
          .
          <article-title>E cient top-k querying over social-tagging networks</article-title>
          .
          <source>In Proceedings SIGIR</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref23">
        <mixed-citation>
          [23]
          <string-name>
            <given-names>R.</given-names>
            <surname>Schenkel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Crecelius</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Kacimi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>T.</given-names>
            <surname>Neumann</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. X.</given-names>
            <surname>Parreira</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Spaniol</surname>
          </string-name>
          , and
          <string-name>
            <given-names>G.</given-names>
            <surname>Weikum</surname>
          </string-name>
          .
          <article-title>Social wisdom for search and recommendation</article-title>
          .
          <source>IEEE Data Eng. Bull.</source>
          ,
          <volume>31</volume>
          (
          <issue>2</issue>
          ):
          <volume>40</volume>
          {
          <fpage>49</fpage>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref24">
        <mixed-citation>
          [24]
          <string-name>
            <given-names>A.</given-names>
            <surname>Seth</surname>
          </string-name>
          and
          <string-name>
            <surname>J. Zhang.</surname>
          </string-name>
          <article-title>A social network based approach to personalized recommendation of participatory media content</article-title>
          .
          <source>In Proceedings ICWSM</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref25">
        <mixed-citation>
          [25]
          <string-name>
            <given-names>P.</given-names>
            <surname>Shaver</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schwartz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Kirson</surname>
          </string-name>
          , and
          <string-name>
            <surname>C. O'Connor.</surname>
          </string-name>
          <article-title>Emotion knowledge: Further exploration of a prototype approach</article-title>
          .
          <source>Journal of Personality and Social Psychology</source>
          ,
          <volume>52</volume>
          (
          <issue>6</issue>
          ):
          <volume>1061</volume>
          {
          <fpage>1086</fpage>
          ,
          <year>1987</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref26">
        <mixed-citation>
          [26]
          <string-name>
            <given-names>X.</given-names>
            <surname>Song</surname>
          </string-name>
          ,
          <string-name>
            <given-names>Y.</given-names>
            <surname>Chi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            <surname>Hino</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B. L.</given-names>
            <surname>Tseng</surname>
          </string-name>
          .
          <article-title>Information ow modeling based on di usion rate for prediction and ranking</article-title>
          .
          <source>In Proceedings WWW</source>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref27">
        <mixed-citation>
          [27]
          <string-name>
            <given-names>H.</given-names>
            <surname>Yamamoto</surname>
          </string-name>
          and
          <string-name>
            <given-names>N.</given-names>
            <surname>Matsumura</surname>
          </string-name>
          .
          <article-title>Optimal heterophily for word-of-mouth di usion</article-title>
          .
          <source>In Proceedings ICWSM</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>