The ClusTree: Indexing Micro-Clusters for Anytime Stream Mining
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited. Clustering has to be performed in a single pass over the incoming data and within the possibly varying inter-arrival times of the stream. Likewise, memory is limited, making it impossible to store all data. For clustering, we are faced with the challenge of maintaining a current result that can be presented to the user at any given time. In this work, we propose a parameter free algorithm that automatically adapts to the speed of the data stream. It makes best use of the time available under the current constraints to provide a clustering of the objects seen up to that point. Our approach incorporates the age of the objects to reflect the greater importance of more recent data.
For efficient and effective handling, we introduce the ClusTree, a compact and self-adaptive index structure for maintaining stream summaries. Additionally we present solutions to handle very fast streams through aggregation mechanisms and propose novel descent strategies that improve the clustering result on slower streams as long as time permits. Our experiments show that our approach is capable of handling a multitude of different stream characteristics for accurate and scalable anytime stream clustering.
|Authors:||Kranen P., Assent I., Baldauf C., Seidl T.|
|Published in:||Knowledge and Information Systems Journal (Springer KAIS), Volume 29, Issue 2|
|Publisher:||Springer - London|
|Url:||KAIS Journal - full text|
|Type:||Journal Articles (peer reviewed)|
|Research topic:||Data Analysis and Knowledge Extraction|