Clustering Algorithm for Multiple Data Streams Based on Data Cloud Node

Article Preview

Abstract:

Multiple data streams clustering aims to clustering multiple data streams according to their similarity while tracking their changes with time . This paper proposes M_SCCStream algorithm based on cloud model. Algorithm introduces data cloud node structure with hierarchical characteristics to represent different granularity data sequence and takes the entropy indicated the degree of data changes. Algorithm finds micro_clustering with the minimum distance and then obtains the clustering result of multiple data streams through calculating the correlation degrees of micro_clustering. The experiment proves that the algorithm has higher quality and stability.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

247-250

Citation:

Online since:

November 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] J Yang. Dynamic clustering of evolving streams with a single pass[C]. In: Proc. of IEEE International Conference Data Mini.Washington:IEEE Computer Society,2003: 695-697.

Google Scholar

[2] Beringer J. Hullermeier E. Online clustering of parallel data streams[J].Data & Knowledge Engineering,2006,58(2): 180-204.

DOI: 10.1016/j.datak.2005.05.009

Google Scholar

[3] B R Dai, Huang J W, Yeh M Y, et a1. Adaptive clustering for multiple evolving streams[J].IEEE Transaction on Knowledge and Data Engineering,2006,18(9): 1166-l180.

DOI: 10.1109/tkde.2006.137

Google Scholar

[4] Sa Li. An data astream clustering algorithms based on cloud model[C]. Engineering and Business Management, Wuhan: 2011(03): 2651-2654.

Google Scholar