By Topic

Evaluation repeated random walks in community detection of social networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Bing-Jing Cai ; School of Computing and Mathematics, Computer Sciences Research Institute University of Ulster N. Ireland, UK ; Hai-Ying Wang ; Hui-Ru Zheng ; Hui Wang

The repeated random walks algorithm (RRW) is a graph clustering algorithm proposed recently. RRW has been shown to achieve better performance on functional module discovery in protein-protein interaction networks than Markov Clustering Algorithm (MCL). There is however little work applying RRW to community detection in social networks. We ran RRW on some real-world social networks that are well-documented in the literature. We then analyzed the impact of different parameters on the quality of clustering, by using a set of cluster metrics. We also compared RRW with two other random walk based graph clustering algorithms. Our experiments showed that the RRW algorithm achieved higher precision but lower modularity. The experiments also revealed some weaknesses of the RRW algorithm, such as higher running cost, and “discarding nodes” method in its post-process stage, which greatly affects the quality of clustering.

Published in:

2010 International Conference on Machine Learning and Cybernetics  (Volume:4 )

Date of Conference:

11-14 July 2010