Simultaneous Subspace Clustering and Cluster Number Estimating based on Triplet Relationship

01/23/2019
by   Jie Liang, et al.
6

In this paper we propose a unified framework to simultaneously discover the number of clusters and group the data points into them using subspace clustering. Real data distributed in a high-dimensional space can be disentangled into a union of low-dimensional subspaces, which can benefit various applications. To explore such intrinsic structure, state-of-the-art subspace clustering approaches often optimize a self-representation problem among all samples, to construct a pairwise affinity graph for spectral clustering. However, a graph with pairwise similarities lacks robustness for segmentation, especially for samples which lie on the intersection of two subspaces. To address this problem, we design a hyper-correlation based data structure termed as the triplet relationship, which reveals high relevance and local compactness among three samples. The triplet relationship can be derived from the self-representation matrix, and be utilized to iteratively assign the data points to clusters. Three samples in each triplet are encouraged to be highly correlated and are considered as a meta-element during clustering, which show more robustness than pairwise relationships when segmenting two densely distributed subspaces. Based on the triplet relationship, we propose a unified optimizing scheme to automatically calculate clustering assignments. Specifically, we optimize a model selection reward and a fusion reward by simultaneously maximizing the similarity of triplets from different clusters while minimizing the correlation of triplets from same cluster. The proposed algorithm also automatically reveals the number of clusters and fuses groups to avoid over-segmentation. Extensive experimental results on both synthetic and real-world datasets validate the effectiveness and robustness of the proposed method.

READ FULL TEXT

page 1

page 8

page 10

research
05/02/2019

Three-Stage Subspace Clustering Framework with Graph-Based Transformation and Optimization

Subspace clustering (SC) refers to the problem of clustering high-dimens...
research
03/05/2012

Sparse Subspace Clustering: Algorithm, Theory, and Applications

In many real-world problems, we are dealing with collections of high-dim...
research
04/24/2019

Neural Collaborative Subspace Clustering

We introduce the Neural Collaborative Subspace Clustering, a neural mode...
research
04/24/2013

Locally linear representation for image clustering

It is a key to construct a similarity graph in graph-oriented subspace l...
research
08/28/2018

Probabilistic Sparse Subspace Clustering Using Delayed Association

Discovering and clustering subspaces in high-dimensional data is a funda...
research
05/14/2023

Learning Structure Aware Deep Spectral Embedding

Spectral Embedding (SE) has often been used to map data points from non-...
research
10/18/2018

Accurate and Scalable Image Clustering Based On Sparse Representation of Camera Fingerprint

Clustering images according to their acquisition devices is a well-known...

Please sign up or login with your details

Forgot password? Click here to reset