AI Chat AI Image Generator AI Video Text to Speech

A highly likely clusterable data model with no clusters

09/14/2019

∙

by Mireille Boutin, et al.

∙

∙

We propose a model for a dataset in R^D that does not contain any clusters but yet is such that a projection of the points on a random one-dimensional subspace is likely to yield a clustering of the points. This model is compatible with some recent empirical observations.

Mireille Boutin
15 publications
Alden Bradford
2 publications

page 1

page 2

page 3

page 4

research

∙ 11/15/2018

Subspace Clustering through Sub-Clusters

The problem of dimension reduction is of increasing importance in modern...

0 Weiwei Li, et al. ∙

research

∙ 09/10/2019

Subspace clustering without knowing the number of clusters: A parameter free approach

Subspace clustering, the task of clustering high dimensional data when t...

0 Vishnu Menon, et al. ∙

research

∙ 04/24/2019

Neural Collaborative Subspace Clustering

We introduce the Neural Collaborative Subspace Clustering, a neural mode...

0 Tong Zhang, et al. ∙

research

∙ 01/01/2020

Toward Generalized Clustering through an One-Dimensional Approach

After generalizing the concept of clusters to incorporate clusters that ...

0 Luciano da F. Costa, et al. ∙

research

∙ 12/14/2016

Border-Peeling Clustering

In this paper, we present a novel non-parametric clustering technique, w...

0 Nadav Bar, et al. ∙

research

∙ 05/27/2016

Achieving stable subspace clustering by post-processing generic clustering results

We propose an effective subspace selection scheme as a post-processing s...

0 Duc-Son Pham, et al. ∙

research

∙ 03/03/2014

Matching Image Sets via Adaptive Multi Convex Hull

Traditional nearest points methods use all the samples in an image set t...

0 Shaokang Chen, et al. ∙