DocumentCode :
553131
Title :
Clustering algorithm research and realization based on Local Gathering Features
Author :
Niu Xi-xian ; Han Guo-bin ; Zhao Li-li
Author_Institution :
Fac. of Inf. Technol. & Propagation, Hebei Youth Administrative Cadres Coll., Shijiazhuang, China
Volume :
2
fYear :
2011
fDate :
26-28 July 2011
Firstpage :
1118
Lastpage :
1122
Abstract :
Under the research and analysis on different types of clustering algorithms, focus on the limitation of the Jarvis-Patrick algorithm and other clustering algorithm based on SNN density, a new clustering algorithm is proposed in this paper, that is, Improved Clustering algorithm based on Local Gathering Features. The paper gives the definition of the Gathering Features during the procedure of the clustering, show the algorithm´s design and implementation method, and list the experimental data identification result. The new presented algorithm can deal with different types, dimensions, density and shape data collection problems, does not increase the time and space complexity, highlights the characteristics of Local Agglomerative Characteristics, improve the learning efficiency and the quality of data clustering.
Keywords :
computational complexity; learning (artificial intelligence); pattern clustering; Jarvis-Patrick algorithm; SNN density; clustering algorithm research; data clustering quality; experimental data identification; learning efficiency; local agglomerative characteristics; local gathering features; space complexity; time complexity; Algorithm design and analysis; Clustering algorithms; Data mining; Density measurement; Heuristic algorithms; Noise; Shape; SNN density; SNN similarity; clustering; data mining; local gathering features;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Fuzzy Systems and Knowledge Discovery (FSKD), 2011 Eighth International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-61284-180-9
Type :
conf
DOI :
10.1109/FSKD.2011.6019731
Filename :
6019731
Link To Document :
بازگشت