Provable Clustering of a Union of Linear Manifolds Using Optimal
Directions
- URL: http://arxiv.org/abs/2201.02745v1
- Date: Sat, 8 Jan 2022 02:36:25 GMT
- Title: Provable Clustering of a Union of Linear Manifolds Using Optimal
Directions
- Authors: Mostafa Rahmani
- Abstract summary: This paper focuses on the Matrix Factorization based Clustering (MFC) method which is one of the few closed form algorithms for the subspace clustering problem.
We reveal the connection between MFC and the Innovation Pursuit (iPursuit) algorithm which was shown to be able to outperform the other spectral clustering based methods.
- Score: 8.680676599607123
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: This paper focuses on the Matrix Factorization based Clustering (MFC) method
which is one of the few closed form algorithms for the subspace clustering
problem. Despite being simple, closed-form, and computation-efficient, MFC can
outperform the other sophisticated subspace clustering methods in many
challenging scenarios. We reveal the connection between MFC and the Innovation
Pursuit (iPursuit) algorithm which was shown to be able to outperform the other
spectral clustering based methods with a notable margin especially when the
span of clusters are close. A novel theoretical study is presented which sheds
light on the key performance factors of both algorithms (MFC/iPursuit) and it
is shown that both algorithms can be robust to notable intersections between
the span of clusters. Importantly, in contrast to the theoretical guarantees of
other algorithms which emphasized on the distance between the subspaces as the
key performance factor and without making the innovation assumption, it is
shown that the performance of MFC/iPursuit mainly depends on the distance
between the innovative components of the clusters.
Related papers
- Unfolding ADMM for Enhanced Subspace Clustering of Hyperspectral Images [43.152314090830174]
We introduce an innovative clustering architecture for hyperspectral images (HSI) by unfolding an iterative solver based on the Alternating Direction Method of Multipliers (ADMM) for sparse subspace clustering.
Our approach captures well the structural characteristics of HSI data by employing the K nearest neighbors algorithm as part of a structure preservation module.
arXiv Detail & Related papers (2024-04-10T15:51:46Z) - Fuzzy K-Means Clustering without Cluster Centroids [79.19713746387337]
Fuzzy K-Means clustering is a critical computation technique in unsupervised data analysis.
This paper proposes a novel Fuzzy K-Means clustering algorithm that entirely eliminates the reliance on cluster centroids.
arXiv Detail & Related papers (2024-04-07T12:25:03Z) - Multi-View Clustering via Semi-non-negative Tensor Factorization [120.87318230985653]
We develop a novel multi-view clustering based on semi-non-negative tensor factorization (Semi-NTF)
Our model directly considers the between-view relationship and exploits the between-view complementary information.
In addition, we provide an optimization algorithm for the proposed method and prove mathematically that the algorithm always converges to the stationary KKT point.
arXiv Detail & Related papers (2023-03-29T14:54:19Z) - POCS-based Clustering Algorithm [0.0]
A novel clustering technique based on the projection onto convex set (POCS) method, called POCS-based clustering algorithm, is proposed in this paper.
The proposed POCS-based clustering algorithm exploits a parallel projection method of POCS to find appropriate cluster prototypes in the feature space.
The performance of the proposed POCS-based clustering algorithm is verified through experiments on various synthetic datasets.
arXiv Detail & Related papers (2022-08-15T12:33:09Z) - Late Fusion Multi-view Clustering via Global and Local Alignment
Maximization [61.89218392703043]
Multi-view clustering (MVC) optimally integrates complementary information from different views to improve clustering performance.
Most of existing approaches directly fuse multiple pre-specified similarities to learn an optimal similarity matrix for clustering.
We propose late fusion MVC via alignment to address these issues.
arXiv Detail & Related papers (2022-08-02T01:49:31Z) - Perfect Spectral Clustering with Discrete Covariates [68.8204255655161]
We propose a spectral algorithm that achieves perfect clustering with high probability on a class of large, sparse networks.
Our method is the first to offer a guarantee of consistent latent structure recovery using spectral clustering.
arXiv Detail & Related papers (2022-05-17T01:41:06Z) - A self-adaptive and robust fission clustering algorithm via heat
diffusion and maximal turning angle [4.246818236277977]
A novel and fast clustering algorithm, fission clustering algorithm, is proposed in recent year.
We propose a robust fission clustering (RFC) algorithm and a self-adaptive noise identification method.
arXiv Detail & Related papers (2021-02-07T13:16:47Z) - Clustering Ensemble Meets Low-rank Tensor Approximation [50.21581880045667]
This paper explores the problem of clustering ensemble, which aims to combine multiple base clusterings to produce better performance than that of the individual one.
We propose a novel low-rank tensor approximation-based method to solve the problem from a global perspective.
Experimental results over 7 benchmark data sets show that the proposed model achieves a breakthrough in clustering performance, compared with 12 state-of-the-art methods.
arXiv Detail & Related papers (2020-12-16T13:01:37Z) - Scalable Hierarchical Agglomerative Clustering [65.66407726145619]
Existing scalable hierarchical clustering methods sacrifice quality for speed.
We present a scalable, agglomerative method for hierarchical clustering that does not sacrifice quality and scales to billions of data points.
arXiv Detail & Related papers (2020-10-22T15:58:35Z) - A Centroid Auto-Fused Hierarchical Fuzzy c-Means Clustering [30.709797128259236]
Centroid Auto-Fused Hierarchical Fuzzy c-means method (CAF-HFCM)
We present a Centroid Auto-Fused Hierarchical Fuzzy c-means method (CAF-HFCM) whose optimization procedure can automatically agglomerate to form a cluster hierarchy.
Our proposed CAF-HFCM method is able to be straightforwardly extended to various variants of FCM.
arXiv Detail & Related papers (2020-04-27T12:59:22Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.