Parallel and Distributed Computing Applications and Technologies, International Conference on (2011)
Oct. 20, 2011 to Oct. 22, 2011
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/PDCAT.2011.4
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.
Spectral Clustering, Incremental, Eigen-Gap, Representative Point
H. Shen, Y. Tian and T. Kong, "A Fast Incremental Spectral Clustering for Large Data Sets," 2011 12th International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT 2011)(PDCAT), Gwangju, 2011, pp. 1-5.