The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Estimating the intrinsic dimension of datasets by a minimal neighborhood information
Open accessAbstract
Analyzing large volumes of high-dimensional data is an issue of fundamental importance in data science, molecular simulations and beyond. Several approaches work on the assumption that the important content of a dataset belongs to a manifold whose Intrinsic Dimension (ID) is much lower than the crude large number of coordinates. Such manifold is generally twisted and curved; in addition points on it will be non-uniformly distributed: two factors that make the identification of the ID and its exploitation really hard. Here we propose a new ID estimator using only the distance of the first and the second nearest neighbor of each point in the sample. This extreme minimality enables us to reduce the effects of curvature, of density variation, and the resulting computational cost. The ID estimator is theoretically exact in uniformly distributed datasets, and provides consistent measures in general. When used in combination with block analysis, it allows discriminating the relevant dimensions as a function of the block size. This allows estimating the ID even when the data lie on a manifold perturbed by a high-dimensional noise, a situation often encountered in real world data sets. We demonstrate the usefulness of the approach on molecular simulations and image analysis.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Advances in neural information processing systems 7
Cios, K., & Shields, M. (1997) · Neurocomputing · doi:10.1016/s0925-2312(97)90018-7 · Cited by 22,059
Nonlinear Dimensionality Reduction by Locally Linear Embedding
Roweis, S. T., & Saul, L. K. (2000) · Science · doi:10.1126/science.290.5500.2323 · Cited by 14,965
Jolliffe, I. (2005) · Encyclopedia of Statistics in Behavioral Science · doi:10.1002/0470013192.bsa501 · Cited by 14,310
A Global Geometric Framework for Nonlinear Dimensionality Reduction
Tenenbaum, J. B., Silva, V. D., & Langford, J. C. (2000) · Science · doi:10.1126/science.290.5500.2319 · Cited by 13,585
Wold, S., Esbensen, K., & Geladi, P. (1987) · Chemometrics and Intelligent Laboratory Systems · doi:10.1016/0169-7439(87)80084-9 · Cited by 11,606
GROMACS 4.5: a high-throughput and highly parallel open source molecular simulation toolkit
Pronk, S., Páll, S., Schulz, R., Larsson, P., Bjelkmar, P., Apostolov, R., Shirts, M. R., Smith, J. C., Kasson, P. M., van der Spoel, D., et al. (2013) · Bioinformatics · doi:10.1093/bioinformatics/btt055 · Cited by 7,473
Characterization of Strange Attractors
Grassberger, P., & Procaccia, I. (1983) · Physical Review Letters · doi:10.1103/physrevlett.50.346 · Cited by 4,857
Chen, M., Mao, S., & Liu, Y. (2014) · Mobile Networks and Applications · doi:10.1007/s11036-013-0489-0 · Cited by 2,913
Scalable Nearest Neighbor Algorithms for High Dimensional Data
Muja, M., & Lowe, D. G. (2014) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2014.2321376 · Cited by 1,407
Separation of a mixture of independent signals using time delayed correlations
Molgedey, L., & Schuster, H. G. (1994) · Physical Review Letters · doi:10.1103/physrevlett.72.3634 · Cited by 882
Cited by
Statistical Mechanics: Theory and Molecular Simulation
Tuckerman, M. E. (2023) · doi:10.1093/oso/9780198825562.001.0001 · Cited by 973
Patch SVDD: Patch-Level SVDD for Anomaly Detection and Segmentation
Yi, J., & Yoon, S. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-69544-6_23 · Cited by 551
Shallow neural networks for fluid flow reconstruction with limited sensors
Erichson, N. B., Mathelin, L., Yao, Z., Brunton, S. L., Mahoney, M. W., & Kutz, J. N. (2020) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2020.0097 · Cited by 259
Molecular Insights from Conformational Ensembles via Machine Learning
Fleetwood, O., Kasimova, M. A., Westerlund, A. M., & Delemotte, L. (2020) · Biophysical Journal · doi:10.1016/j.bpj.2019.12.016 · Cited by 93
Explaining Any Time Series Classifier
Guidotti, R., Monreale, A., Spinnato, F., Pedreschi, D., & Giannotti, F. (2020) · 2020 IEEE Second International Conference on Cognitive Machine Intelligence (CogMI) · doi:10.1109/cogmi50398.2020.00029 · Cited by 46
Metadata
- Authors
- Facco, E., d’Errico, M., Rodriguez, A., & Laio, A.
- Venue
- Scientific Reports
- Published
- 2017-09-22
- Volume
- 7
- Issue
- 1
- Pages
- 12140-12140
- ISSN
- 2045-2322 (ISSN-L)
- OpenAlex
- W2754478492
- Cited by
- 351
- References
- 22
- FWCI
- 11.37
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Estimating the intrinsic dimension of datasets by a minimal neighborhood information. https://app.cochat.ai/papers/10.1038/s41598-017-11873-y
- The paper
- Facco, E., d’Errico, M., Rodriguez, A., & Laio, A. (2017). Estimating the intrinsic dimension of datasets by a minimal neighborhood information. Scientific Reports. https://doi.org/10.1038/s41598-017-11873-y
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.