Incremental subspace clustering over multiple data streams

Data streams are often locally correlated, with a subset of streams exhibiting coherent patterns over a subset of time points. Subspace clustering can discover clusters of objects in different subspaces. However, traditional sub-space clustering algorithms for static data sets are not readily used for incremental clustering, and is very expensive for frequent re-clustering over dynamically changing stream data. In this paper, we present an efficient incremental sub-space clustering algorithm for multiple streams over sliding windows. Our algorithm detects all the δ-CC-Clusters, which capture the coherent changing patterns among a set of streams over a set of time points. δ-CC-Clusters are incrementally generated by traversing a directed acyclic graph pDAG. We propose efficient insertion and deletion operations to update thepDAG dynamically. In addition, effective pruning techniques are applied to reduce the search space. Experiments on real data sets demonstrate the performance of our algorithm.