Go to page

Bibliographic Metadata

HellRank: a Hellinger-based centrality measure for bipartite social networks
AuthorTaheri, Seyed Mohammad ; Mahyar, Hamidreza ; Firouzi, Mohammad ; Ghalebi K., Elahe ; Grosu, Radu ; Movaghar, Ali
Published in
Social Network Analysis and Mining, 2017, Vol. 7, Issue 22, page 1-16
PublishedSpringer Vienna, 2017
Document typeJournal Article
Keywords (EN)Bipartite social networks / Top-k central nodes / Hellinger distance / Recommender systems
URNurn:nbn:at:at-ubtuw:3-4235 Persistent Identifier (URN)
 The work is publicly available
HellRank: a Hellinger-based centrality measure for bipartite social networks [2.37 mb]
Abstract (English)

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.

The PDF-Document has been downloaded 6 times.
CC-BY-License (4.0)Creative Commons Attribution 4.0 International License