Maximizing the Spread of Positive Influence Under LT-MLA Model

Since the steady development of online social networks, it has resulted in wide-spread research works in the social network analytical areas, especially in the area of influence maximization. Previous works study the influence propagation process based on the social influence model. But traditional influence models ignore some important aspect of influence propagation. The drawbacks of the models are the simplistic influence diffusion process, and the models lack attitude states and capability to capture the interaction between users. To address these problems, we modify Linear Threshold model based on multi-level attitude and users’ interaction, which is proposed modeling the positive and negative attitude towards an entity in the signed social network and the effect of interaction relationship between users. Then we propose the LT-MLA greedy algorithm to solve the positive influence maximization problem. Finally, we conducted experiments on three real-world data sets to select initial k seed with the positive attitude. The results show that the proposed solution in this paper performs better than other heuristic algorithms.

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

[2]  Dragomir R. Radev,et al.  Extracting Signed Social Networks from Text , 2012, TextGraphs@ACL.

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

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

[5]  Charu C. Aggarwal,et al.  A Survey of Signed Network Mining in Social Media , 2015, ACM Comput. Surv..

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

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

[8]  Weili Wu,et al.  Efficient influence spread estimation for influence maximization under the linear threshold model , 2014, Computational Social Networks.

[9]  My T. Thai,et al.  Maximizing the Spread of Positive Influence in Online Social Networks , 2013, 2013 IEEE 33rd International Conference on Distributed Computing Systems.

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

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

[12]  Jure Leskovec,et al.  Predicting positive and negative links in online social networks , 2010, WWW '10.

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

[14]  Dimitrios Gunopulos,et al.  Finding effectors in social networks , 2010, KDD.

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

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

[17]  Weili Wu,et al.  Influence-based community partition for social networks , 2014, Computational Social Networks.

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

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