Iterative Spectral Method for Alternative Clustering
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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringSimilar Papers 제목 키워드 기반
Unfolding ADMM for Enhanced Subspace Clustering of Hyperspectral Images
Deep subspace clustering methods are now prominent in clustering, typically using fully connected networks and a self-representation loss function. However, these methods often struggle with overfitting and lack interpre…
ClusteringImage RestorationSuper-ResolutionIterative Spectral Clustering for Unsupervised Object Localization
This paper addresses the problem of unsupervised object localization in an image. Unlike previous supervised and weakly supervised algorithms that require bounding box or image level annotations for training classifiers …
ClusteringObjectObject DiscoveryObject Localization+1An Automated Spectral Clustering for Multi-scale Data
Spectral clustering algorithms typically require a priori selection of input parameters such as the number of clusters, a scaling parameter for the affinity measure, or ranges of these values for parameter tuning. Despit…
ClusteringLifelong Spectral Clustering
In the past decades, spectral clustering (SC) has become one of the most effective clustering algorithms. However, most previous studies focus on spectral clustering tasks with a fixed task set, which cannot incorporate …
ClusteringClustering Result Re-guided Incomplete Multi-view Spectral Clustering
Incomplete multi-view spectral clustering generalizes spectral clustering to multi-view data and simultaneously realizes the partition of multi-view data with missing views. For this category of method, K-means algorithm…