By Topic

Complex networks clustering algorithm based on the core influence of the nodes

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)
Chao Tong ; Sch. of Comput. Sci. & Eng., Beihang Univ., Beijing, China ; Jianwei Niu ; Bin Dai ; Jing Peng
more authors

This paper proposes a clustering method, group-driven process in the sociology of the clustering process simulation, whose clustering process simulates the driven process of colony formation in sociology. Clustering experiments show that the clustering accuracy and clustering speed of the algorithm in complex network are superior to the classic optimization Fast-Newman clustering algorithm.

Published in:

2012 IEEE 31st International Performance Computing and Communications Conference (IPCCC)

Date of Conference:

1-3 Dec. 2012