The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
An Intrinsic Dimensionality Estimator from Near-Neighbor Information
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nearest neighbor pattern classification
Cover, T., & Hart, P. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053964 · Cited by 16,936
Cited by
Small sample size effects in statistical pattern recognition: Recommendations for practitioners
Raudys, S. J., & Jain, A. K. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.75512 · Cited by 1,384
Self-citationTheiler, J. (1990) · Journal of the Optical Society of America A · doi:10.1364/josaa.7.001055 · Cited by 947
39 Dimensionality and sample size considerations in pattern recognition practice
Jain, A. K., & Chandrasekaran, B. (1982) · Handbook of Statistics · doi:10.1016/s0169-7161(82)02042-2 · Cited by 560
Self-citationThe intrinsic dimensionality of plant traits and its relevance to community assembly
Laughlin, D. C. (2014) · Journal of Ecology · doi:10.1111/1365-2745.12187 · Cited by 471
Lin, T., & Zha, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70735 · Cited by 446
Bostanabad, R., Zhang, Y., Li, X., Kearney, T., Brinson, L. C., Apley, D. W., Liu, W. K., & Chen, W. (2018) · Progress in Materials Science · doi:10.1016/j.pmatsci.2018.01.005 · Cited by 434
A comprehensive survey of anomaly detection techniques for high dimensional big data
Thudumu, S., Branch, P., Jin, J., & Singh, J. (2020) · Journal of Big Data · doi:10.1186/s40537-020-00320-x · Cited by 425
Chaos: A tutorial for engineers
Parker, T. S., & Chua, L. O. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13845 · Cited by 416
A survey of dimensionality reduction techniques
Sorzano, C. Ó. S., Vargas, J., & Pascual-Montano, A. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1403.2877 · Cited by 305
Validity studies in clustering methodologies
Dubes, R., & Jain, A. K. (1979) · Pattern Recognition · doi:10.1016/0031-3203(79)90034-7 · Cited by 296
Self-citationGeodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
Costa, J. A., & Hero, A. O. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.831130 · Cited by 288
Clustering Methodologies in Exploratory Data Analysis
Dubes, R., & Jain, A. K. (1980) · Advances in Computers · doi:10.1016/s0065-2458(08)60034-0 · Cited by 286
Self-citationIncremental nonlinear dimensionality reduction by manifold learning
Law, M. H. C., & Jain, A. K. (2006) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2006.56 · Cited by 284
Self-citationData dimensionality estimation methods: a survey
Camastra, F. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00176-6 · Cited by 271
On the Intrinsic Dimensionality of Image Representations
Gong, S., Boddeti, V. N., & Jain, A. K. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00411 · Cited by 59
“(2) Both6 the k-NN based estimator [31] and the IDEA estimator [33] are less sensitive to the number of nearest neighbors in comparison to the graph distance based method [13], but are known to underestimate ID for sets with high intrinsic dimensionality [43].”
MethodSelf-citation
Metadata
- Authors
- Pettis, K. W., Bailey, T. A., Jain, A. K., & Dubes, R. C.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1979-01
- Volume
- PAMI-1
- Issue
- 1
- Pages
- 25-37
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2106754084
- Cited by
- 218
- References
- 1
- FWCI
- 3.01
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.