Abstract
Stream clustering algorithms normally require two phases: an online first step that statistically summarizes the stream while forming special structures – such as micro-clusters– and a second, offline phase, that uses a conventional clustering algorithm taking the micro-clusters as pseudo-points to deliver the final clustering. This procedure tends to produce oversized or overlapping clusters in medium-to-high dimensional spaces, and typically degrades seriously in noisy data environments. In this paper we introduce StreamLeader, a novel stream clustering algorithm suitable to massive data that does not resort to a conventional clustering phase, being based on the notion of Leader Cluster and on an aggressive noise reduction process. We report an extensive systematic testing in which the new algorithm is shown to consistently outperform its contenders both in terms of quality and scalability.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
The data was used for the \(3^\mathrm{rd}\) International Knowledge Discovery & Data Mining Tools Competition, held as part of the Knowledge Discovery & Data Mining conference (KDD-99) – see kdd.ics.uci.edu/databases/kddcup99/kddcup99.html.
- 2.
References
Aggarwal, C., Han, J., Wang, J., Yu, P.: A framework for clustering evolving data streams. In: Proceedings of the Conference on Very Large Data Bases, pp. 81–92 (2003)
Cao, F., Ester, M., Qian, W., Zhou, A.: Density-based clustering over an evolving data stream with noise. In: Proceedings of ICDM, pp. 328–339 (2006)
Kranen, P., Assent, I., Baldauf, C., Seidl, T.: The ClusTree: indexing micro-clusters for anytime stream mining. Knowl. Inf. Syst. 29(2), 249–272 (2011)
Ackermann, M.R., Martens, M., Raupach, C., et al.: StreamKM++: a clustering algorithm for data streams. ACM J. Exp. Algorithmics 17(1), 2–4 (2012)
Bifet, A., Holmes, G., Pfahringer, B., et al.: MOA: massive online analysis, a framework for stream classification and clustering. J. Mach. Learn. Res. 22, 44–50 (2010)
Chen, Y., Tu, L.: Density-based clustering for real-time stream data. In: Proceedings of KDD, pp. 133–142 (2007)
Kremer, H., Kranen, P., Jansen, T., et al.: An effective evaluation measure for clustering on evolving data streams. In: Proceedings of SIGKDD, pp. 868–876 (2011)
Bifet, A., Gavaldà, R.: Learning from time-changing data with adaptive windowing. In: Proceedings of SIAM International Conference on Data Mining, pp. 443–448 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Andrés-Merino, J., Belanche, L.A. (2016). StreamLeader: A New Stream Clustering Algorithm not Based in Conventional Clustering. In: Villa, A., Masulli, P., Pons Rivero, A. (eds) Artificial Neural Networks and Machine Learning – ICANN 2016. ICANN 2016. Lecture Notes in Computer Science(), vol 9887. Springer, Cham. https://doi.org/10.1007/978-3-319-44781-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-44781-0_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-44780-3
Online ISBN: 978-3-319-44781-0
eBook Packages: Computer ScienceComputer Science (R0)