An Influence Maximization Method Based on Effective K-Core for Social Networks
Abstract
Neighbours usually play an important role in the measurements of node influence. The number of neigbhours to a node is called its degree, which is a frequently adopted centrality. In order to solve the problem that traditional degree-based influence maximization algorithms fail to identify effective neighbours, this paper proposes a K-core based social network influence maximization method named K-core algorithm (EKCA). The proposed method first introduces the concept of K-core. Then it calculates the core of nodes based on K-core decomposition. Last, it uses coreness instead of degree as a standard to select effective neighbours. The proposed method could describe the position of nodes in the network more accurately, and thus better for the influence maximization problem. Experiments on networks with various sizes show that the proposed method can select nodes that spread more influence than the degree-based influence maximization algorithms.
Downloads
References
LIU Quan, ZHANG Ming. Domain based influence maximization and viral marketing [J].Journal of Chinese Information Processing,2017,31 (3):118-124.
ZHENG Zhiyun, FU Yuan, LI Lun, et al. Influence algorithm based on center weighted link in social networks [J].Computer Engineering and Design,2017,38 (1):110-115.
HU Min, SUN Xinran, HUANG Hongcheng. Edge-cover algorithm for influence maximization in social network [J].Journal of Frontiers of Computer Science and Technology,2017,11(5):720-731.
Arora A, Galhotra S, Ranu S. Debunking the myths of influence maximization: An in-depth benchmarking study [C]//Proceedings of the ACM International Conference on Management of Data,2017:651-666.
Kemple D, Kleinberg J, Tardos E. Maximizing the spread of influence through a social network [J]. Theory of Computing,2015,11 (4):105-147.
Tong G, Wu W, Tang S, et al. Adaptive influence maximization in dynamic social networks [J]. IEEE/ ACM Transactions on Networking,2017,25 (1):112-125.
Cheng S, Shen H, Huang J, et al. StaticGreedy: Solving the scalability-accuracy dilemma in influence maximization [C]//Proceedings of the 22nd ACM International Conference on Information & Knowledge Management,2013:509-518.
Rabade R, Mishra N, Sharma S. Survey of influential user identification techniques in online social networks [M]. Cham: Springer International Publishing,2014:359-370.
ZHANG Yingqing, LUO Ming, LI Xing. A review on the node influence and influence maximization of complex networks [J]. Journal of Modern Information,2017,37 (1):160-164.
Liu D, Jing Y, Zhao J, et al. A fast and efficient algorithm for mining top-k nodes in complex networks [J]. SciRep,2017,7:43330.
Nguyen DL, Nguyen TH, Do TH, et al. Probability-based multi-hop diffusion method for influence maximization in social networks [J]. Wireless Personal Communications, 2017, 93(4): 903-916.
YANG Shuxin,LIU Chenghui,LU Jihua.Two stages of heuristic based algorithm for influence maximization in social network [J]. Journal of Chinese Computer Systems, 2017, 38(10): 2268-2274.
Seidman S B. Network structure and minimum degree Social Networks,1983,5(3):269-287.
Radicchi F, Castellano C. Fundamental difference between superblockers and superspreaders in networks [J]. Phys Rev E, 2017, 95(1-1): 012318.
Mark E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Phys. Rev. E, 74(3), 2006.
Duncan J. Watts and Steven H. Strogatz. Collective dynamics of 'small-world' networks. Nature, 393(1):440–442, 1998.
Leskovec J, Kleinberg J and Faloutsos C. Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 1(1), 2007.
Marián Boguñá, Romualdo Pastor-Satorras, Albert Díaz-Guilera, and Alex Arenas. Models of social networks based on social distance attachment. Phys. Rev. E, 70(5):056122, 2004.
Copyright (c) 2021 IJRDO - Journal of Computer Science Engineering (ISSN: 2456-1843)
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
Author(s) and co-author(s) jointly and severally represent and warrant that the Article is original with the author(s) and does not infringe any copyright or violate any other right of any third parties, and that the Article has not been published elsewhere. Author(s) agree to the terms that the IJRDO Journal will have the full right to remove the published article on any misconduct found in the published article.
