Probabilistic Sparse Subspace Clustering Using Delayed Association

08/28/2018
by   Maryam Jaberi, et al.
0

Discovering and clustering subspaces in high-dimensional data is a fundamental problem of machine learning with a wide range of applications in data mining, computer vision, and pattern recognition. Earlier methods divided the problem into two separate stages of finding the similarity matrix and finding clusters. Similar to some recent works, we integrate these two steps using a joint optimization approach. We make the following contributions: (i) we estimate the reliability of the cluster assignment for each point before assigning a point to a subspace. We group the data points into two groups of "certain" and "uncertain", with the assignment of latter group delayed until their subspace association certainty improves. (ii) We demonstrate that delayed association is better suited for clustering subspaces that have ambiguities, i.e. when subspaces intersect or data are contaminated with outliers/noise. (iii) We demonstrate experimentally that such delayed probabilistic association leads to a more accurate self-representation and final clusters. The proposed method has higher accuracy both for points that exclusively lie in one subspace, and those that are on the intersection of subspaces. (iv) We show that delayed association leads to huge reduction of computational cost, since it allows for incremental spectral clustering.

READ FULL TEXT

page 4

page 5

research
11/07/2018

Scalable Bottom-up Subspace Clustering using FP-Trees for High Dimensional Data

Subspace clustering aims to find groups of similar objects (clusters) th...
research
10/15/2015

Group-Invariant Subspace Clustering

In this paper we consider the problem of group invariant subspace cluste...
research
12/11/2019

Discriminative Dimension Reduction based on Mutual Information

The "curse of dimensionality" is a well-known problem in pattern recogni...
research
12/19/2011

A geometric analysis of subspace clustering with outliers

This paper considers the problem of clustering a collection of unlabeled...
research
07/31/2017

Learning Robust Representations for Computer Vision

Unsupervised learning techniques in computer vision often require learni...
research
01/23/2019

Simultaneous Subspace Clustering and Cluster Number Estimating based on Triplet Relationship

In this paper we propose a unified framework to simultaneously discover ...
research
12/22/2014

Clustering multi-way data: a novel algebraic approach

In this paper, we develop a method for unsupervised clustering of two-wa...

Please sign up or login with your details

Forgot password? Click here to reset