Identifying influential nodes in social networks via community structure and influence distribution difference

Abstract This paper aims to effectively solve the problem of the influence maximization in social networks. For this purpose, an influence maximization method that can identify influential nodes via the community structure and the influence distribution difference is proposed. Firstly, the network embedding-based community detection approach is developed, by which the social network is divided into several high-quality communities. Secondly, the solution of influence maximization is composed of the candidate stage and the greedy stage. The candidate stage is to select candidate nodes from the interior and the boundary of each community using a heuristic algorithm, and the greedy stage is to determine seed nodes with the largest marginal influence increment from the candidate set through the sub-modular property-based Greedy algorithm. Finally, experimental results demonstrate the superiority of the proposed method compared with existing methods, from which one can further find that our work can achieve a good tradeoff between the influence spread and the running time.

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

[2]  M. McPherson,et al.  Birds of a Feather: Homophily in Social Networks , 2001 .

[3]  Shaojie Tang,et al.  Adaptive Influence Maximization in Dynamic Social Networks , 2015, IEEE/ACM Transactions on Networking.

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

[5]  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).

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

[7]  Chenquan Gan,et al.  Sparse attention based separable dilated convolutional neural network for targeted sentiment analysis , 2020, Knowl. Based Syst..

[8]  Ye Yuan,et al.  An on-line sequential learning method in social networks for node classification , 2015, Neurocomputing.

[9]  Zufan Zhang,et al.  Social tie-driven content priority scheme for D2D communications , 2019, Inf. Sci..

[10]  Kyomin Jung,et al.  IRIE: Scalable and Robust Influence Maximization in Social Networks , 2011, 2012 IEEE 12th International Conference on Data Mining.

[11]  Esmaeil Bagheri,et al.  An efficient and fast influence maximization algorithm based on community detection , 2016, 2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD).

[12]  Stratis Ioannidis,et al.  On the strength of weak ties in mobile social networks , 2009, SNS '09.

[13]  Chenquan Gan,et al.  Multimodality Fusion for Node Classification in D2D Communications , 2018, IEEE Access.

[14]  Xuyuan Kang,et al.  High-Accuracy Entity State Prediction Method Based on Deep Belief Network Toward IoT Search , 2019, IEEE Wireless Communications Letters.

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

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

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

[18]  Dan Feldman,et al.  k-Means Clustering of Lines for Big Data , 2019, NeurIPS.

[19]  Xiaobo Zhou,et al.  Preoperative Prediction of Axillary Lymph Node Metastasis in Breast Cancer Using Mammography-Based Radiomics Method , 2019, Scientific Reports.

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

[21]  Zibin Zheng,et al.  Identifying Influential Individuals on Large-Scale Social Networks: A Community Based Approach , 2018, IEEE Access.

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

[23]  Hong Wen,et al.  P2P networks monitoring based on the social network analysis and the topological potential , 2014, 2014 IEEE Conference on Communications and Network Security.

[24]  Wei Chen,et al.  IMRank: influence maximization via finding self-consistent ranking , 2014, SIGIR.

[25]  Xiang Cheng,et al.  Community-based seeds selection algorithm for location aware influence maximization , 2018, Neurocomputing.

[26]  Chenquan Gan,et al.  The Impact of User Behavior on Information Diffusion in D2D Communications: A Discrete Dynamical Model , 2018, Discrete Dynamics in Nature and Society.

[27]  Mao Ye,et al.  Exploring social influence for recommendation: a generative model approach , 2012, SIGIR '12.

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

[29]  Xiaomei Guo,et al.  Construction on Framework of Rumor Detection and Warning System Based on Web Mining Technology , 2018, 2018 IEEE/ACIS 17th International Conference on Computer and Information Science (ICIS).

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

[31]  Hang Shi,et al.  A Feature-Based Learning System for Internet of Things Applications , 2019, IEEE Internet of Things Journal.

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

[33]  Yang Zou,et al.  Textual sentiment analysis via three different attention convolutional neural networks and cross-modality consistent regression , 2018, Neurocomputing.

[34]  Yuchen Li,et al.  Influence Maximization on Social Graphs: A Survey , 2018, IEEE Transactions on Knowledge and Data Engineering.