网络活动馈送:大海捞针

MSM '13 Pub Date : 2013-05-01 DOI:10.1145/2463656.2463657
S. Berkovsky
{"title":"网络活动馈送:大海捞针","authors":"S. Berkovsky","doi":"10.1145/2463656.2463657","DOIUrl":null,"url":null,"abstract":"Social networks have evolved over the last decade into an omni-popular phenomenon that revolutionized both the online and offline interactions. They are used for a variety of purposes and are fast becoming the place to share and discover news, activities, and content of interest. Facebook alone reports more than 1 billion users, each having on average 130 friends and connected to 80 communities, and spending on Facebook less than one hour a day. The volume of the generated content of potential interest is, thus, overwhelming and ever growing, but the time spent on the social networks is fairly limited.\n How can users stay abreast of the activities of interest given this severe information overload? Activity feed is a simple mechanism deployed nowadays by many social networks, which performs information filtering on the users' behalf. Typically, activity feed encompasses reverse chronologically ordered items corresponding to activities carried out by direct friends and followees. However, activity feed can hardly cope with the volume and diversity of the activities. In order to alleviate information overload, simplify content discovery, and sustain user engagement, there is a need to personalise the activity feed, i.e., identify items of a particular interest and relevance for the user and filter out irrelevant items.\n The feed personalisation task can be naturally represented as a top-K recommendation problem. Let us denote by N the set of items corresponding to activities that can potentially be included in the feed, e.g., all the activities carried out since the user's last visit. Hence, the personalisation task aims at selecting and recommending a smaller set of items, K (|K|≪|N|), corresponding to activities of the highest relevance for the user. Essentially, the recommendation process entails scoring all the |N| candidate items and selecting |K| top-scoring items.\n What information can facilitate the item scoring? When interacting with a social network, users typically leave very little explicit feedback, primarily their 'likes'. There is a moderate amount of strong implicit user-to-user feedback, e.g., friending and direct communication (messages and comments), and abundance of weak implicit user-to-activity feedback, such as content viewing and contribution, community membership, and event participation. Finally, there is some self-reported and often unreliable information pertaining to user demographics, location, preferences, skills, or interests.\n How can all this this information be modelled, fused, mined, and eventually leveraged for scoring and recommending activity feed items? This problem has been investigated from different angles in the recent years [1-10]. In this talk, we will overview most prominent works into the personalisation of the activity feed. These works proposed a spectrum of algorithmic approaches and evaluated them with numerous social networks of a highly heterogeneous nature. We will summarise the main components underpinning these approaches, overview the obtained findings, discuss their advantages and shortcomings, survey their combinations, analyse evaluation metrics and methodologies, and, finally, identify gaps calling for further research.","PeriodicalId":136302,"journal":{"name":"MSM '13","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Network activity feed: finding needles in a haystack\",\"authors\":\"S. Berkovsky\",\"doi\":\"10.1145/2463656.2463657\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Social networks have evolved over the last decade into an omni-popular phenomenon that revolutionized both the online and offline interactions. They are used for a variety of purposes and are fast becoming the place to share and discover news, activities, and content of interest. Facebook alone reports more than 1 billion users, each having on average 130 friends and connected to 80 communities, and spending on Facebook less than one hour a day. The volume of the generated content of potential interest is, thus, overwhelming and ever growing, but the time spent on the social networks is fairly limited.\\n How can users stay abreast of the activities of interest given this severe information overload? Activity feed is a simple mechanism deployed nowadays by many social networks, which performs information filtering on the users' behalf. Typically, activity feed encompasses reverse chronologically ordered items corresponding to activities carried out by direct friends and followees. However, activity feed can hardly cope with the volume and diversity of the activities. In order to alleviate information overload, simplify content discovery, and sustain user engagement, there is a need to personalise the activity feed, i.e., identify items of a particular interest and relevance for the user and filter out irrelevant items.\\n The feed personalisation task can be naturally represented as a top-K recommendation problem. Let us denote by N the set of items corresponding to activities that can potentially be included in the feed, e.g., all the activities carried out since the user's last visit. Hence, the personalisation task aims at selecting and recommending a smaller set of items, K (|K|≪|N|), corresponding to activities of the highest relevance for the user. Essentially, the recommendation process entails scoring all the |N| candidate items and selecting |K| top-scoring items.\\n What information can facilitate the item scoring? When interacting with a social network, users typically leave very little explicit feedback, primarily their 'likes'. There is a moderate amount of strong implicit user-to-user feedback, e.g., friending and direct communication (messages and comments), and abundance of weak implicit user-to-activity feedback, such as content viewing and contribution, community membership, and event participation. Finally, there is some self-reported and often unreliable information pertaining to user demographics, location, preferences, skills, or interests.\\n How can all this this information be modelled, fused, mined, and eventually leveraged for scoring and recommending activity feed items? This problem has been investigated from different angles in the recent years [1-10]. In this talk, we will overview most prominent works into the personalisation of the activity feed. These works proposed a spectrum of algorithmic approaches and evaluated them with numerous social networks of a highly heterogeneous nature. We will summarise the main components underpinning these approaches, overview the obtained findings, discuss their advantages and shortcomings, survey their combinations, analyse evaluation metrics and methodologies, and, finally, identify gaps calling for further research.\",\"PeriodicalId\":136302,\"journal\":{\"name\":\"MSM '13\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MSM '13\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2463656.2463657\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MSM '13","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2463656.2463657","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在过去的十年里,社交网络已经发展成为一种全面流行的现象,它彻底改变了线上和线下的互动。它们被用于各种目的,并迅速成为分享和发现新闻、活动和感兴趣内容的地方。仅Facebook就报告了超过10亿的用户,每个人平均有130个朋友,连接80个社区,每天花在Facebook上的时间不到一个小时。因此,产生的潜在兴趣内容的数量是压倒性的,而且还在不断增长,但花在社交网络上的时间却相当有限。在这种严重的信息过载的情况下,用户如何跟上他们感兴趣的活动?活动提要是目前许多社交网络部署的一种简单机制,它代表用户执行信息过滤。通常,活动提要包含与直接好友和关注者执行的活动相对应的逆时间顺序项。然而,活动提要很难应付活动的数量和多样性。为了减轻信息过载,简化内容发现,并保持用户粘性,有必要个性化活动feed,即识别用户特别感兴趣和相关的项目,过滤掉不相关的项目。提要个性化任务可以自然地表示为top-K推荐问题。让我们用N表示与提要中可能包含的活动相对应的项集,例如,自用户上次访问以来执行的所有活动。因此,个性化任务的目标是选择和推荐一组较小的产品,K (|K|≪|N|),与用户最相关的活动相对应。从本质上讲,推荐过程需要对所有N个候选条目进行评分,并选择K个得分最高的条目。哪些信息可以促进项目评分?当与社交网络互动时,用户通常很少留下明确的反馈,主要是他们的“喜欢”。有中等数量的强隐式用户对用户反馈,例如加好友和直接交流(消息和评论),以及大量的弱隐式用户对活动反馈,例如内容浏览和贡献、社区成员和事件参与。最后,还有一些关于用户人口统计、位置、偏好、技能或兴趣的自我报告且通常不可靠的信息。如何对所有这些信息进行建模、融合、挖掘,并最终用于评分和推荐活动提要项目?近年来,人们从不同角度对这一问题进行了研究[1-10]。在这次演讲中,我们将概述活动提要个性化方面最突出的工作。这些工作提出了一系列的算法方法,并用高度异构性质的众多社会网络对它们进行了评估。我们将总结支撑这些方法的主要组成部分,概述已获得的发现,讨论它们的优点和缺点,调查它们的组合,分析评估指标和方法,最后确定需要进一步研究的差距。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Network activity feed: finding needles in a haystack
Social networks have evolved over the last decade into an omni-popular phenomenon that revolutionized both the online and offline interactions. They are used for a variety of purposes and are fast becoming the place to share and discover news, activities, and content of interest. Facebook alone reports more than 1 billion users, each having on average 130 friends and connected to 80 communities, and spending on Facebook less than one hour a day. The volume of the generated content of potential interest is, thus, overwhelming and ever growing, but the time spent on the social networks is fairly limited. How can users stay abreast of the activities of interest given this severe information overload? Activity feed is a simple mechanism deployed nowadays by many social networks, which performs information filtering on the users' behalf. Typically, activity feed encompasses reverse chronologically ordered items corresponding to activities carried out by direct friends and followees. However, activity feed can hardly cope with the volume and diversity of the activities. In order to alleviate information overload, simplify content discovery, and sustain user engagement, there is a need to personalise the activity feed, i.e., identify items of a particular interest and relevance for the user and filter out irrelevant items. The feed personalisation task can be naturally represented as a top-K recommendation problem. Let us denote by N the set of items corresponding to activities that can potentially be included in the feed, e.g., all the activities carried out since the user's last visit. Hence, the personalisation task aims at selecting and recommending a smaller set of items, K (|K|≪|N|), corresponding to activities of the highest relevance for the user. Essentially, the recommendation process entails scoring all the |N| candidate items and selecting |K| top-scoring items. What information can facilitate the item scoring? When interacting with a social network, users typically leave very little explicit feedback, primarily their 'likes'. There is a moderate amount of strong implicit user-to-user feedback, e.g., friending and direct communication (messages and comments), and abundance of weak implicit user-to-activity feedback, such as content viewing and contribution, community membership, and event participation. Finally, there is some self-reported and often unreliable information pertaining to user demographics, location, preferences, skills, or interests. How can all this this information be modelled, fused, mined, and eventually leveraged for scoring and recommending activity feed items? This problem has been investigated from different angles in the recent years [1-10]. In this talk, we will overview most prominent works into the personalisation of the activity feed. These works proposed a spectrum of algorithmic approaches and evaluated them with numerous social networks of a highly heterogeneous nature. We will summarise the main components underpinning these approaches, overview the obtained findings, discuss their advantages and shortcomings, survey their combinations, analyse evaluation metrics and methodologies, and, finally, identify gaps calling for further research.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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