Fast Spectral Clustering with efficient large graph construction


Spectral clustering has been regarded as a powerful tool for unsupervised tasks despite its excellent performance, the high computational cost has become a bottleneck which limits its application for large scale problems. Recent studies on anchor-based graph can partly alleviate the problem, however, it is still a great challenge to deal with such data with… (More)
DOI: 10.1109/ICASSP.2017.7952605


5 Figures and Tables

Cite this paper

@article{Zhu2017FastSC, title={Fast Spectral Clustering with efficient large graph construction}, author={Wei Zhu and Feiping Nie and Xuelong Li}, journal={2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, year={2017}, pages={2492-2496} }