Abstract

This paper presents a centrality measurement and analysis of the social networks for tracking online community. The tracking of single community in social networks is commonly done using some of the centrality measures employed in social network community tracking. The ability that centrality measures have to determine the relative position of a node within a network has been used in previous research work to track communities in social networks using betweenness, closeness and degree centrality measures. It introduces a new metric K-path centrality, and a randomized algorithm for estimating it, and shows empirically that nodes with high K-path centrality have high node betweenness centrality.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call