title: Parallel spectral clustering in distributed systems.
abstract: Spectral clustering algorithms have been shown to be more effective in finding clusters than some traditional algorithms, such as k-means. However, spectral clustering suffers from a scalability problem in both memory use and computational time when the size of a data set is large. To perform clustering on large data sets, we investigate two representative ways of approximating the dense similarity matrix. We compare one approach by sparsifying the matrix with another by the Nyström method. We then pick the strategy of sparsifying the matrix via retaining nearest neighbors and investigate its parallelization. We parallelize both memory use and computation on distributed computers. Through an empirical study on a document data set of 193,844 instances and a photo data set of 2,121,863, we show that our parallel algorithm can effectively handle large problems.
authors.affiliation: Yahoo! Inc., Sunnyvale, CA 94089, USA. wychen@yahoo-inc.com
authors.forename: Wen-Yen
authors.initials: WY
authors.lastname: Chen
authors.forename: Yangqiu
authors.initials: Y
authors.lastname: Song
authors.forename: Hongjie
authors.initials: H
authors.lastname: Bai
authors.forename: Chih-Jen
authors.initials: CJ
authors.lastname: Lin
authors.forename: Edward Y
authors.initials: EY
authors.lastname: Chang
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003195:Computer Communication Networks / Q000295:instrumentation*; D003198:Computer Simulation; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods; D015203:Reproducibility of Results; D018511:Systems Integration