A Core-based Community Detection Algorithm for Networks

Community detection is now playing a significant role in the discovery of underlying structures of social networks. This problem has been proved to be very hard and not been satisfactorily solved yet. Most of the algorithms proposed so far tend to maximize the number of intra-cluster edges, but igno...

Full description

Saved in:
Bibliographic Details
Published in2010 International Conference on Computational Aspects of Social Networks pp. 607 - 610
Main Authors Wei Wang, Chunping Li
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2010
Subjects
Online AccessGet full text
ISBN9781424487851
1424487854
DOI10.1109/CASoN.2010.138

Cover

More Information
Summary:Community detection is now playing a significant role in the discovery of underlying structures of social networks. This problem has been proved to be very hard and not been satisfactorily solved yet. Most of the algorithms proposed so far tend to maximize the number of intra-cluster edges, but ignore the importance of the core nodes within clusters. In contrast, this paper proposes a core-based algorithm that makes use of these core nodes. It first computes the core values of each vertex, and then gradually chooses the vertex with the maximum core value and performs a cluster expansion based on a structural similarity measurement. Evaluation using both real and synthetic datasets demonstrates that our method is not only efficient but also effective.
ISBN:9781424487851
1424487854
DOI:10.1109/CASoN.2010.138