The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Estimating the intrinsic dimension of data with a fractal-based method
Open accessAbstract
In this paper, the problem of estimating the intrinsic dimension of a data set is investigated. A fractal-based approach using the Grassberger-Procaccia algorithm is proposed. Since the Grassberger-Procaccia algorithm (1983) performs badly on sets of high dimensionality, an empirical procedure that improves the original algorithm has been developed. The procedure has been tested on data sets of known dimensionality and on time series of Santa Fe competition.
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
Neural Networks for Pattern Recognition
Bishop, C. M. (1995) · doi:10.1093/oso/9780198538493.001.0001 · Cited by 12,287
Cited by
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
Incremental 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
Data dimensionality estimation methods: a survey
Camastra, F. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00176-6 · Cited by 271
Self-citation(2012) · Cited by 253
Metadata
- Authors
- Camastra, F., & Vinciarelli, A.
- Venue
- IEEE Transactions on Pattern Analysis and Machine Intelligence
- Published
- 2002-10
- Volume
- 24
- Issue
- 10
- Pages
- 1404-1407
- ISSN
- 0162-8828 (ISSN-L)
- OpenAlex
- W2113957760
- Cited by
- 225
- References
- 1
- FWCI
- 7.71
- 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.