Business & Information Systems Engineering
Document Type
State of the Art
Abstract
Abstract Analyzing data streams has received considerable attention over the past decades due to the widespread usage of sensors, social media and other streaming data sources. A core research area in this field is stream clustering which aims to recognize patterns in an unordered, infinite and evolving stream of observations. Clustering can be a crucial support in decision making, since it aims for an optimized aggregated representation of a continuous data stream over time and allows to identify patterns in large and high-dimensional data. A multitude of algorithms and approaches has been developed that are able to find and maintain clusters over time in the challenging streaming scenario. This survey explores, summarizes and categorizes a total of 51 stream clustering algorithms and identifies core research threads over the past decades. In particular, it identifies categories of algorithms based on distance thresholds, density grids and statistical models as well as algorithms for high dimensional data. Furthermore, it discusses applications scenarios, available software and how to configure stream clustering algorithms. This survey is considerably more extensive than comparable studies, more up-to-date and highlights how concepts are interrelated and have been developed over time.
Recommended Citation
Carnein, Matthias and Trautmann, Heike
(2019)
"Optimizing Data Stream Representation: An Extensive Survey on Stream Clustering Algorithms,"
Business & Information Systems Engineering:
Vol. 61: Iss. 3, 277-297.
Available at:
https://aisel.aisnet.org/bise/vol61/iss3/4