Intrinsic dimension identification via graph-theoretic methods

DOI10.1016/J.JMVA.2012.12.007MaRDI QIDQ391544zbMATH OpenOpenAlexFDO

Authors M. R. Brito, A. J. Quiroz, J. E. Yukich

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

dimensionality reductiongraph theoretical methodsintrinsic dimensionstabilization methods

Mathematics Subject Classification ID

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

Recommendations

• Graph-theoretic procedures for dimension identification
• Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
• Dimension estimation using random connection models
• Shape dimension and intrinsic metric from samples of manifolds
• Novel high intrinsic dimensionality estimators

Cites work

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

Cited in

(16)

• Graph-theoretic procedures for dimension identification
• Intrinsic dimension estimation: relevant techniques and a benchmark framework
• An axiomatic approach to intrinsic dimension of a dataset
• Intrinsic dimension of geometric data sets
• On the number of weakly connected subdigraphs in random \(k\)NN digraphs
• The theoretical detect index of dimensionality and its application to approximate simple structure
• Local angles and dimension estimation from data on manifolds
• Nearest neighbors methods for support vector machines
• Degree Frequencies in the Minimal Spanning Tree and Dimension Identification
• On the number of reflexive and shared nearest neighbor pairs in one-dimensional uniform data
• Convergence rates for estimators of geodesic distances and Fréchet expectations
• Dimension estimation using random connection models
• Shannon’s entropy of partitions determined by hierarchical clustering trees in asymmetry and dimension identification
• The intrinsic dimensionality of graphs
• Kernel two-sample tests for manifold data
• On consistent estimation of dimension values

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391544)