On bottleneck-aware arrangement for event-based social networks

摘要: With the popularity of mobile computing and social media, various kinds online event-based network (EBSN) platforms, such as Meetup, Plancast Whova, is gaining in prominence. A fundamental task managing EBSN platforms to recommend suitable events potential users according following three factors: distances between users, attribute similarities friend relationships among users. However, none existing approaches consider all aforementioned influential factors when they proper events. Furthermore, recommendation strategies neglect bottleneck cases on global recommendation. Thus, it impossible for solutions achieve optimal utility real-world scenarios. In this paper, we first formally define problem bottleneck-aware event arrangement (BSEA), which proven be NP-hard. To solve BSEA approximately, devise two greedy-based heuristic algorithms, Greedy Random+Greedy. particular, Random+Greedy algorithm faster more effective than most cases. Finally, conduct extensive experiments real synthetic datasets verify efficiency accuracy our proposed algorithms.