Clustering by latent dimensions

05/28/2018
by   Shohei Hidaka, et al.
0

This paper introduces a new clustering technique, called dimensional clustering, which clusters each data point by its latent 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 n^th nearest neighbor. We demonstrate the applicability of our technique to the analysis of dynamical systems, images, and complex human movements.

READ FULL TEXT
research
09/09/2020

KNN-DBSCAN: a DBSCAN in high dimensions

Clustering is a fundamental task in machine learning. One of the most su...
research
08/21/2020

Clustering small datasets in high-dimension by random projection

Datasets in high-dimension do not typically form clusters in their origi...
research
03/15/2021

Visualizing Data Velocity using DSNE

We present a new technique called "DSNE" which learns the velocity embed...
research
02/23/2022

On The Scale Dependence and Spacetime Dimension of the Internet with Causal Sets

A statistical measure of dimension is used to compute the effective aver...
research
02/04/2019

What is the dimension of your binary data?

Many 0/1 datasets have a very large number of variables; on the other ha...
research
06/13/2016

Modal-set estimation with an application to clustering

We present a first procedure that can estimate -- with statistical consi...
research
01/29/2018

Smooth, Efficient, and Interruptible Zooming and Panning

This paper introduces a novel technique for smooth and efficient zooming...

Please sign up or login with your details

Forgot password? Click here to reset