图 书 馆
论社会事件组织On Social Event Organization |
|
| 课程网址: | http://videolectures.net/kdd2014_li_social_event/ |
| 主讲教师: | Keqian Li |
| 开课单位: | 不列颠哥伦比亚大学 |
| 开课时间: | 2014-10-07 |
| 课程语种: | 英语 |
| 中文简介: |  Meetup 和 Plancast 等在线平台最近在规划聚会和活动组织方面变得流行起来。然而，令人惊讶的是，关于如何通过此类平台为一大群人有效和高效地组织社交活动的研究令人惊讶。在本文中，据我们所知，我们第一次研究了社会事件组织中涉及的关键计算问题。 我们提出了社会事件组织 (SEO) 问题作为分配集合的一个问题。供一组用户参加的活动，其中用户在社交上相互联系并且对这些活动具有天生的兴趣。作为社会事件组织的第一步，我们引入了问题的受限版本的正式定义，并表明它是 NP 难的并且难以近似。我们提出了有效的启发式算法，通过结合幻影事件的概念和使用前瞻估计来改进简单的贪婪算法。我们使用合成数据集和三个真实数据集，包括来自 Meetup 和 Plancast 平台的数据集，通过实验证明我们的贪婪启发式算法具有可扩展性，而且在实现卓越的社会福利方面显着优于基线算法。 |
| 课程简介: | Online platforms, such as Meetup and Plancast, have recently become popular for planning gatherings and event organization. However, there is a surprising lack of studies on how to effectively and efficiently organize social events for a large group of people through such platforms. In this paper, we study the key computational problem involved in organization of social events, to our best knowledge, for the first time. We propose the Social Event Organization (SEO) problem as one of assigning a set of events for a group of users to attend, where the users are socially connected with each other and have innate levels of interest in those events. As a first step toward Social Event Organization, we introduce a formal definition of a restricted version of the problem and show that it is NP-hard and is hard to approximate. We propose efficient heuristic algorithms that improve upon simple greedy algorithms by incorporating the notion of phantom events and by using look-ahead estimation. Using synthetic datasets and three real datasets including those from the platforms Meetup and Plancast, we experimentally demonstrate that our greedy heuristics are scalable and furthermore outperform the baseline algorithms significantly in terms of achieving superior social welfare. |
| 关 键 词: | 真实数据集; 贪婪算法; 合成数据集 |
| 课程来源: | 视频讲座网 |
| 数据采集: | 2021-06-09：zyk |
| 最后编审: | 2021-06-09：zyk |
| 阅读次数: | 80 |