Common Neighborhood Sub-graph Density as a Similarity Measure for Community Detection

Authors:
Yoonseop Kang;Seungjin Choi
Affiliations:
Department of Computer Science, Pohang University of Science and Technology, Pohang, Korea 790-784;Department of Computer Science, Pohang University of Science and Technology, Pohang, Korea 790-784
Venue:
ICONIP '09 Proceedings of the 16th International Conference on Neural Information Processing: Part I
Year:
2009

Citing 0
Cited 3

Group behavior metrics for p2p botnet detection

ICICS'12 Proceedings of the 14th international conference on Information and Communications Security
Community detection in social networks through similarity virtual networks

Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining
Musical recommendations and personalization in a social network

Proceedings of the 7th ACM conference on Recommender systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Community detection in networks involves grouping nodes on a graph into clusters such that connections between groups are sparse while nodes within groups are densely connected. Despite the success of clustering based community detection methods, there have been few efforts to devise similarity metrics between nodes for clustering algorithms that measures the likeliness of two nodes belonging to the same community. In this paper we present a new similarity measure based on the density of a sub-graph constructed by common neighbors of two nodes in question. The proposed metric is referred to as common neighborhood sub-graph density (CND) and is combined with affinity propagation to detect communities from network data. We apply community detection algorithms with CND to real-world benchmark data sets to demonstrate its useful behavior in the task of community detection in networks.