Ranking of Closeness Centrality for Large-Scale Social Networks

Authors:
Kazuya Okamoto;Wei Chen;Xiang-Yang Li
Affiliations:
Kyoto University,;Microsoft Research Asia,;Illinois Institute of Technology and Microsoft Research Asia,
Venue:
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Year:
2008

Citing 5
Cited 6

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The anatomy of a large-scale hypertextual Web search engine

WWW7 Proceedings of the seventh international conference on World Wide Web 7
Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
On six degrees of separation in DBLP-DB and more

ACM SIGMOD Record
Approximating betweenness centrality

WAW'07 Proceedings of the 5th international conference on Algorithms and models for the web-graph

k-Centralities: local approximations of global measures based on shortest paths

Proceedings of the 21st international conference companion on World Wide Web
Social network restructuring after a node removal

International Journal of Web Engineering and Technology
Analysing the Use of Ontologies Based on Usage Network

WI-IAT '12 Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 01
Betweenness centrality on GPUs and heterogeneous architectures

Proceedings of the 6th Workshop on General Purpose Processor Using Graphics Processing Units
A generic topology discovery approach for huge social networks

Proceedings of the 5th ACM COMPUTE Conference: Intelligent & scalable system technologies
Incremental closeness centrality for dynamically changing social networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining

Quantified Score

Hi-index	0.00

Visualization

Abstract

Closeness centrality is an important concept in social network analysis. In a graph representing a social network, closeness centrality measures how close a vertex is to all other vertices in the graph. In this paper, we combine existing methods on calculating exact values and approximate values of closeness centrality and present new algorithms to rank the top-kvertices with the highest closeness centrality. We show that under certain conditions, our algorithm is more efficient than the algorithm that calculates the closeness-centralities of all vertices.