<!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>A Research Platform for Recommendation within Social Networks</article-title>
      </title-group>
      <contrib-group>
        <aff id="aff0">
          <label>0</label>
          <institution>Amit Sharma Dept. of Computer Science Cornell University Ithaca NY 14853</institution>
          ,
          <country country="US">USA</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Recommendations within a network do a ect, and get affected by, the information ow and the social connections within the network. Thus, designing a network-centric recommender system requires understanding people's preferences, their social connections, as well as the characteristics of the network they inhabit. This creates a major challenge in research on network-centric recommendations|exploring questions around networks and recommendation is hard because they invariably depend on the interaction between more than one user. We describe a research platform that we have built that helps us answer network-centric research questions. We present an overview of the system and demonstrate its usefulness through an example study involving directed suggestions between pairs of participants. As a useful side-e ect, it is also helping us collect data about people's preferences in social networks.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. INTRODUCTION</title>
      <p>
        Recent research on recommendation using social networks
has taken two main approaches|augmenting collaborative
ltering with social data [
        <xref ref-type="bibr" rid="ref10 ref7">7,10</xref>
        ], or using only the rst-degree
connections for recommendation [
        <xref ref-type="bibr" rid="ref3 ref6">3, 6</xref>
        ]. However, the gains
reported by using social signals to recommend items are only
slight [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], except for network-speci c tasks such as friend
recommendation.
      </p>
      <p>
        One of the reasons for mixed results with network-aware
approaches may be that people's explicit social connections
have little to do with their interests in a particular domain.
Thus, in domains where social connections overlap with user
interest, social recommendation may be useful, in others, not
so much [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. This claim is supported by evidence that
recommendations based on implicit networks constructed from
domain-speci c user activity give good results on predicting
users' preferences [
        <xref ref-type="bibr" rid="ref15 ref5">5, 15</xref>
        ].
      </p>
      <p>
        However, we argue that there is more to explicit social
networks that o ine measures of recommender performance
may not capture. For instance, studies with Facebook and
Google users have found that showing the name of a
particular friend with a recommendation (music or news) can alter
a user's perception of it. [
        <xref ref-type="bibr" rid="ref12 ref9">9, 12</xref>
        ]. Recommendations based on
social connections may also help users navigate their social
network and help them become more aware of the interests
and preference of people in it. As often happens in the o ine
world, friends of a user may also like to recommend items
directly to him [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]. In such cases, and others such as group
recommendation, these recommendations can help support
shared experiences as well as in uence the interpersonal
relationships between people.
      </p>
      <p>
        In addition, a user's preferences are not static; they are
continuously being in uenced by their network. The structure
and properties of a network, as a whole, are also a ected by
the connections between people and their activities within
the network [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. These factors suggest that there is value
in considering recommendations as embedded within a
social network, rather than being served in isolation. We call
this approach to recommendation network-centric [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], in
contrast to the network-aware approaches described earlier.
The principles of network-centric recommendation are based
on the observation that recommendations do a ect, and
get a ected by, the information ow and social connections
within a network. Thus, designing a network-centric
recommender system requires understanding people's preferences,
their social connections, and the characteristics of the
network they inhabit.
      </p>
      <p>Framed this way, a challenge of network-centric
recommendation is that it makes designing and evaluating systems
hard, because they invariably depend on interactions
between more than one user. This paper describes how we
can use PopCore1, a research platform we have built, to
explore questions around networks and recommendation. As
a network-centric system built on top of Facebook's social
network, PopCore serves as a research tool to support live
evaluations of network-centric recommendations, and
collection of user reactions and feedback in a real network setting.
It is also a functional recommender system in its own right,
much like the MovieLens system2.</p>
    </sec>
    <sec id="sec-2">
      <title>2. OVERVIEW OF SYSTEM DESIGN</title>
      <p>
        Figure 1 shows a screenshot of PopCore, which we rst
proposed two years ago in this workshop [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ]. It uses Facebook
as the underlying network and covers the entertainment
domain, including movies, music, books and television shows.
The interface has three main parts: recommendations in
the center, visualizations on the left and user controls on the
right of the screen. Recommended items are a mix of
recommendations computed from items Liked by a user's friends',
and directed suggestions from his/her friends. These
directed suggestions are one of the key features of the system|
items can be recommended manually by users to their friends.
These suggestions serve two purposes. First, they utilize
friends' knowledge to bring interesting recommendations.
Second, they allow people to express their preferences to
their friends and support conversations and shared
experiences on the recommended items.
      </p>
      <p>For each recommendation, a user may Like it on Facebook,
rate it, recommend it to some friends or add it to a personal
queue (Figure 2). When a user clicks on the Recommend
button for an item, he can choose one or more of his friends
to recommend the item to. For convenience, we also o er a</p>
      <sec id="sec-2-1">
        <title>2http://www.movielens.org</title>
        <p>list of recommended recipients who PopCore predicts might
be interested in the item (based on the similarity between
the item and the user's friends).</p>
        <p>Visualizations, such as the item cloud of most popular items
Liked by a user's friends and updates of recent activity on
the app (Figure 1), help create increased network awareness
for the user. User controls on the right, which allow a user to
tailor recommended items based on their popularity, social
closeness or similarity of the people connected with those
items, also help users nd interesting content and navigate
their friends' interests.</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. POPCORE AS A RESEARCH PLATFORM</title>
      <p>We now describe how we are using the system as a test bed
for research. In addition to the main website, we have a
created a separate labs website3. It runs on the same core
infrastructure, but has custom code that allows us to run
experiments. Participants are asked to sign up and give
permission for each experiment separately.</p>
      <p>
        The core infrastructure of PopCore supports an ego-centric
view of the network for each user, collecting Likes and
network information about the user and his friends that can
be used for a variety of studies. In our rst experiment,
we showed users a variety of di erent recommendation
algorithms, some of which used past Likes of the users' friends.
Users were asked to rate and Like items and react to the idea
of network-centric recommendation [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. We found that an
algorithm suggesting the most popular items among a user's
friends performed the best among those that used ego
network information. It was also signi cantly better rated than
an algorithm based on overall network popularity. Users'
reactions to the recommendations con rmed that network ties
can provide a useful way to choose potential content and
neighbors for information ltering tasks.
      </p>
      <p>
        In the study described above, participants did not know
the social nature of the recommendations. Subsequently, we
have used the platform to study how presenting a social
explanation along with a recommendation can a ect user
ratings for music [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ]. Here, we showed users di erent kinds of
explanations involving their friends, such as \X and 3 other
friends like it", along with a recommended musician. Our
results show that social explanation has only a secondary
e ect on the ratings; the primary e ect is that of a user's
expectation of liking an item. Based on the ndings, we
provided a generative mixture model for a user's decision
process on a recommendation.
      </p>
      <p>
        Besides live experiments, data collected for the above
studies helps us reason about the properties of networks and
how they might a ect recommendation. In one such study,
we compared o ine performance of algorithms using
preferences of friends or the whole network, and found that
algorithms using just the friends' information give comparable
results to those using the full network [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ]. Further, the
data helped us investigate how the prevalence of locality of
preference (concentration of Likes for an item in parts of the
network) roughly correlates with the performance of
friendsonly algorithms on three di erent domains, suggesting that
this locality is an important phenomenon and resource for
recommender systems.
      </p>
      <p>Till now, we have described how PopCore can be a useful
platform for experiments involving a user and social data.
However, the system is designed to support participation
and interaction between multiple users. We now describe
an ongoing experiment as an example of how PopCore can
be a useful tool for conducting experiments with more than
one participant.</p>
    </sec>
    <sec id="sec-4">
      <title>3.1 Directed suggestions: A paired experiment</title>
      <p>We consider the practise of sharing items between people,
more commonly known as \word of mouth". Intuitively,
suggesting an item to another person may involve two factors:
having an opinion about the item, and having an
under</p>
      <sec id="sec-4-1">
        <title>3http://labs.popcore.me</title>
        <p>standing of the receiver's preferences. Understanding the
processes behind directed suggestions, speci cally around
item and receiver selection, can help design
recommendation systems that support such suggestions.</p>
        <p>One of our rst goals is to simply compare the
recommendation quality of directed suggestions versus algorithmic
recommendations. In the following paragraphs, we present how
the PopCore platform can be useful for investigating this
question.</p>
        <p>
          Experiment Design: Previous research on helping people
share news items in RSS feeds suggests that manual
recommendations to friends can be useful [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]. Our approach is
somewhat like Krishnan et al., who asked people who did
not know a target user to make recommendations based on
the target user's ratings [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ]; however, instead of providing a
list of ratings from a stranger, we ask people to make
recommendations for their friends based on what they already
know about them.
        </p>
        <p>A simple way to compare the quality of recommendations
would be to analyze logs of user ratings in PopCore and
compare the performance of directed suggestions and
algorithmic recommendations. However, this comparison will
depend greatly on the particular recommender algorithm
being used. One way to control for the recommendation
algorithm is to allow only those directed suggestions that are also
recommended by the algorithm we are comparing against.
Then, among the algorithmically recommended items, we
would be able to compare the ratings between items that
were manually suggested and items that were not. Such a
comparison would point to the quality of manual and
algorithmic recommendations, as perceived by the user.
For ease of logistics, we design a movie recommendation
experiment involving pairs of participants. The system
generates its top 10 recommendations for each participant in
a pair. It then randomly shu es the 20 recommendations
for a pair into a combined list, and shows the combined list
to each participant. Similar to the main PopCore interface,
participants are free to rate them or suggest them to their
partner. We show this combined list to participants so that
both of them rate and suggest from the same set of
recommendations. This is done to ensure that both partners can
choose to start the study at di erent times and still rate each
other's potential suggestions in a single session. In addition,
comparing ratings for the same item from both sender and
receiver could tell us whether people tend to recommend
items that they themselves rate highly, or those that may
be relevant based on the other's preferences.</p>
        <p>Experiment Flow: We run the study using the labs
version of PopCore. In the rst stage, a participant invites
one of his friends as his partner. Once the other
participant accepts the invitation, she enters the experiment and
rates/suggests 20 items. The rst participant then gets an
email and he can go ahead and rate/suggest the same 20
items. During the experiment, we highlight the other
participant's name whenever a user wishes to make a directed
suggestion (Figure 3), in order to make the directed
suggestions easy to send out. Thus, at the end of the experiment,
we receive ratings for the items from both participants and
a list of the items that they shared to one another.
Participants are also presented with a questionnaire that asks
about how close they are to the other participant, and the
reasons they receive or send recommendations in general.
Note that participants have no way of detecting which items
were suggested to them by their partner. Thus, the ratings
can be assumed to pertain to the quality of the
recommendation, rather than the social connection between the sender
and the recipient.</p>
        <p>Initial Results: We are currently in the process of
collecting data. We are recruiting participants from a mix of
college student pools and Amazon mechanical turk. From
an analysis of the initial data on 27 pairs, we nd that items
which were manually suggested have a higher average rating
than those that were algorithmically recommended. This
supports the notion that manual recommendations are
useful, and in some cases, better than an algorithmic
recommendation. However, it may also be the case that people
tend to recommend highly popular items which are more
likely to get higher ratings. We hope to use o ine data to
corroborate these ndings.</p>
        <p>In addition, we nd that the average rating for manual
recommendations is higher for the senders than receivers. This
result suggests that users may be sharing items that they
like more frequently than those which they think can be
relevant for the recipient.</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>4. CONCLUSION</title>
      <p>We have presented PopCore, a research platform for
conducting user experiments with recommendations in social
networks. Our goal for this paper is to show how the system
has helped us conduct experiments that require social data
and/or active participation of users embedded in a network.
We envision it as an open platform for research, for which
we would like to discuss potential ways of collaboration at
the workshop. For instance, one of the ways is to allow other
researchers to setup experiments on PopCore. In addition,
we also hope to share the data we are collecting, keeping in
mind the potential challenges around user privacy in
generating those datasets.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>O.</given-names>
            <surname>Arazy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>N.</given-names>
            <surname>Kumar</surname>
          </string-name>
          , and
          <string-name>
            <given-names>B.</given-names>
            <surname>Shapira</surname>
          </string-name>
          .
          <article-title>A theory-driven design framework for social recommender systems</article-title>
          .
          <source>In Journal of the Assoc. for Info</source>
          . Sys.,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <given-names>M. S.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Marcus</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D. R.</given-names>
            <surname>Karger</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R. C.</given-names>
            <surname>Miller</surname>
          </string-name>
          .
          <article-title>Enhancing directed content sharing on the web</article-title>
          .
          <source>In Proc. CHI</source>
          , pages
          <volume>971</volume>
          {
          <fpage>980</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>J.</given-names>
            <surname>Chen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Nairn</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Nelson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bernstein</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          .
          <article-title>Short and tweet: Experiments on recommending content from information streams</article-title>
          .
          <source>In Proc. CHI</source>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>D.</given-names>
            <surname>Crandall</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Huttenlocher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Kleinberg</surname>
          </string-name>
          , and
          <string-name>
            <given-names>S.</given-names>
            <surname>Suri</surname>
          </string-name>
          .
          <article-title>Feedback e ects between similarity and social in uence in online communities</article-title>
          .
          <source>In Proc. KDD</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>J.</given-names>
            <surname>Golbeck</surname>
          </string-name>
          and
          <string-name>
            <given-names>J.</given-names>
            <surname>Hendler</surname>
          </string-name>
          .
          <article-title>Filmtrust: movie recommendations using trust in web-based social networks</article-title>
          .
          <source>In Proc. IEEE Consumer Comm. and Networking Conf</source>
          .,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>I.</given-names>
            <surname>Guy</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Jacovi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Perer</surname>
          </string-name>
          ,
          <string-name>
            <surname>I. Ronen</surname>
          </string-name>
          , and
          <string-name>
            <given-names>E.</given-names>
            <surname>Uziel</surname>
          </string-name>
          .
          <article-title>Same places, same things, same people? Mining user similarity on social media</article-title>
          .
          <source>In Proc. CSCW</source>
          , CSCW '
          <volume>10</volume>
          , pages
          <fpage>41</fpage>
          {
          <fpage>50</fpage>
          , New York, NY, USA,
          <year>2010</year>
          . ACM.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>I.</given-names>
            <surname>Konstas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Stathopoulos</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. M.</given-names>
            <surname>Jose</surname>
          </string-name>
          .
          <article-title>On social networks and collaborative recommendation</article-title>
          .
          <source>In Proc. SIGIR</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>V.</given-names>
            <surname>Krishnan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. K.</given-names>
            <surname>Narayanashetty</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Nathan</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R. T.</given-names>
            <surname>Davies</surname>
          </string-name>
          , and
          <string-name>
            <given-names>J. A.</given-names>
            <surname>Konstan</surname>
          </string-name>
          .
          <article-title>Who predicts better?: results from an online study comparing humans and an online recommender system</article-title>
          .
          <source>In Proceedings of the 2008 ACM conference on Recommender systems</source>
          ,
          <year>2008</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>C.</given-names>
            <surname>Kulkarni</surname>
          </string-name>
          and
          <string-name>
            <given-names>E.</given-names>
            <surname>Chi</surname>
          </string-name>
          .
          <article-title>All the news that's t to read: a study of social annotations for news reading</article-title>
          .
          <source>In Proc. CHI</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>H.</given-names>
            <surname>Ma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhou</surname>
          </string-name>
          , C. Liu,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Lyu</surname>
          </string-name>
          ,
          <string-name>
            <surname>and I. King.</surname>
          </string-name>
          <article-title>Recommender systems with social regularization</article-title>
          .
          <source>In Proc. WSDM</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          .
          <article-title>Network-centric recommendation: Personalization with and in social networks</article-title>
          .
          <source>In Proc. IEEE SocialCom</source>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          and
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          .
          <article-title>Do social explanations work? Studying and modeling the e ects of social explanations in recommender systems</article-title>
          .
          <source>In Proc. WWW</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Gemici</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          . Friends, strangers, and
          <article-title>the value of ego networks for recommendation</article-title>
          .
          <source>In Proc. ICWSM</source>
          ,
          <year>2013</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>A.</given-names>
            <surname>Sharma</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Malu</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Cosley</surname>
          </string-name>
          .
          <article-title>Popcore: A system for network-centric recommendations</article-title>
          .
          <source>In Proc. RSWEB Workshop</source>
          , RecSys,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>T.</given-names>
            <surname>Zhou</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Ren</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Medo</surname>
          </string-name>
          , and
          <string-name>
            <given-names>Y.-C.</given-names>
            <surname>Zhang</surname>
          </string-name>
          .
          <article-title>Bipartite network projection and personal recommendation</article-title>
          .
          <source>Phys. Rev. E</source>
          ,
          <volume>76</volume>
          ,
          <year>Oct 2007</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>