# Clustering by latent dimensions

28 May 2018Shohei HidakaNeeraj Kashyap

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... (read more)

PDF Abstract

No code implementations yet. Submit your code now