SCAR - Spectral Clustering Accelerated and Robustified

MCML Authors

Thomas Seidl

Prof. Dr.

Director

Database Systems, Data Mining and AI

Abstract

Spectral clustering is one of the most advantageous clustering approaches. However, standard Spectral Clustering is sensitive to noisy input data and has a high runtime complexity. Tackling one of these problems often exacerbates the other. As real-world datasets are often large and compromised by noise, we need to improve both robustness and runtime at once. Thus, we propose Spectral Clustering - Accelerated and Robust (SCAR), an accelerated, robustified spectral clustering method. In an iterative approach, we achieve robustness by separating the data into two latent components: cleansed and noisy data. We accelerate the eigendecomposition - the most time-consuming step - based on the Nyström method. We compare SCAR to related recent state-of-the-art algorithms in extensive experiments. SCAR surpasses its competitors in terms of speed and clustering quality on highly noisy data.

inproceedings HFB+22

---

VLDB 2022

48th International Conference on Very Large Data Bases. Sydney, Australia (and hybrid), Sep 05-09, 2022.

---

Authors

E. Hohma • C. M. M. Frey • A. Beer • T. Seidl

---

Links

DOI GitHub

---

Research Area

 A3 | Computational Models