DocumentCode
1114706
Title
An Intrinsic Dimensionality Estimator from Near-Neighbor Information
Author
Pettis, Karl W. ; Bailey, Thomas A. ; Jain, Anil K. ; Dubes, Richard C.
Author_Institution
Department of Computer Science, Michigan State University, East Lansing, MI 48824.
Issue
1
fYear
1979
Firstpage
25
Lastpage
37
Abstract
The intrinsic dimensionality of a set of patterns is important in determining an appropriate number of features for representing the data and whether a reasonable two- or three-dimensional representation of the data exists. We propose an intuitively appealing, noniterative estimator for intrinsic dimensionality which is based on nearneighbor information. We give plausible arguments supporting the consistency of this estimator. The method works well in identifying the true dimensionality for a variety of artificial data sets and is fairly insensitive to the number of samples and to the algorithmic parameters. Comparisons between this new method and the global eigenvalue approach demonstrate the utility of our estimator.
Keywords
Algorithm design and analysis; Computer science; Covariance matrix; Data mining; Eigenvalues and eigenfunctions; Multidimensional systems; Pattern recognition; State estimation; Stress; Eigenvalues; interpoint distances; intrinsic dimensionality; near-neighbor information; outliers;
fLanguage
English
Journal_Title
Pattern Analysis and Machine Intelligence, IEEE Transactions on
Publisher
ieee
ISSN
0162-8828
Type
jour
DOI
10.1109/TPAMI.1979.4766873
Filename
4766873
Link To Document