Intrinsic dimension identification via graph-theoretic methods

DOI10.1016/j.jmva.2012.12.007zbMath1359.62279OpenAlexW2152762378MaRDI QIDQ391544

Joseph E. Yukich, María Rosa Brito, Adolfo J. Quiroz

Publication date: 10 January 2014

Published in: Journal of Multivariate Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmva.2012.12.007

zbMATH Keywords

intrinsic dimensiondimensionality reductionstabilization methodsgraph theoretical methods

Mathematics Subject Classification ID

Multivariate analysis (62H99) Asymptotic properties of nonparametric inference (62G20) Geometric probability and stochastic geometry (60D05) Central limit and other weak theorems (60F05) Nonparametric inference (62G99)

Related Items (7)

Shannon’s entropy of partitions determined by hierarchical clustering trees in asymmetry and dimension identification ⋮ Intrinsic dimension estimation: relevant techniques and a benchmark framework ⋮ Convergence rates for estimators of geodesic distances and Frèchet expectations ⋮ On the number of weakly connected subdigraphs in random \(k\)NN digraphs ⋮ On the Number of Reflexive and Shared Nearest Neighbor Pairs in One-Dimensional Uniform Data ⋮ Local angles and dimension estimation from data on manifolds ⋮ Nearest neighbors methods for support vector machines

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Limit theory for point processes in manifolds
• Semi-supervised learning on Riemannian manifolds
• Graph-theoretic measures of multivariate association and prediction
• Connected spatial networks over random points and a route-length statistic
• Sparsity and the possibility of inference
• Measuring the strangeness of strange attractors
• Multivariate generalizations of the Wald-Wolfowitz and Smirnov two-sample tests
• The central limit theorem for Euclidean minimal spanning trees. I
• Probability theory of classical Euclidean optimization problems
• Graph-theoretic procedures for dimension identification
• The central limit theorem for weighted minimal spanning trees on random points
• Weak laws of large numbers in geometric probability
• Central limit theorems for some graphs in computational geometry.
• Mutual and shared neighbor probabilities: finite- and infinite-dimensional results
• On the number of leaves of a euclidean minimal spanning tree
• An Intrinsic Dimensionality Estimator from Near-Neighbor Information
• Random Geometric Graphs

This page was built for publication: Intrinsic dimension identification via graph-theoretic methods