An efficient probabilistic approach to network community mining

Authors:
Bo Yang;Jiming Liu
Affiliations:
College of Computer Science and Technology, Jilin University, Changchun, P.R. China;School of Computer Science, University of Windsor, Windsor, Ontario, Canada
Venue:
RSKT'07 Proceedings of the 2nd international conference on Rough sets and knowledge technology
Year:
2007

Citing 4
Cited 1

Authoritative sources in a hyperlinked environment

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Self-Organization and Identification of Web Communities

Computer
Email as spectroscopy: automated discovery of community structure within organizations

Communities and technologies

Survey: Graph clustering

Computer Science Review

Quantified Score

Hi-index	0.00

Visualization

Abstract

A network community refers to a group of vertices within which the links are dense but between which they are sparse. A network community mining problem (NCMP) is the problem to find all such communities from a given network. A wide variety of applications can be formalized as NCMPs such as complex network analysis, Web pages clustering as well as image segmentation. How to solve a NCMP efficiently and accurately remains an open challenge. Distinct from other works, the paper addresses the problem from a probabilistic perspective and presents an efficient algorithm that can linearly scale to the size of networks based on a proposed Markov random walk model. The proposed algorithm is strictly tested against several benchmark networks including a semantic social network. The experimental results show its good performance with respect to both speed and accuracy.