Influence Maximization Node Mining with Trust Propagation Mechanism

The issue of maximizing influence is one of the hot issues in the study of complex networks. It’s of great significance for understanding the dissemination mechanism of network information and controlling rumor. In recent years, based on the percolation theory, the problem of maximizing the node identification has attracted a lot of attention. However, this method does not consider the influence of the propagation of trust on the maximization of influence. This paper introduces the trust transfer function to depict the phenomenon that trust value and distrust value decreases and increase, respectively, and uses the percolation theory to solve the node joint propagation strength index to excavate the influencer. Experiments show that the proposed algorithm outperforms other heuristic benchmark algorithms.

[1]  J. Friedman,et al.  THE NON-BACKTRACKING SPECTRUM OF THE UNIVERSAL COVER OF A GRAPH , 2007, 0712.0192.

[2]  S. Havlin,et al.  Breakdown of the internet under intentional attack. , 2000, Physical review letters.

[3]  Enrique Herrera-Viedma,et al.  A visual interaction consensus model for social network group decision making with trust propagation , 2017, Knowl. Based Syst..

[4]  Alex Bavelas,et al.  Communication Patterns in Task‐Oriented Groups , 1950 .

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

[6]  Alessandro Vespignani,et al.  Detecting rich-club ordering in complex networks , 2006, physics/0602134.

[7]  Alessandro Vespignani,et al.  Epidemic spreading in scale-free networks. , 2000, Physical review letters.

[8]  Radko Mesiar,et al.  Triangular norms. Position paper I: basic analytical and algebraic properties , 2004, Fuzzy Sets Syst..

[9]  Hernán A. Makse,et al.  Influence maximization in complex networks through optimal percolation , 2015, Nature.

[10]  Pawan Kumar,et al.  Notice of Violation of IEEE Publication Principles The Anatomy of a Large-Scale Hyper Textual Web Search Engine , 2009 .

[11]  Albert-László Barabási,et al.  Error and attack tolerance of complex networks , 2000, Nature.

[12]  K. Hashimoto.  Zeta functions of finite graphs and representations of p-adic groups , 1989 .

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

[14]  Duncan J Watts,et al.  A simple model of global cascades on random networks , 2002, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Lev Muchnik,et al.  Identifying influential spreaders in complex networks , 2010, 1001.5285.

[16]  Mark S. Granovetter.  Threshold Models of Collective Behavior , 1978, American Journal of Sociology.