arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1502.06682cs.SI
收藏

最大化社会活动组织的创造力

Maximizing Friend-Making Likelihood for Social Activity Organization

Chih-Ya Shen, De-Nian Yang, Wang-Chien Lee, Ming-Syan Chen

摘要:

社会心理学中的社会存在理论表明,以计算机为媒介的在线互动不如面对面的互动。在本文中,我们考虑的情况下,通过在线社交网络(OSNs)组织交友社交活动的人,并制定了一个新的研究问题,即跳跃界最大组交友(HMGF),通过建模现有的友谊和新朋友的可能性。为了找到一组参加社交活动,HMGF是独特的和具有挑战性的,由于相互作用的群体规模,现有的友谊和交友的可能性的目标函数的约束。我们证明了HMGF是NP-Hard的,除非P = NP,否则不存在近似算法.然后,我们提出了一个误差有界的近似算法来有效地获得非常接近最优解的解。我们进行了一个用户研究,以验证我们的问题制定和执行-形式在真实数据集上的广泛实验,以证明我们提出的算法的效率和有效性。

英文摘要:

The social presence theory in social psychology suggests that computer-mediated online interactions are inferior to face-to-face, in-person interactions. In this paper, we consider the scenarios of organizing in person friend-making social activities via online social networks (OSNs) and formulate a new research problem, namely, Hop-bounded Maximum Group Friending (HMGF), by modeling both existing friendships and the likelihood of new friend making. To find a set of attendees for socialization activities, HMGF is unique and challenging due to the interplay of the group size, the constraint on existing friendships and the objective function on the likelihood of friend making. We prove that HMGF is NP-Hard, and no approximation algorithm exists unless P = NP. We then propose an error-bounded approximation algorithm to efficiently obtain the solutions very close to the optimal solutions. We conduct a user study to validate our problem formulation and per- form extensive experiments on real datasets to demonstrate the efficiency and effectiveness of our proposed algorithm.

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

↑