Fusion Subspace Clustering for Incomplete Data
This paper introduces {\em fusion subspace clustering}, a novel method to learn low-dimensional structures that approximate large scale yet highly incomplete data. The main idea is to assign each datum to a subspace of its own, and minimize the distance between the subspaces of all data, so that subspaces of the same cluster get {\em fused} together. Our method allows low, high, and even full-rank data; it directly accounts for noise, and its sample complexity approaches the information-theoretic limit. In addition, our approach provides a natural model selection {\em clusterpath}, and a direct completion method. We give convergence guarantees, analyze computational complexity, and show through extensive experiments on real and synthetic data that our approach performs comparably to the state-of-the-art with complete data, and dramatically better if data is missing.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringModel SelectionSimilar Papers 제목 키워드 기반
Fusion Subspace Clustering: Full and Incomplete Data
Modern inference and learning often hinge on identifying low-dimensional structures that approximate large scale data. Subspace clustering achieves this through a union of linear subspaces. However, in contemporary appli…
ClusteringLow-Rank Matrix CompletionMatrix CompletionHigh Rank Matrix Completion via Grassmannian Proxy Fusion
This paper approaches high-rank matrix completion (HRMC) by filling missing entries in a data matrix where columns lie near a union of subspaces, clustering these columns, and identifying the underlying subspaces. Curren…
Subspace Clustering on Incomplete Data with Self-Supervised Contrastive Learning
Subspace clustering aims to group data points that lie in a union of low-dimensional subspaces and finds wide application in computer vision, hyperspectral imaging, and recommendation systems. However, most existing meth…
Recommendation SystemsContrastive LearningRobust Subspace Clustering via Thresholding
The problem of clustering noisy and incompletely observed high-dimensional data points into a union of low-dimensional subspaces and a set of outliers is considered. The number of subspaces, their dimensions, and their o…
ClusteringEPTAS for $k$-means Clustering of Affine Subspaces
We consider a generalization of the fundamental $k$-means clustering for data with incomplete or corrupted entries. When data objects are represented by points in $\mathbb{R}^d$, a data point is said to be incomplete whe…
Clustering