Iterative Spectral Method for Alternative Clustering

09/08/2019
by   Chieh Wu, et al.
0

Given a dataset and an existing clustering as input, alternative clustering aims to find an alternative partition. One of the state-of-the-art approaches is Kernel Dimension Alternative Clustering (KDAC). We propose a novel Iterative Spectral Method (ISM) that greatly improves the scalability of KDAC. Our algorithm is intuitive, relies on easily implementable spectral decompositions, and comes with theoretical guarantees. Its computation time improves upon existing implementations of KDAC by as much as 5 orders of magnitude.

READ FULL TEXT
research
02/05/2016

Compressive Spectral Clustering

Spectral clustering has become a popular technique due to its high perfo...
research
09/17/2016

Fast and Effective Algorithms for Symmetric Nonnegative Matrix Factorization

Symmetric Nonnegative Matrix Factorization (SNMF) models arise naturally...
research
02/26/2022

A Dynamic Mode Decomposition Approach for Decentralized Spectral Clustering of Graphs

We propose a novel robust decentralized graph clustering algorithm that ...
research
09/06/2019

Solving Interpretable Kernel Dimension Reduction

Kernel dimensionality reduction (KDR) algorithms find a low dimensional ...
research
06/01/2023

Going Deeper with Spectral Embeddings

To make sense of millions of raw data and represent them efficiently, pr...
research
05/16/2003

A neural network and iterative optimization hybrid for Dempster-Shafer clustering

In this paper we extend an earlier result within Dempster-Shafer theory ...
research
01/26/2023

Re-embedding data to strengthen recovery guarantees of clustering

We propose a clustering method that involves chaining four known techniq...

Please sign up or login with your details

Forgot password? Click here to reset