Community-diversified influence maximization in social networks

Abstract To meet the requirement of social influence analytics in various applications, the problem of influence maximization has been studied in recent years. The aim is to find a limited number of nodes (i.e., users) which can activate (i.e. influence) the maximum number of nodes in social networks. However, the community diversity of influenced users is largely ignored even though it has unique value in practice. For example, the higher community diversity reduces the risk of marketing campaigns as you should not put all your eggs in one basket; the diversity can also prolong the effect of a marketing campaign in the future promotion. Motivated by this observation, this paper investigates Community-diversified Influence Maximization (CDIM) problem to efficiently find k nodes such that, if a message is initiated and spread by the k nodes, the number as well as the community diversity of the activated nodes will be maximized at the end of propagation process. This work proposes a metric to measure the community-diversified influence and addresses a series of computational challenges. Two algorithms and an innovative CPSP-Tree index have been developed. This study also investigates the situation that community definition is not specified. The effectiveness and efficiency of the proposed solutions have been verified through extensive experimental studies on five real-world social network datasets.

[1]  Jeffrey Xu Yu,et al.  Efficient Core Maintenance in Large Dynamic Graphs , 2012, IEEE Transactions on Knowledge and Data Engineering.

[2]  Wei Chen,et al.  Efficient Topic-aware Influence Maximization Using Preprocessing , 2014, ArXiv.

[3]  Mikkel Thorup.  Integer priority queues with decrease key in constant time and the single source shortest paths problem , 2004, J. Comput. Syst. Sci..

[4]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[5]  Meng Wang,et al.  PINOCCHIO: Probabilistic Influence-Based Location Selection over Moving Objects , 2016, IEEE Transactions on Knowledge and Data Engineering.

[6]  Kian-Lee Tan,et al.  Real-time Targeted Influence Maximization for Online Advertisements , 2015, Proc. VLDB Endow..

[7]  Jian Cao,et al.  Distributed shortest path query processing on dynamic road networks , 2017, The VLDB Journal.

[8]  Anthony K. H. Tung,et al.  BROAD: Diversified Keyword Search in Databases , 2011, Proc. VLDB Endow..

[9]  Evaggelia Pitoura,et al.  Search result diversification , 2010, SGMD.

[10]  Kai Zheng,et al.  Finding Alternative Shortest Paths in Spatial Networks , 2012, TODS.

[11]  Gao Cong,et al.  Influence Maximization in Trajectory Databases , 2017, IEEE Transactions on Knowledge and Data Engineering.

[12]  Jean-Loup Guillaume,et al.  Fast unfolding of community hierarchies in large networks , 2008, ArXiv.

[13]  Yu Wang,et al.  Community-based greedy algorithm for mining top-K influential nodes in mobile social networks , 2010, KDD.

[14]  Jianxin Li,et al.  Personalized Influential Topic Search via Social Network Summarization , 2016, IEEE Trans. Knowl. Data Eng..

[15]  Divesh Srivastava,et al.  DivDB: A System for Diversifying Query Results , 2011, Proc. VLDB Endow..

[16]  Jinhui Tang,et al.  Online Topic-Aware Influence Maximization , 2015, Proc. VLDB Endow..

[17]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Dong Xu,et al.  Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond , 2014, IEEE Transactions on Knowledge and Data Engineering.

[19]  Pietro Liò,et al.  Towards real-time community detection in large networks. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Enrico Gregori,et al.  Parallel $(k)$-Clique Community Detection on Large-Scale Networks , 2013, IEEE Transactions on Parallel and Distributed Systems.

[21]  Kian-Lee Tan,et al.  Discovering Your Selling Points: Personalized Social Influential Tags Exploration , 2017, SIGMOD Conference.

[22]  Meng Wang,et al.  Community Detection in Social Networks: An In-depth Benchmarking Study with a Procedure-Oriented Framework , 2015, Proc. VLDB Endow..

[23]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[24]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.