广东省自然科学基金 (2019A1515011721, 2019A1515011064); 深圳市基础研究项目 (20200806102941001)
在基于事件的社交网络(EBSNs)上, 事件规划一直是一个热点研究问题. 事件规划问题的核心是基于事件和用户的约束条件, 对于一组事件, 为每个事件选择一组用户, 以最大化预先定义的目标函数. 在实际应用中, 事件冲突、事件容量、用户容量、社交偏好、事件偏好, 简称为CCP, 即冲突conflict、容量capacity、偏好preference, 是规划方案需要考虑的重要因素. 然而, 现有的所有工作均未在研究事件规划问题时考虑CCP. 为了获得更加合理有效的规划方案, 首次提出一种CCP事件规划问题. 相比只考虑部分因素的规划, CCP事件规划面临着问题更复杂、约束条件更多的困难. 为了有效求解该问题, 提出事件导向的贪心用户选择算法、事件导向的动态规划算法及基于收益预测的快速版本和事件导向的近似最优用户选择算法. 大量的实验结果验证所提算法的有效性和高效性.
Event planning on event-based social networks (EBSNs) has been attracting research efforts for decades. The key insight of the event planning problem is assigning a group of users to a set of events, such that a pre-defined objective function is maximized, subject to a set of constraints. In real applications, important factors, such as event conflicts, event capacities, user capacities, social preferences between users, event preferences, abbreviated as conflict, capacity, and preference (CCP), are necessary to be considered in the event planning. This work summarizes these important factors as conflict, capacity, and preference, denoted by CCP for short. Existing works do not consider CCP when computing event plans. Hence, this paper proposes CCP-based event planning problem on event-based social networks, so that more reasonable event plans can be obtained. Since this is the first time to propose CCP-based event planning problem, none of the existing methods can be directly applied to solve it. Compared with previous event planning problem that only considers part of CCP factors, the challenges of solving the CCP-based event planning problem include the complexity of the new problem, more constraints involved. Hence, this paper proposes these algorithms to solve the CCP-based event planning problem in efficient and effective ways. Extensive experiments are conducted and the results prove the effectiveness and the efficiency of the proposed algorithms.