Exploring generative models of tripartite graphs for recommendation in social media

MSM '13 Pub Date : 2013-05-01 DOI:10.1145/2463656.2463658
C. Chelmis, V. Prasanna
{"title":"Exploring generative models of tripartite graphs for recommendation in social media","authors":"C. Chelmis, V. Prasanna","doi":"10.1145/2463656.2463658","DOIUrl":null,"url":null,"abstract":"As social media sites grow in popularity, tagging has naturally emerged as a method of searching, categorizing and filtering online information, especially multimedia content. The unrestricted vocabulary users choose from to annotate content however, has often lead to an explosion of the size of space in which search is performed. This paper is concerned with investigating generative models of social annotations, and testing their efficiency with respect to two information consumption oriented tasks. One task considers recommending new tags (similarly new resources) for new, previously unknown users. We use perplexity as a standard measure for estimating the generalization performance of a probabilistic model. The second task is aimed at recommending new users to connect with. In this task, we examine which users' activity is most discriminative in predicting social ties: annotation (i.e. tags), resource usage (i.e. artists), or collective annotation of resources altogether. For the second task, we propose a framework to integrate the modeling of social annotations with network proximity. The proposed approach consists of two steps: (1) discovering salient topics that characterize users, resources and annotations; and (2) enhancing the recommendation power of such models by incorporating social clues from the immediate neighborhood of users. In particular, we propose four classification schemes for social link recommendation, which we evaluate on a real--world dataset from Last.fm. Our results demonstrate significant improvements over traditional approaches.","PeriodicalId":136302,"journal":{"name":"MSM '13","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"MSM '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2463656.2463658","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

As social media sites grow in popularity, tagging has naturally emerged as a method of searching, categorizing and filtering online information, especially multimedia content. The unrestricted vocabulary users choose from to annotate content however, has often lead to an explosion of the size of space in which search is performed. This paper is concerned with investigating generative models of social annotations, and testing their efficiency with respect to two information consumption oriented tasks. One task considers recommending new tags (similarly new resources) for new, previously unknown users. We use perplexity as a standard measure for estimating the generalization performance of a probabilistic model. The second task is aimed at recommending new users to connect with. In this task, we examine which users' activity is most discriminative in predicting social ties: annotation (i.e. tags), resource usage (i.e. artists), or collective annotation of resources altogether. For the second task, we propose a framework to integrate the modeling of social annotations with network proximity. The proposed approach consists of two steps: (1) discovering salient topics that characterize users, resources and annotations; and (2) enhancing the recommendation power of such models by incorporating social clues from the immediate neighborhood of users. In particular, we propose four classification schemes for social link recommendation, which we evaluate on a real--world dataset from Last.fm. Our results demonstrate significant improvements over traditional approaches.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
探索社交媒体中推荐的三方图生成模型
随着社交媒体网站越来越受欢迎,标签自然而然地成为一种搜索、分类和过滤在线信息的方法,尤其是多媒体内容。然而,用户选择用于注释内容的不受限制的词汇表常常导致执行搜索的空间大小的爆炸。本文研究了社交注释的生成模型,并在两个面向信息消费的任务中测试了它们的效率。其中一项任务考虑为以前未知的新用户推荐新标签(类似于新资源)。我们使用困惑度作为估计概率模型泛化性能的标准度量。第二项任务是推荐新用户。在这项任务中,我们研究了哪些用户的活动在预测社会关系方面最具辨别力:注释(即标签),资源使用(即艺术家),还是资源的集体注释。对于第二项任务,我们提出了一个将社交注释建模与网络接近性相结合的框架。该方法包括两个步骤:(1)发现具有用户、资源和注释特征的显著主题;(2)结合用户近邻的社交线索,增强模型的推荐能力。特别地,我们提出了四种用于社交链接推荐的分类方案,我们在Last.fm的真实世界数据集上进行了评估。我们的结果表明,与传统方法相比,我们有了显著的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visualizing co-retweeting behavior for recommending relevant real-time content Who should I add as a "friend"?: a study of friend recommendations using proximity and homophily Network activity feed: finding needles in a haystack Privacy-preserving concepts for supporting recommendations in decentralized OSNs Exploring generative models of tripartite graphs for recommendation in social media
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1