Mining Top K Spread Sources for a Specific Topic and a Given Node

In social networks, nodes (or users) interested in specific topics are often influenced by others. The influence is usually associated with a set of nodes rather than a single one. An interesting but challenging task for any given topic and node is to find the set of nodes that represents the source or trigger for the topic and thus identify those nodes that have the greatest influence on the given node as the topic spreads. We find that it is an NP-hard problem. This paper proposes an effective framework to deal with this problem. First, the topic propagation is represented as the Bayesian network. We then construct the propagation model by a variant of the voter model. The probability transition matrix (PTM) algorithm is presented to conduct the probability inference with the complexity O(θ3log2θ), while θ is the number nodes in the given graph. To evaluate the PTM algorithm, we conduct extensive experiments on real datasets. The experimental results show that the PTM algorithm is both effective and efficient.

[1]  Jure Leskovec,et al.  On the Convexity of Latent Social Network Inference , 2010, NIPS.

[2]  Ioannis Katakis,et al.  Social Voting Advice Applications—Definitions, Challenges, Datasets and Evaluation , 2014, IEEE Transactions on Cybernetics.

[3]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[4]  Masahiro Kimura,et al.  Extracting influential nodes on a social network for information diffusion , 2009, Data Mining and Knowledge Discovery.

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

[6]  E. David,et al.  Networks, Crowds, and Markets: Reasoning about a Highly Connected World , 2010 .

[7]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[8]  Jimeng Sun,et al.  Social influence analysis in large-scale networks , 2009, KDD.

[9]  Wanyuan Wang,et al.  Community-Aware Task Allocation for Social Networked Multiagent Systems , 2014, IEEE Transactions on Cybernetics.

[10]  Rajeev Motwani,et al.  The PageRank Citation Ranking : Bringing Order to the Web , 1999, WWW 1999.

[11]  Jon M. Kleinberg,et al.  Feedback effects between similarity and social influence in online communities , 2008, KDD.

[12]  Sebastián A. Ríos,et al.  Topic-based social network analysis for virtual communities of interests in the Dark Web , 2010, ISI-KDD '10.

[13]  Dong Xu,et al.  Time Constrained Influence Maximization in Social Networks , 2012, 2012 IEEE 12th International Conference on Data Mining.

[14]  Jure Leskovec,et al.  Modeling Information Diffusion in Implicit Networks , 2010, 2010 IEEE International Conference on Data Mining.

[15]  Anis Yazidi,et al.  Learning-Automaton-Based Online Discovery and Tracking of Spatiotemporal Event Patterns , 2013, IEEE Transactions on Cybernetics.

[16]  Jure Leskovec,et al.  Inferring networks of diffusion and influence , 2010, KDD.

[17]  Éva Tardos,et al.  Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..

[18]  Masahiro Kimura,et al.  Blocking links to minimize contamination spread in a social network , 2009, TKDD.

[19]  Ravi Kumar,et al.  Influence and correlation in social networks , 2008, KDD.

[20]  Eyal Even-Dar,et al.  A note on maximizing the spread of influence in social networks , 2007, Inf. Process. Lett..

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

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

[23]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[24]  Jiawei Han,et al.  Mining topic-level influence in heterogeneous networks , 2010, CIKM.

[25]  Jure Leskovec,et al.  Meme-tracking and the dynamics of the news cycle , 2009, KDD.

[26]  Michael R. Lyu,et al.  Mining social networks using heat diffusion processes for marketing candidates selection , 2008, CIKM '08.

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

[28]  Aristides Gionis,et al.  Sparsification of influence networks , 2011, KDD.