Parallel Spectral Clustering
Cached
Download Links
| Citations: | 6 - 2 self |
BibTeX
@MISC{Song_parallelspectral,
author = {Yangqiu Song and Wen-yen Chen and Hongjie Bai and Chih-jen Lin and Edward Y. Chang},
title = {Parallel Spectral Clustering},
year = {}
}
OpenURL
Abstract
Abstract. Spectral clustering algorithm has been shown to be more effective in finding clusters than most traditional algorithms. However, spectral clustering suffers from a scalability problem in both memory use and computational time when a dataset size is large. To perform clustering on large datasets, we propose to parallelize both memory use and computation on distributed computers. Through an empirical study on a large document dataset of 193, 844 data instances and a large photo dataset of 637, 137, we demonstrate that our parallel algorithm can effectively alleviate the scalability problem. Key words: Parallel spectral clustering, distributed computing 1







