An axiomatic approach to intrinsic dimension of a dataset
From MaRDI portal
Publication:1931997
Abstract: We perform a deeper analysis of an axiomatic approach to the concept of intrinsic dimension of a dataset proposed by us in the IJCNN'07 paper (arXiv:cs/0703125). The main features of our approach are that a high intrinsic dimension of a dataset reflects the presence of the curse of dimensionality (in a certain mathematically precise sense), and that dimension of a discrete i.i.d. sample of a low-dimensional manifold is, with high probability, close to that of the manifold. At the same time, the intrinsic dimension of a sample is easily corrupted by moderate high-dimensional noise (of the same amplitude as the size of the manifold) and suffers from prohibitevely high computational complexity (computing it is an -complete problem). We outline a possible way to overcome these difficulties.
Recommendations
- Intrinsic dimension of geometric data sets
- Intrinsic dimension estimation: advances and open problems
- Intrinsic dimension estimation of data: An approach based on Grassberger-Procaccia's algorithm
- Intrinsic dimension estimation: relevant techniques and a benchmark framework
- Intrinsic dimension identification via graph-theoretic methods
- A fundamental bias in calculating dimensions from finite data sets
- scientific article; zbMATH DE number 3864315
Cites work
- scientific article; zbMATH DE number 1643847 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1950575 (Why is no real title available?)
- Asymptotic theory of finite dimensional normed spaces. With an appendix by M. Gromov: Isoperimetric inequalities in Riemannian manifolds
- Distance-based classification with Lipschitz functions
- Geodesic Entropic Graphs for Dimension and Entropy Estimation in Manifold Learning
- In search of non-Gaussian components of a high-dimensional distribution
- Mass transportation problems. Vol. 1: Theory. Vol. 2: Applications
- Metric structures for Riemannian and non-Riemannian spaces. Transl. from the French by Sean Michael Bates. With appendices by M. Katz, P. Pansu, and S. Semmes. Edited by J. LaFontaine and P. Pansu
- Neural Network Learning
- On the geometry of similarity search: dimensionality curse and concentration of measure
- The concentration of measure phenomenon
Cited in
(13)- A topological approach to inferring the intrinsic dimension of convex sensing data
- Dimension estimation using weighted correlation dimension method
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality?
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions
- Prequential analysis of complex data with adaptive model reselection
- Measuring evolving data streams' behavior through their intrinsic dimension
- A fundamental bias in calculating dimensions from finite data sets
- A new inductive approach for counting dimension in large scale
- Intrinsic dimension estimation: advances and open problems
- Indexability, concentration, and VC theory
- Intrinsic dimension estimation: relevant techniques and a benchmark framework
- Anderson relaxation test for intrinsic dimension selection in model-based clustering
- Intrinsic dimension of geometric data sets
This page was built for publication: An axiomatic approach to intrinsic dimension of a dataset
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1931997)