Social Link Prediction in Online Social Tagging Systems

被引:27
作者
Chelmis, Charalampos [1 ]
Prasanna, Viktor K. [2 ]
机构
[1] Univ So Calif, Dept Comp Sci, Los Angeles, CA 90089 USA
[2] Univ So Calif, Ming Hsieh Dept Elect Engn, Los Angeles, CA 90089 USA
关键词
Algorithms; Experimentation; Human Factors; Measurement; Performance; Annotation; collaborative tagging; graphical models; Last.fm; link prediction; link recommendation; machine learning; social bookmarking; social media; topic models; unsupervised learning; VECTOR MACHINES;
D O I
10.1145/2516891
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Social networks have become a popular medium for people to communicate and distribute ideas, content, news, and advertisements. Social content annotation has naturally emerged as a method of categorization and filtering of online information. The unrestricted vocabulary users choose from to annotate content has often lead to an explosion of the size of space in which search is performed. In this article, we propose latent topic models as a principled way of reducing the dimensionality of such data and capturing the dynamics of collaborative annotation process. We propose three generative processes to model latent user tastes with respect to resources they annotate with metadata. We show that latent user interests combined with social clues from the immediate neighborhood of users can significantly improve social link prediction in the online music social media site Last.fm. Most link prediction methods suffer from the high class imbalance problem, resulting in low precision and/or recall. In contrast, our proposed classification schemes for social link recommendation achieve high precision and recall with respect to not only the dominant class (nonexistence of a link), but also with respect to sparse positive instances, which are the most vital in social tie prediction.
引用
收藏
页数:27
相关论文
共 49 条
  • [1] [Anonymous], 2010, P 3 ACM INT C WEB SE
  • [2] [Anonymous], 2009, PROC 26 ANN INT C M, DOI DOI 10.1145/1553374.1553460
  • [3] [Anonymous], 2012, PROC 5 ACM INT C WEB, DOI DOI 10.1145/2124295.2124380
  • [4] [Anonymous], 2010, Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, ACM, Association for Computing Machinery
  • [5] [Anonymous], 2008, P 25 INT C MACHINE L, DOI [10.1145/1390156.1390273, DOI 10.1145/1390156.1390273]
  • [6] [Anonymous], 2011, PROC 4 ACM INT C WEB, DOI DOI 10.1145/1935826.1935914
  • [7] [Anonymous], 2009, P 3 ACM C RECOMMENDE, DOI DOI 10.1145/1639714.1639726
  • [8] [Anonymous], PSYCHOMETRIKA, DOI DOI 10.1007/BF02289026
  • [9] [Anonymous], P 2011 EUR C MACH
  • [10] [Anonymous], P 3 ACM INT C WEB SE