Title: HellRank: a Hellinger-based centrality measure for bipartite social networks
Language: English
Authors: Taheri, Seyed Mohammad 
Mahyar, Hamidreza 
Firouzi, Mohammad 
Ghalebi K., Elahe 
Grosu, Radu
Movaghar, Ali 
Category: Research Article
Issue Date: 2017
Journal: Social Network Analysis and Mining
ISSN: 1869-5469
Measuring centrality in a social network, especially in bipartite mode, poses many challenges, for example, the requirement of full knowledge of the network topology, and the lack of properly detecting top-k behavioral representative users. To overcome the above mentioned challenges, we propose HellRank, an accurate centrality measure for identifying central nodes in bipartite social networks. HellRank is based on the Hellinger distance between two nodes on the same side of a bipartite network. We theoretically analyze the impact of this distance on a bipartite network and find upper and lower bounds for it. The computation of the HellRank centrality measure can be distributed, by letting each node uses local information only on its immediate neighbors. Consequently, one does not need a central entity that has full knowledge of the network topological structure. We experimentally evaluate the performance of the HellRank measure in correlation with other centrality measures on real-world networks. The results show partial ranking similarity between the HellRank and the other conventional metrics according to the Kendall and Spearman rank correlation coefficient.
Keywords: Bipartite social networks; Top-k central nodes; Hellinger distance; Recommender systems
DOI: 10.1007/s13278-017-0440-7
Library ID: AC15188640
URN: urn:nbn:at:at-ubtuw:3-4235
Organisation: E191 - Institut für Computer Engineering 
Publication Type: Article
Appears in Collections:Article

Files in this item:

Page view(s)

checked on Jul 14, 2021


checked on Jul 14, 2021

Google ScholarTM


This item is licensed under a Creative Commons License Creative Commons