A robust method to discover influential users in social networks
- 127 Downloads
Identifying the influential spreaders is an important issue in understanding and controlling the spreading processes in social networks. The key to the influential spreader identification problem is how to evaluate the spreading ability of the nodes. Centralities such as degree, semi-local centrality, betweenness, closeness, k-shell are usually used as evaluation metric. However, we observe that these centralities are sensitive not only to the spreading probability, but also to the network structure. We are not sure which centrality is efficient when we face a new network. In this paper, we propose a robust method named Adjustable multi-Hops Spreading (AHS). In AHS, we refine the influence of a node into direct influence and indirect influence, and then integrate them with a adjustable parameter. The experimental results in both real social networks and artificial networks show that AHS outperforms other centralities in effectiveness, robustness and the distinguish ability.
KeywordsSocial networks Influential nodes Spreading Centrality measure
This work was funded by the Natural Science Foundation of China (61672322, 61672324, 61272240), the Natural Science Foundation of Shandong province (2016ZR E27468, ZR2012FM037) and the Fundamental Research Funds of Shandong University.
Compliance with ethical standards
Conflict of interest
Author Qian Ma declares that she has no conflict of interest. Author Jun Ma declares that he has no conflict of interest.
This article does not contain any studies with human participants performed by any of the authors.
- Boguñá M, Pastor-Satorras R, Daz-Guilera A, Arenas A (2004) Models of social networks based on social distance attachment. Phys Rev E Stat Nonlinear Soft Matter Phys 70(70):148–168Google Scholar
- Dong LI, Zhi-Ming XU, Sheng LI, Liu T, Wang Xiu Wen (2014) A survey on information diffusion in online social networks. Chin J Comput 254(3):31–36Google Scholar
- Leskovec J, Krevl A (2014) SNAP datasets: stanford large network dataset collection. http://snap.stanford.edu/data
- Leskovec J, Kleinberg J, Faloutsos C (2006) Graph evolution: densification and shrinking diameters. Physics 1(1):2Google Scholar
- Lou T, Tang J (2013) Mining structural hole spanners through information diffusion in social networks. In: International conference on World Wide Web, pp 825–836Google Scholar
- Mislove A, Marcon M, Gummadi KP, Druschel P, Bhattacharjee B (2007) Measurement and analysis of online social networks. In: Proceedings of the 5th ACM/usenix internet measurement conference (IMC’07), San Diego, CAGoogle Scholar
- Page L, Brin S, Motwani R, Winograd T (1999) The PageRank citation ranking: bringing order to the web. Stanford InfoLabGoogle Scholar
- Tang L, Liu H (2010) Community detection and mining in social media. Synth Lect Data Min Knowl Disc 2(1):1–137Google Scholar
- Yang L, Qiao Y, Liu Z, Ma J, Li X (2016) Identifying opinion leader nodes in online social networks with a new closeness evaluation algorithm. Soft Comput 1–12Google Scholar