By Topic

Overlapping Community Detection by Kernel-Based Fuzzy Affinity Propagation

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

4 Author(s)
Fan Ding ; Coll. of Comput. Sci., Nat. Univ. of Defense Technol., Changsha, China ; Zhigang Luo ; Jinlong Shi ; Xiaoyong Fang

Community structure is one of the important topological characteristics of many complex networks. Detecting communities from networks has been intensively investigated in recent years. In most previous methods for community detection, the overlapping property of communities, which exists common in many real-world networks, is ignored. By combining commute-time kernel based distance measure and fuzzy affinity propagation, we present a new community detection algorithm CDKFAP for overlapping communities. Based on a new proposed index measures the fuzziness of nodes, the algorithm can rank and extract overlapping nodes of communities. The applications to computer-generated networks and real-world networks demonstrate the effectiveness of our algorithm.

Published in:

Intelligent Systems and Applications (ISA), 2010 2nd International Workshop on

Date of Conference:

22-23 May 2010