Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 2313-2318.
Abstract
The Nystrom method provides an efficient sampling approach for large scale clustering problems, by generating a low-rank matrix approximation. However, existing sampling methods are limited by accuracy and computing time. This paper proposes an improved Nystrom-based clustering algorithm with a new sampling procedure, Minimum Sum of Squared Similarities (MSSS). Experiments on synthetic and real data sets show that the proposed sampling performs with higher accuracy than existing algorithms, applied to Nystrom-based spectral clustering problems. Furthermore, we provide a theoretical analysis that allows us to define the upper bound of the Frobenius norm error of the MSSS.
@inproceedings{ijcai2015p327,
title = {Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering},
author = {Bouneffouf, Djallel and Birol, Inanç},
booktitle = {Proceedings of the Twenty-Fourth International Joint Conference on
Artificial Intelligence, {IJCAI-15}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Qiang Yang and Michael Wooldridge},
pages = {2313--2318},
year = {2015},
month = {7},
note = {Main Track},
url = {https://ijcai.org/proceedings/2015/327},
}
TY - CPAPER TI - Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering AU - Bouneffouf, Djallel AU - Birol, Inanç T2 - Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15 PB - International Joint Conferences on Artificial Intelligence PY - 2015 SP - 2313 EP - 2318 UR - https://ijcai.org/proceedings/2015/327 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: