The DOI matches its Crossref record.
An evaluation of intrinsic dimensionality estimators
Open accessAbstract
The intrinsic dimensionality of a data set may be useful for understanding the properties of classifiers applied to it and thereby for the selection of an optimal classifier. In this paper the authors compare the algorithms for two estimators of the intrinsic dimensionality of a given data set and extend their capabilities. One algorithm is based on the local eigenvalues of the covariance matrix in several small regions in the feature space. The other estimates the intrinsic dimensionality from the distribution of the distances from an arbitrary data vector to a selection of its neighbors. The characteristics of the two estimators are investigated and the results are compared. It is found that both can be applied successfully, but that they might fail in certain cases. The estimators are compared and illustrated using data generated from chromosome banding profiles.>
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
Cited by
Complexity measures of supervised classification problems
Ho, T. K., & Basu, M. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.990132 · Cited by 734
Lin, T., & Zha, H. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.70735 · Cited by 446
Geodesic 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
Data 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].”
Method
Metadata
- Authors
- Verveer, P. J., & Duin, R. P. W.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 1995
- Volume
- 17
- Issue
- 1
- Pages
- 81-86
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2124812588
- Cited by
- 159
- References
- 0
- FWCI
- 2.89
- Type
- journal article
- Language
- en
- Open access
- green
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.