Utility-Time Social Event Planning on EBSN

At present, event-based social network (EBSN) platforms are becoming more and more popular, which main function is to arrange appropriate social activities for interested users. The existing methods usually assume that each user can participate in a limited number of events and solve the spatio-temporal conflicts caused by the limited number of events. However, in practical applications, the existing methods emerge the following problems: (1) they don't estimate the time cost caused by travel distance; (2) the constraint of the limiting number of users participating events and the schedule of users is not accurate enough. Therefore, first, we combine the position information and propose RDP algorithm to provide personalized event planning based on considering the free time of users, the average moving speed of users, the interest value of users as a whole, which ensures the approximate ratio of our algorithm. Second, we present RGPV and the RGPT algorithms to reduce the running time and improve the efficiency of time and space, so as to ensure each user can participate in the events on time. Finally, the experiments based on the real dataset can show that the proposed algorithms are effective and efficient.