A new vertex similarity metric for community discovery: A distance neighbor model

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

Abstract

The hierarchical clustering methods based on vertex similarity can be employed for community discovery. Vertex similarity metric is the most important part of these methods. However, the existing metrics do not perform well compared with the state-of-the-art algorithms. In this paper, we propose a new vertex similarity metric based on distance neighbor model, called Distance Neighbor Ratio Metric (DNRM), for community discovery. DNRM considers both distance and nearby edge density which are essential measures in community structure. Compared with the existing metrics of vertex similarity, DNRM outperforms substantially in community discovery quality and the computing time. The experiments are designed rigorously involving both well-known social networks in real world and computer generated networks. © 2011 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, Y. (2011). A new vertex similarity metric for community discovery: A distance neighbor model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6591 LNAI, pp. 228–237). Springer Verlag. https://doi.org/10.1007/978-3-642-20039-7_23

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