A Fast Incremental Spectral Clustering for Large Data Sets

Citations Over TimeTop 17% of 2011 papers

Abstract

Spectral clustering is an emerging research topic that has numerous applications, such as data dimension reduction and image segmentation. In spectral clustering, as new data points are added continuously, dynamic data sets are processed in an on-line way to avoid costly re-computation. In this paper, we propose a new representative measure to compress the original data sets and maintain a set of representative points by continuously updating Eigen-system with the incidence vector. According to these extracted points we generate instant cluster labels as new data points arrive. Our method is effective and able to process large data sets due to its low time complexity. Experimental results over various real evolutional data sets show that our method provides fast and relatively accurate results.

Related Papers

• → GCHL: A grid-clustering algorithm for high-dimensional very large spatial data bases(2004)59 cited
• VSM-based Text Clustering Algorithm(2008)
• Adaptive Clustering Algorithm for Mining Subspace Clusters in High-Dimensional Data Stream(2010)
• Improved CLARA-High-Dimensional Data Clustering Using Improved Clustering Large Applications(2021)
• → A H-K Clustering Algorithm For High Dimensional Data Using Ensemble Learning(2015)