Mining hierarchical communities from complex networks using distance-based similarity

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Community structure is one of the most important topological properties of complex networks, in which the intra-group links are very dense, but the inter-group links are quite sparse. Although there exists many works with regard to community mining, few of them studied the connections between the local distance among nodes and the global community structures of networks. In this work, we have studied their connection and established a corresponding heuristics depicting such a connection between local distance and community structure. On the basis of the heuristic, we have proposed a distance-based similarity measure as well as a novel community mining algorithm DSA. The DSA has been rigorously validated and tested against several benchmark networks. The experimental results show that the DSA is able to accurately discovery the potential communities with their hierarchical structures from real-world networks. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, Z., & Yang, B. (2011). Mining hierarchical communities from complex networks using distance-based similarity. Studies in Computational Intelligence, 369, 185–196. https://doi.org/10.1007/978-3-642-22732-5_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free