liu.seSearch for publications in DiVA
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • 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
Vise andre og tillknytning
2011 (engelsk)Inngår i: ACM Transactions on Intelligent Systems and Technology, ISSN 2157-6904, Vol. 3, nr 1, s. 3:1-3:20Artikkel i tidsskrift (Fagfellevurdert) 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.

sted, utgiver, år, opplag, sider
2011. Vol. 3, nr 1, s. 3:1-3:20
HSV kategori
Identifikatorer
URN: urn:nbn:se:liu:diva-73726DOI: 10.1145/2036264.2036267OAI: oai:DiVA.org:liu-73726DiVA, id: diva2:476341
Tilgjengelig fra: 2012-01-12 Laget: 2012-01-12 Sist oppdatert: 2018-01-12

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fullteksthttp://doi.acm.org/10.1145/2036264.2036267

Personposter BETA

Savas, Berkant

Søk i DiVA

Av forfatter/redaktør
Savas, Berkant

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 390 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf