By Topic

Density-based community detection in social networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Kumar Subramani ; Institute for Informatics, Ludwig-Maximilians-Universität München, Munich, Germany ; Alexander Velkov ; Irene Ntoutsi ; Peer Kroger
more authors

This paper deals with community detection in social networks using density-based clustering. We compare two well-known concepts for community detection that are implemented as distance functions in the algorithms SCAN [1] and DEN-GRAPH [2], the structural similarity of nodes and the number of interactions between nodes, respectively, in order to evaluate advantages and limitations of these approaches. Additionally, we propose to use a hierarchical approach for clustering in order to get rid of the problem of choosing an appropriate density threshold for community detection, a severe limitation of the applicability and usefulness of the SCAN and DENGRAPH algorithms in real life applications. We conduct all experiments on data sets with different characteristics, particularly Twitter data and Enron data.

Published in:

Internet Multimedia Systems Architecture and Application (IMSAA), 2011 IEEE 5th International Conference on

Date of Conference:

12-13 Dec. 2011