The Community for Technology Leaders
2015 31st IEEE International Conference on Data Engineering Workshops (ICDEW) (2015)
Seoul, South Korea
April 13, 2015 to April 17, 2015
ISBN: 978-1-4799-8442-8
pp: 216-223
Yongxin Tong , State Key Laboratory of Software Development Environment, School of Computer Science and Engineering, Beihang University, China
Rui Meng , Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, China
Jieying She , Department of Computer Science and Engineering, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, China
ABSTRACT
With the popularity of mobile computing and social media, various kinds of online event-based social network (EBSN) platforms, such as Meetup, Plancast and Whova, is gaining in prominence. A fundamental task of managing EBSN platforms is to recommend suitable social events to potential users according to the following three factors: distances between events and users, attribute similarities between events and users and friend relationships among users. However, none of existing approaches consider all aforementioned influential factors when they recommend users to proper events. Furthermore, existing recommendation strategies neglect the bottleneck cases on the global recommendation. Thus, it is impossible for the existing recommendation solutions to achieve the optimal utility in real-world scenarios. In this paper, we first formally define the problem of bottleneck-aware social event arrangement (BSEA), which is proven to be NP-hard. To solve the BSEA problem approximately, we devise two greedy-based heuristic algorithms, Greedy and Random+Greedy. In particular, the Random+Greedy algorithm is faster and more effective than the Greedy algorithm in most cases. Finally, we conduct extensive experiments on real and synthetic datasets which verify the efficiency and accuracy of our proposed algorithms.
INDEX TERMS
Heuristic algorithms, Social network services, Greedy algorithms, Algorithm design and analysis, Time complexity, Computer science
CITATION

Y. Tong, R. Meng and J. She, "On bottleneck-aware arrangement for event-based social networks," 2015 31st IEEE International Conference on Data Engineering Workshops (ICDEW), Seoul, South Korea, 2015, pp. 216-223.
doi:10.1109/ICDEW.2015.7129579
160 ms
(Ver 3.3 (11022016))