Multi-location Influence Maximization in Location-Based Social Networks

With the development of location-based social networks (LBSNs), location property has been gradually integrated into the influence maximization problem, the key point of which is to bring the users in social networks (online phase) to the product locations for consuming in the real world (offline phase). However, the existing studies considered that a company dependent on the viral marketing only has a product location in the real world and could not suit the situation that there is more than one product location. In this paper, first, we propose a new propagation model, called multiple factors propagation (MFP) model which can work in the situation that there are multiple product locations in the real world. Meanwhile, the definition of multi-location influence maximization (MLIM) problem is presented. Then, we design a hybrid index structure to improve the search efficiency of offline phase, called hybrid inverted R-tree (HIR-tree). Furthermore, we propose the enhanced greedy algorithm for solving MLIM problem. Finally, we conduct a set of experiments to demonstrate the effectiveness and efficiency of enhanced greedy algorithm.

[1]  Wen-Chih Peng,et al.  Modeling User Mobility for Location Promotion in Location-based Social Networks , 2015, KDD.

[2]  Hanan Samet,et al.  Distance browsing in spatial databases , 1999, TODS.

[3]  Mohamed F. Mokbel,et al.  Recommendations in location-based social networks: a survey , 2015, GeoInformatica.

[4]  Yaron Singer,et al.  How to win friends and influence people, truthfully: influence maximization mechanisms for social networks , 2012, WSDM '12.

[5]  Sourav S. Bhowmick,et al.  CINEMA: conformity-aware greedy algorithm for influence maximization in online social networks , 2013, EDBT '13.

[6]  Laks V. S. Lakshmanan,et al.  CELF++: optimizing the greedy algorithm for influence maximization in social networks , 2011, WWW.

[7]  Shuai Xu,et al.  Location-Based Influence Maximization in Social Networks , 2015, CIKM.

[8]  Kian-Lee Tan,et al.  Efficient location-aware influence maximization , 2014, SIGMOD Conference.

[9]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[10]  Aziz Mohaisen,et al.  Keep your friends close: Incorporating trust into social network-based Sybil defenses , 2011, 2011 Proceedings IEEE INFOCOM.

[11]  Andreas Krause,et al.  Cost-effective outbreak detection in networks , 2007, KDD '07.

[12]  Li Guo,et al.  On the Upper Bounds of Spread for Greedy Algorithms in Social Network Influence Maximization , 2015, IEEE Transactions on Knowledge and Data Engineering.

[13]  Xuemin Lin,et al.  Efficient Distance-Aware Influence Maximization in Geo-Social Networks , 2017, IEEE Transactions on Knowledge and Data Engineering.

[14]  Albert-László Barabási,et al.  Understanding individual human mobility patterns , 2008, Nature.

[15]  Hua Lu,et al.  Finding top-k local users in geo-tagged social media data , 2015, 2015 IEEE 31st International Conference on Data Engineering.

[16]  Christian S. Jensen,et al.  Efficient Retrieval of the Top-k Most Relevant Spatial Web Objects , 2009, Proc. VLDB Endow..

[17]  Wei Ou,et al.  Extracting User Interests from Graph Connections for Machine Learning in Location-Based Social Networks , 2014, MLSDA'14.