arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1305.1502cs.SIphysics.soc-ph
收藏

社会群体活动的意愿优化

Willingness Optimization for Social Group Activity

Hong-Han Shuai, De-Nian Yang, Philip S. Yu, Ming-Syan Chen

摘要:

研究表明,一个人愿意参加一个社会团体活动,如果活动是有趣的,如果一些亲密的朋友也加入活动的同伴。文献表明,一个人的兴趣和朋友之间的社交紧密度可以有效地从社交网站中获得和挖掘。然而,即使在上述两种信息广泛可用的情况下,社交群组活动仍然需要手动协调,并且由于社交连接的复杂性和朋友之间可能的兴趣的多样性,该过程对于用户来说是繁琐和耗时的,特别是对于大型社交群组活动。为了解决上述重要的需求,本文提出了自动选择和推荐潜在的社会群体活动的参与者,这可能是非常有用的社交网站作为一个增值服务。我们首先制定了一个新的问题,命名为社会群体的意愿最大化(WASO)。本文指出用贪心算法求得的解很可能陷入局部最优解。因此,我们设计了一种新的随机算法来有效地解决这个问题。给定可用的计算预算,所提出的算法是能够最佳地分配资源,并找到一个近似比的解决方案。我们在Facebook上实现了该算法,用户研究表明,该算法获得的社会群体显着优于用户手动配置的解决方案。

英文摘要:

Studies show that a person is willing to join a social group activity if the activity is interesting, and if some close friends also join the activity as companions. The literature has demonstrated that the interests of a person and the social tightness among friends can be effectively derived and mined from social networking websites. However, even with the above two kinds of information widely available, social group activities still need to be coordinated manually, and the process is tedious and time-consuming for users, especially for a large social group activity, due to complications of social connectivity and the diversity of possible interests among friends. To address the above important need, this paper proposes to automatically select and recommend potential attendees of a social group activity, which could be very useful for social networking websites as a value-added service. We first formulate a new problem, named Willingness mAximization for Social grOup (WASO). This paper points out that the solution obtained by a greedy algorithm is likely to be trapped in a local optimal solution. Thus, we design a new randomized algorithm to effectively and efficiently solve the problem. Given the available computational budgets, the proposed algorithm is able to optimally allocate the resources and find a solution with an approximation ratio. We implement the proposed algorithm in Facebook, and the user study demonstrates that social groups obtained by the proposed algorithm significantly outperform the solutions manually configured by users.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑