Abstract
Clustering is one of the prominent classes in the mining data streams. Among various clustering algorithms that have been developed, density-based method has the ability to discover arbitrary shape clusters, and to detect the outliers. Recently, various algorithms adopted density-based methods for clustering data streams. In this paper, we look into three remarkable algorithms in two groups of micro-clustering and grid-based including DenStream, D-Stream, and MR-Stream. We compare the algorithms based on evaluating algorithm performance and clustering quality metrics.
Publisher
Trans Tech Publications, Ltd.
Reference15 articles.
1. J. Han, M. Kamber, and J. Pei, Data Mining: Concepts and Techniques Third edition. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., (2011).
2. H. Kremer, P. Kranen, T. Jansen, T. Seidl, A. Bifet, G. Holmes, and B. Pfahringer, An effective evaluation measure for clustering on evolving data streams, " in Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, ser. KDD , 11. New York, NY, USA: ACM, 2011, p.868.
3. H. Jiang, J. Li, S. Yi, X. Wang, and X. Hu, A new hybrid method based on partitioning-based dbscan and ant clustering, Expert Systems with Applications, (2011).
4. C. C. Aggarwal, Ed., Data Streams – Models and Algorithms. Springer, (2007).
5. T. Zhang, R. Ramakrishnan, and M. Livny, BIRCH: an efficient data clustering method for very large databases, in Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data,J. Widom, Ed. ACM Press, 1996, p.103–114.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献