A Novel Centrality for Finding Key Persons in a Social Network by the Bi-Directional Influence Map

被引:1
作者
Chen, Chin-Yi [1 ]
Huang, Jih-Jeng [2 ]
机构
[1] Chung Yuan Christian Univ, Dept Business Adm, 200 Chung Pei Rd, Taoyuan 320, Taiwan
[2] Soochow Univ, Dept Comp Sci & Informat Management, 56 Kueiyang St,Sect 1, Taipei 100, Taiwan
来源
SYMMETRY-BASEL | 2020年 / 12卷 / 10期
关键词
centrality; social network; PageRank-based algorithms; transition functions; synthesized index;
D O I
10.3390/sym12101747
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Symmetry is one of the important properties of Social networks to indicate the co-existence relationship between two persons, e.g., friendship or kinship. Centrality is an index to measure the importance of vertices/persons within a social network. Many kinds of centrality indices have been proposed to find prominent vertices, such as the eigenvector centrality and PageRank algorithm. PageRank-based algorithms are the most popular approaches to handle this task, since they are more suitable for directed networks, which are common situations in social media. However, the realistic problem in social networks is that the process to find true important persons is very complicated, since we should consider both how the influence of a vertex affects others and how many others follow a given vertex. However, past PageRank-based algorithms can only reflect the importance on the one side and ignore the influence on the other side. In addition, past algorithms only view the transition from one status to the next status as a linear process without considering more complicated situations. In this paper, we develop a novel centrality to find key persons within a social network by a proposed synthesized index which accounts for both the inflow and outflow matrices of a vertex. Besides, we propose different transition functions to represent the relationship from status to status. The empirical studies compare the proposed algorithms with the conventional algorithms and show the differences and flexibility of the proposed algorithm.
引用
收藏
页码:1 / 17
页数:18
相关论文
共 35 条
[1]  
Ahmed Hussein Moselhy Sayed, 2018, International Journal of Customer Relationship Marketing and Management, V9, P13, DOI 10.4018/IJCRMM.2018070102
[2]   Analysis of Online Social Network Connections for Identification of Influential Users: Survey and Open Research Issues [J].
Al-Garadi, Mohammed Ali ;
Varathan, Kasturi Dewi ;
Ravana, Sri Devi ;
Ahmed, Ejaz ;
Mujtaba, Ghulam ;
Khan, Muhammad Usman Shahid ;
Khan, Samee U. .
ACM COMPUTING SURVEYS, 2018, 51 (01)
[3]   Two new topological indices based on graph adjacency matrix eigenvalues and eigenvectors [J].
Alberto Rodriguez-Velazquez, Juan ;
Balaban, Alexandru T. .
JOURNAL OF MATHEMATICAL CHEMISTRY, 2019, 57 (04) :1053-1074
[4]   Strategies for the diffusion of innovations on social networks [J].
Alkemade F. ;
Castaldi C. .
Computational Economics, 2005, 25 (1-2) :3-23
[5]  
[Anonymous], 2013, P 1 ACM C ONL SOC NE
[6]  
Axelord R., 1976, STRUCTURE DECISION C
[7]   AN IMPROVED INDEX OF CENTRALITY [J].
BEAUCHAMP, MA .
BEHAVIORAL SCIENCE, 1965, 10 (02) :161-163
[8]  
Ben Jabeur L, 2012, LECT NOTES COMPUT SC, V7608, P111, DOI 10.1007/978-3-642-34109-0_12
[9]  
Brin S., 1999, P 7 INT WORLD WIDE W
[10]   What Do Centrality Measures Measure in Psychological Networks? [J].
Bringmann, Laura F. ;
Elmer, Timon ;
Epskamp, Sacha ;
Krause, Robert W. ;
Schoch, David ;
Wichers, Marieke ;
Wigman, Johanna T. W. ;
Snippe, Evelien .
JOURNAL OF ABNORMAL PSYCHOLOGY, 2019, 128 (08) :892-903