A fast algorithm for finding most influential people based on the linear threshold model

A new algorithm, named ComPath, is proposed based on the linear threshold model.We make use of structural communities of the input network.Experimental evaluations are carried out by use of NetHEPT and Epinion datasets.ComPath is faster and more efficient than the state of the art algorithms. Finding the most influential people is an NP-hard problem that has attracted many researchers in the field of social networks. The problem is also known as influence maximization and aims to find a number of people that are able to maximize the spread of influence through a target social network. In this paper, a new algorithm based on the linear threshold model of influence maximization is proposed. The main benefit of the algorithm is that it reduces the number of investigated nodes without loss of quality to decrease its execution time. Our experimental results based on two well-known datasets show that the proposed algorithm is much faster and at the same time more efficient than the state of the art algorithms.

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

[2]  Duncan J. Watts,et al.  Everyone's an influencer: quantifying influence on twitter , 2011, WSDM '11.

[3]  Sergey Brin,et al.  The Anatomy of a Large-Scale Hypertextual Web Search Engine , 1998, Comput. Networks.

[4]  Jinha Kim,et al.  Scalable and parallelizable processing of influence maximization for large-scale social networks? , 2013, 2013 IEEE 29th International Conference on Data Engineering (ICDE).

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

[6]  Y. Narahari,et al.  A Shapley Value-Based Approach to Discover Influential Nodes in Social Networks , 2011, IEEE Transactions on Automation Science and Engineering.

[7]  Enhong Chen,et al.  Linear Computation for Independent Social Influence , 2013, 2013 IEEE 13th International Conference on Data Mining.

[8]  Takuya Akiba,et al.  Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations , 2014, AAAI.

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

[10]  Qi He,et al.  TwitterRank: finding topic-sensitive influential twitterers , 2010, WSDM '10.

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

[12]  Li Guo,et al.  An upper bound based greedy algorithm for mining top-k influential nodes in social networks , 2014, WWW '14 Companion.

[13]  Masahiro Kimura,et al.  Tractable Models for Information Diffusion in Social Networks , 2006, PKDD.

[14]  Laks V. S. Lakshmanan,et al.  Learning influence probabilities in social networks , 2010, WSDM '10.

[15]  Laks V. S. Lakshmanan,et al.  SIMPATH: An Efficient Algorithm for Influence Maximization under the Linear Threshold Model , 2011, 2011 IEEE 11th International Conference on Data Mining.

[16]  K. Sycara,et al.  Polarity Related Influence Maximization in Signed Social Networks , 2014, PloS one.

[17]  Li Guo,et al.  Item-Based Top-k Influential User Discovery in Social Networks , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

[18]  Matthew Richardson,et al.  Mining the network value of customers , 2001, KDD '01.

[19]  Matthew Richardson,et al.  Trust Management for the Semantic Web , 2003, SEMWEB.

[20]  Laks V. S. Lakshmanan,et al.  A Data-Based Approach to Social Influence Maximization , 2011, Proc. VLDB Endow..

[21]  Mehdi Shajari,et al.  Defending recommender systems by influence analysis , 2013, Information Retrieval.

[22]  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.

[23]  Ching-Yung Lin,et al.  Personalized recommendation driven by information flow , 2006, SIGIR.

[24]  Andrea Lancichinetti,et al.  Detecting the overlapping and hierarchical community structure in complex networks , 2008, 0802.1218.

[25]  Wei Chen,et al.  Scalable influence maximization for prevalent viral marketing in large-scale social networks , 2010, KDD.

[26]  Weili Wu,et al.  The complexity of influence maximization problem in the deterministic linear threshold model , 2012, J. Comb. Optim..

[27]  Jingyu Zhou,et al.  Preference-Based Top-K Influential Nodes Mining in Social Networks , 2011, 2011IEEE 10th International Conference on Trust, Security and Privacy in Computing and Communications.

[28]  Wei Chen,et al.  Efficient influence maximization in social networks , 2009, KDD.

[29]  Enhong Chen,et al.  On Approximation of Real-World Influence Spread , 2012, ECML/PKDD.

[30]  Yifei Yuan,et al.  Scalable Influence Maximization in Social Networks under the Linear Threshold Model , 2010, 2010 IEEE International Conference on Data Mining.

[31]  Jiangtao Cui,et al.  Conformity-aware influence maximization in online social networks , 2014, The VLDB Journal.

[32]  Steve Gregory,et al.  Finding overlapping communities in networks by label propagation , 2009, ArXiv.

[33]  Xiaoming Liu,et al.  SLPA: Uncovering Overlapping Communities in Social Networks via a Speaker-Listener Interaction Dynamic Process , 2011, 2011 IEEE 11th International Conference on Data Mining Workshops.

[34]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..