Influence maximization on signed networks under independent cascade model

Influence maximization problem is to find a subset of nodes that can make the spread of influence maximization in a social network. In this work, we present an efficient influence maximization method in signed networks. Firstly, we address an independent cascade diffusion model in the signed network (named SNIC) for describing two opposite types of influence spreading in a signed network. We define the independent propagation paths to simulate the influence spreading in SNIC model. Particularly, we also present an algorithm for constructing the set of spreading paths and computing their probabilities. Based on the independent propagation paths, we define an influence spreading function for a seed as well as a seed set, and prove that the spreading function is monotone and submodular. A greedy algorithm is presented to maximize the positive influence spreading in the signed network. We verify our algorithm on the real-world large-scale networks. Experiment results show that our method significantly outperforms the state-of-the-art methods, particularly can achieve more positive influence spreading.

[1]  A Díaz-Guilera,et al.  Self-similar community structure in a network of human interactions. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[2]  B. Annappa,et al.  A holistic approach to influence maximization in social networks: STORIE , 2017, Appl. Soft Comput..

[3]  Yifei Yuan,et al.  Influence Maximization in Social Networks When Negative Opinions May Emerge and Propagate , 2011, SDM.

[4]  Matthew Richardson,et al.  Mining knowledge-sharing sites for viral marketing , 2002, KDD.

[5]  Wei Chen,et al.  Influence diffusion dynamics and influence maximization in social networks with friend and foe relationships , 2011, WSDM.

[6]  Jacob Goldenberg,et al.  Using Complex Systems Analysis to Advance Marketing Theory Development , 2001 .

[7]  Lan Wang,et al.  Sparse Concordance-assisted Learning for Optimal Treatment Decision , 2018, J. Mach. Learn. Res..

[8]  Jérôme Kunegis,et al.  What is the added value of negative links in online social networks? , 2013, WWW.

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

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

[11]  Mohammad Reza Meybodi,et al.  Minimum positive influence dominating set and its application in influence maximization: a learning automata approach , 2018, Applied Intelligence.

[12]  Michal Karpowicz,et al.  Reprint of: Computational approaches for mining user's opinions on the Web 2.0 , 2015, Inf. Process. Manag..

[13]  Éva Tardos,et al.  Influential Nodes in a Diffusion Model for Social Networks , 2005, ICALP.

[14]  Bin Li,et al.  DeepEye: Link prediction in dynamic networks based on non-negative matrix factorization , 2018, Big Data Min. Anal..

[15]  Li Pan,et al.  Scalable influence blocking maximization in social networks under competitive independent cascade models , 2017, Comput. Networks.

[16]  Weili Wu,et al.  Better approximation algorithms for influence maximization in online social networks , 2015, J. Comb. Optim..

[17]  Xiang Li,et al.  Limiting the Spread of Misinformation While Effectively Raising Awareness in Social Networks , 2015, CSoNet.

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

[19]  Yangyang Yu,et al.  Scalable Influence Maximization in Social Networks Using the Community Discovery Algorithm , 2012, 2012 Sixth International Conference on Genetic and Evolutionary Computing.

[20]  Hassan Haghighi,et al.  INCIM: A community-based algorithm for influence maximization problem under the linear threshold model , 2016, Inf. Process. Manag..

[21]  Maoguo Gong,et al.  Influence maximization in social networks based on discrete particle swarm optimization , 2016, Inf. Sci..

[22]  Shubo Chen,et al.  Influence Maximization on Signed Social Networks with Integrated PageRank , 2015, 2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity).

[23]  Hai Jin,et al.  Scalable influence maximization under independent cascade model , 2017, J. Netw. Comput. Appl..

[24]  Shengchao Qin,et al.  Maximizing influence under influence loss constraint in social networks , 2016, Expert Syst. Appl..

[25]  Dianhui Chu,et al.  Positive influence maximization in signed social networks based on simulated annealing , 2017, Neurocomputing.

[26]  Le Song,et al.  Scalable Influence Maximization for Multiple Products in Continuous-Time Diffusion Networks , 2016, J. Mach. Learn. Res..

[27]  Leonard M. Freeman,et al.  A set of measures of centrality based upon betweenness , 1977 .

[28]  Rakesh Nagi,et al.  Seed activation scheduling for influence maximization in social networks , 2017, Omega.

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

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

[31]  Pablo A. Estévez,et al.  Selecting the Most Influential Nodes in Social Networks , 2007, 2007 International Joint Conference on Neural Networks.

[32]  Ludovic Lietard,et al.  Maximizing positive opinion influence using an evidential approach , 2016, ArXiv.

[33]  Zhen Lin,et al.  Influence maximization in social networks under an independent cascade-based model , 2016 .

[34]  Sule Gündüz Ögüdücü,et al.  Identifying topical influencers on twitter based on user behavior and network topology , 2018, Knowl. Based Syst..

[35]  Gert Sabidussi,et al.  The centrality index of a graph , 1966 .

[36]  Junsong Yuan,et al.  An efficient and effective hop-based approach for influence maximization in social networks , 2018, Social Network Analysis and Mining.

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

[38]  Hideyuki Takada,et al.  Influence Maximization in Signed Social Networks , 2015, WISE.

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

[40]  Shishir Bharathi,et al.  Competitive Influence Maximization in Social Networks , 2007, WINE.

[41]  Jacob Goldenberg,et al.  Talk of the Network: A Complex Systems Look at the Underlying Process of Word-of-Mouth , 2001 .

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

[43]  Paul Resnick,et al.  Follow the reader: filtering comments on slashdot , 2007, CHI.

[44]  Keiichiro Hoashi,et al.  Primitive activity recognition from short sequences of sensory data , 2018, Applied Intelligence.

[45]  Jure Leskovec,et al.  Signed networks in social media , 2010, CHI.

[46]  A. Arenas,et al.  Models of social networks based on social distance attachment. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[47]  Peter H. Reingen,et al.  Social Ties and Word-of-Mouth Referral Behavior , 1987 .

[48]  Przemyslaw Kazienko,et al.  Matching Organizational Structure and Social Network Extracted from Email Communication , 2011, BIS.

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

[50]  Allan Borodin,et al.  Threshold Models for Competitive Influence in Social Networks , 2010, WINE.

[51]  Viktor K. Prasanna,et al.  Social influence computation and maximization in signed networks with competing cascades , 2015, 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[52]  Wei Chen,et al.  Influence Blocking Maximization in Social Networks under the Competitive Linear Threshold Model , 2011, SDM.

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

[54]  Michal Karpowicz,et al.  Computational approaches for mining user's opinions on the Web 2.0 , 2014, Inf. Process. Manag..