liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Scalable Affiliation Recommendation using Auxiliary Networks
University of Texas at Austin.
University of Texas at Austin.
University of Texas at Austin.
University of Texas at Austin.ORCID iD: 0000-0002-1542-2690
Show others and affiliations
2011 (English)In: ACM Transactions on Intelligent Systems and Technology, ISSN 2157-6904, Vol. 3, no 1, 3:1-3:20 p.Article in journal (Refereed) Published
Abstract [en]

Social network analysis has attracted increasing attention in recent years. In many social networks, besides friendship links among users, the phenomenon of users associating themselves with groups or communities is common. Thus, two networks exist simultaneously: the friendship network among users, and the affiliation network between users and groups. In this article, we tackle the affiliation recommendation problem, where the task is to predict or suggest new affiliations between users and communities, given the current state of the friendship and affiliation networks. More generally, affiliations need not be community affiliations—they can be a user?s taste, so affiliation recommendation algorithms have applications beyond community recommendation. In this article, we show that information from the friendship network can indeed be fruitfully exploited in making affiliation recommendations. Using a simple way of combining these networks, we suggest two models of user-community affinity for the purpose of making affiliation recommendations: one based on graph proximity, and another using latent factors to model users and communities. We explore the affiliation recommendation algorithms suggested by these models and evaluate these algorithms on two real-world networks, Orkut and Youtube. In doing so, we motivate and propose a way of evaluating recommenders, by measuring how good the top 50 recommendations are for the average user, and demonstrate the importance of choosing the right evaluation strategy. The algorithms suggested by the graph proximity model turn out to be the most effective. We also introduce scalable versions of these algorithms, and demonstrate their effectiveness. This use of link prediction techniques for the purpose of affiliation recommendation is, to our knowledge, novel.

Place, publisher, year, edition, pages
2011. Vol. 3, no 1, 3:1-3:20 p.
National Category
Computational Mathematics Other Computer and Information Science
Identifiers
URN: urn:nbn:se:liu:diva-73726DOI: 10.1145/2036264.2036267OAI: oai:DiVA.org:liu-73726DiVA: diva2:476341
Available from: 2012-01-12 Created: 2012-01-12 Last updated: 2013-10-11

Open Access in DiVA

No full text

Other links

Publisher's full texthttp://doi.acm.org/10.1145/2036264.2036267

Authority records BETA

Savas, Berkant

Search in DiVA

By author/editor
Savas, Berkant
Computational MathematicsOther Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 383 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf