Complex Event-Participant Planning and Its Incremental Variant
Complex Event-Participant Planning and Its Incremental Variant
复制标题
DOI：
10.1109/icde.2017.135
复制
发表时间：
2017-04
期刊：
影响因子：
--
通讯作者：
Yurong Cheng;Ye Yuan;Lei Chen;C. Giraud-Carrier;Guoren Wang
中科院分区：
文献类型：
--
作者：
Yurong Cheng;Ye Yuan;Lei Chen;C. Giraud-Carrier;Guoren Wang
近年来，基于事件的在线社交网络（EBSN）平台变得越来越流行。EBSN平台的一个典型任务是帮助用户制定合适的个性化计划，以参与各种有趣的社交活动。现有的技术要么忽略了minimumparticipant的要求约束，为每个事件，这是至关重要的，需要一些事件成功地举行，或假设事件不会改变，一旦宣布。在本文中，我们解决现有EBSN技术的上述不足之处。我们正式定义了全球事件规划与约束（GEPC）的问题，它的增量变体。我们证明了这两个问题都是NP-困难的，并提供了近似解。最后，我们通过对真实的和合成数据集的大量实验，验证了我们提出的算法的有效性和效率。
In recent years, online Event Based Social Network (EBSN) platforms have become increasingly popular. One typical task of EBSN platforms is to help users make suitable and personalized plans for participating in different interesting social events. Existing techniques either ignore the minimumparticipant requirement constraint for each event, which is crucially needed for some events to be held successfully, or assume that events would not change once announced. In this paper, we address the above inadequacies of existing EBSN techniques. We formally define the Global Event Planning with Constraints (GEPC) problem, and its incremental variant. We prove that both are NP-hard, and provide approximate solutions. Finally, we verify the effectiveness and efficiency of our proposed algorithms through extensive experiments over real and synthetic datasets.