DocumentCode :
1989609
Title :
A Kind of Data Stream Clustering Algorithm Based on Grid and Relative Density
Author :
Gao, Hongbin ; Li, Ruiguang ; Hou, Jie
Author_Institution :
Coll. of Comput., WuYi Univ., Jiangmen, China
fYear :
2012
fDate :
27-30 May 2012
Firstpage :
1
Lastpage :
4
Abstract :
This paper provided a Data Stream Clustering Algorithm Based on Grid and Relative Density which inherits the advantages of grid based clustering and relative density based clustering which can discover arbitrary-shape and multi-resolution clusters. Meanwhile introduced a concept of support which made algorithm adopt thoughts based on distance-based algorithm, provide the way to solve the effects of data object around grid on grid density.
Keywords :
data mining; grid computing; pattern clustering; arbitrary shape discovery; data stream clustering algorithm; distance-based algorithm; grid based clustering; grid density; multiresolution cluster; relative density based clustering; Algorithm design and analysis; Attenuation; Clustering algorithms; Computers; Educational institutions; Shape;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Engineering and Technology (S-CET), 2012 Spring Congress on
Conference_Location :
Xian
Print_ISBN :
978-1-4577-1965-3
Type :
conf
DOI :
10.1109/SCET.2012.6341978
Filename :
6341978
Link To Document :
بازگشت