English

Clustering by latent dimensions

Machine Learning 2018-05-29 v1 Machine Learning

Abstract

This paper introduces a new clustering technique, called {\em dimensional clustering}, which clusters each data point by its latent {\em pointwise dimension}, which is a measure of the dimensionality of the data set local to that point. Pointwise dimension is invariant under a broad class of transformations. As a result, dimensional clustering can be usefully applied to a wide range of datasets. Concretely, we present a statistical model which estimates the pointwise dimension of a dataset around the points in that dataset using the distance of each point from its nthn^{\text{th}} nearest neighbor. We demonstrate the applicability of our technique to the analysis of dynamical systems, images, and complex human movements.

Keywords

Cite

@article{arxiv.1805.10759,
  title  = {Clustering by latent dimensions},
  author = {Shohei Hidaka and Neeraj Kashyap},
  journal= {arXiv preprint arXiv:1805.10759},
  year   = {2018}
}

Comments

This paper is submitted to NIPS 2018 conference

R2 v1 2026-06-23T02:09:58.909Z