DocumentCode
2756228
Title
Evolving local means method for clustering of streaming data
Author
Baruah, Rashmi Dutta ; Angelov, Plamen
Author_Institution
Sch. of Comput. & Commun., Lancaster Univ., Lancaster, UK
fYear
2012
fDate
10-15 June 2012
Firstpage
1
Lastpage
8
Abstract
A new on-line evolving clustering approach for streaming data is proposed in this paper. The approach is based on the concept that local mean of samples within a region has the highest density and the gradient of the density points towards the local mean. The algorithm merely requires recursive calculation of local mean and variance, due to which it easily meets the memory and time constraints for data stream processing. The experimental results using synthetic and benchmark datasets show that the proposed approach attains results at par with offline approach and is comparable to popular density-based mean-shift clustering yet it is significantly more efficient being one-pass and non-iterative.
Keywords
pattern clustering; benchmark datasets; data stream processing; density-based mean-shift clustering; evolving local means method; memory constraints; online evolving clustering approach; streaming data clustering; synthetic datasets; time constraints; variance; Algorithm design and analysis; Benchmark testing; Clustering algorithms; Data models; Estimation; Kernel; Memory management; data streams; evolving clustering; online clustering; sequential clustering;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems (FUZZ-IEEE), 2012 IEEE International Conference on
Conference_Location
Brisbane, QLD
ISSN
1098-7584
Print_ISBN
978-1-4673-1507-4
Electronic_ISBN
1098-7584
Type
conf
DOI
10.1109/FUZZ-IEEE.2012.6251366
Filename
6251366
Link To Document