SSP'05 -- Proceedings

	IEEE/SP 13th workshop on Statistical Signal Processing July, 17-20, 2005 - Bordeaux - France

Information regarding the paper

Title

Estimating local intrinsic dimension with k-nearest neighbor graphs

Author(s)

Jose Costa	Univ of Michigan
Abhishek Girotra	Univ of Michigan
Alfred Hero	Univ of Michigan

Get the paper in PDF format

To obtain Acrobat Reader (version 5 minimum required) necessary to his read.

Abstract

Many high-dimensional data sets of practical interest exhibit a varying complexity in different parts of the data space. This is the case, for example, of databases of images containing many samples of a few textures of different complexity. Such phenomena can be modeled by assuming that the data lies on a collection of manifolds with different intrinsic dimensionalities. In this extended abstract, we introduce a method to estimate the local dimensionality associated with each point in a data set, without any prior information about the manifolds, their quantity and their sampling distributions. The proposed method uses a global dimensionality estimator based on k-nearest neighbor (k-NN) graphs, together with an algorithm for computing neighborhoods in the data with similar topological properties.