INTRINSIC DIMENSIONALITY ESTIMATOR FROM NEAR-NEIGHBOR INFORMATION

被引:131
作者
PETTIS, KW
BAILEY, TA
JAIN, AK
DUBES, RC
机构
[1] Department of Computer Science, Michigan State University, East Lansing
关键词
Index Terms-Eigenvalues; interpoint distances; intrinsic dimensionality; near-neighbor information; outliers;
D O I
10.1109/TPAMI.1979.4766873
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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 near-neighbor 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. Copyright © 1979 by The Institute of Electrical and Electronics Engineers, Inc.
引用
收藏
页码:25 / 37
页数:13
相关论文
共 27 条