Event-Participant and Incremental Planning over Event-Based Social Networks

Yurong Cheng, Ye Yuan, Lei Chen, Christophe G. Giraud-Carrier, Guoren Wang, Boyang Li

Abstract

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 minimum-participant 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. Since these problems 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.
BibTeX
@article{cheng2021event,
  author = {Yurong Cheng and Ye Yuan and Lei Chen and Christophe G. Giraud-Carrier and Guoren Wang and Boyang Li},
  title = {{Event-Participant and Incremental Planning over Event-Based Social Networks}},
  journal = {IEEE Trans. Knowl. Data Eng.},
  year = {2021},
  url = {https://openreview.net/forum?id=jx1EMskpAq},
}

Loading related content...

Figure