A hybrid node ranking technique for finding influential nodes in complex social networks

被引:4
作者
Kanwar, Kushal [1 ]
Kaushal, Sakshi [1 ]
Kumar, Harish [1 ]
机构
[1] Panjab Univ, Chandigarh, India
关键词
Technology infrastructure; Author influence; Complex networks; Hybrid ranking; Node ranking; Spreading capability; SPREADERS; CENTRALITY; IDENTIFICATION;
D O I
10.1108/LHT-01-2019-0019
中图分类号
G25 [图书馆学、图书馆事业]; G35 [情报学、情报工作];
学科分类号
1205 ; 120501 ;
摘要
Purpose In today's digital era, data pertaining to scientific research have attracted considerable attention of researchers. Data of scientific publications can be modeled in the form of networks such as citation networks, co-citation networks, collaboration networks, and others. Identification and ranking of important nodes in such networks is useful in many applications, such as finding most influential papers, most productive researchers, pattern of citation, and many more. The paper aims to discuss this issue. Design/methodology/approach A number of methods are available in literature for node ranking, and K-shell decomposition is one such method. This method categorizes nodes in different groups based on their topological position. The shell number of a node provides useful insights about the node's importance in the network. It has been found that shells produced by the K-shell method need to be further refined to quantify the influence of the nodes aptly. In this work, a method has been developed, which ranks nodes by taking the core(s) as the origin and second-order neighborhood of a node as its immediate sphere of influence. Findings It is found that the performance of the proposed technique is either comparable or better than other methods in terms of correctness and accuracy. In case of assigning different ranks to nodes, the performance of the proposed technique is far more superior to existing methods. The proposed method can be used to rank authors, research articles, and fields of research. Originality/value The proposed method ranks nodes by their global position in a network as well as their local sphere of information. It leads to better quantification of a node's impact. This method is found to be better in terms of accuracy and correctness. In case of assigning different ranks to nodes, the performance of the proposed technique is far more superior to existing methods.
引用
收藏
页码:98 / 114
页数:17
相关论文
共 33 条
[1]   Identifying and ranking influential spreaders in complex networks by neighborhood coreness [J].
Bae, Joonhyun ;
Kim, Sangwook .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2014, 395 :549-559
[2]   Complex networks: Structure and dynamics [J].
Boccaletti, S. ;
Latora, V. ;
Moreno, Y. ;
Chavez, M. ;
Hwang, D. -U. .
PHYSICS REPORTS-REVIEW SECTION OF PHYSICS LETTERS, 2006, 424 (4-5) :175-308
[3]   Identifying sets of key players in a social network [J].
Borgatti S.P. .
Computational & Mathematical Organization Theory, 2006, 12 (1) :21-34
[4]  
Borgatti SP, 1999, SOC NETWORKS, V21, P375
[5]   Identifying influential nodes in complex networks [J].
Chen, Duanbing ;
Lu, Linyuan ;
Shang, Ming-Sheng ;
Zhang, Yi-Cheng ;
Zhou, Tao .
PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2012, 391 (04) :1777-1787
[6]   PageRank for Ranking Authors in Co-citation Networks [J].
Ding, Ying ;
Yan, Erjia ;
Frazho, Arthur ;
Caverlee, James .
JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE AND TECHNOLOGY, 2009, 60 (11) :2229-2243
[7]  
Erdos P., 1960, B INT STATIST INST, V5, P17
[8]  
Erdos P., 1959, Publicationes Mathematicae Debrecen, V6, P290, DOI DOI 10.5486/PMD.1959.6.3-4.12
[9]   CENTRALITY IN SOCIAL NETWORKS CONCEPTUAL CLARIFICATION [J].
FREEMAN, LC .
SOCIAL NETWORKS, 1979, 1 (03) :215-239
[10]   SET OF MEASURES OF CENTRALITY BASED ON BETWEENNESS [J].
FREEMAN, LC .
SOCIOMETRY, 1977, 40 (01) :35-41