DocumentCode :
2903341
Title :
Complex networks clustering algorithm based on the core influence of the nodes
Author :
Chao Tong ; Jianwei Niu ; Bin Dai ; Jing Peng ; Jinyang Fan
Author_Institution :
Sch. of Comput. Sci. & Eng., Beihang Univ., Beijing, China
fYear :
2012
fDate :
1-3 Dec. 2012
Firstpage :
185
Lastpage :
186
Abstract :
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.
Keywords :
complex networks; optimisation; pattern clustering; clustering process simulation sociology; colony formation; complex networks clustering algorithm; core node influence; group-driven process; optimization Fast-Newman clustering algorithm; Accuracy; Algorithm design and analysis; Clustering algorithms; Communities; Complex networks; Neural networks; Optimization; Fast-Newman algorithm; clustering algorithm; complex networks; core influence of the nodes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Performance Computing and Communications Conference (IPCCC), 2012 IEEE 31st International
Conference_Location :
Austin, TX
ISSN :
1097-2641
Print_ISBN :
978-1-4673-4881-2
Type :
conf
DOI :
10.1109/PCCC.2012.6407690
Filename :
6407690
Link To Document :
بازگشت