Graph-theoretic procedures for dimension identification

DOI10.1006/jmva.2001.1992zbMath1006.60024OpenAlexW1967417740MaRDI QIDQ1604619

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

Publication date: 8 July 2002

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

Full work available at URL: https://doi.org/10.1006/jmva.2001.1992

zbMATH Keywords

dimensionality reductionmultidimensional scalingproximity data\(k\)-nearest-neighbors graph

Mathematics Subject Classification ID

Related Items (8)

Weak laws of large numbers in geometric probability ⋮ Intrinsic dimension estimation: relevant techniques and a benchmark framework ⋮ Intrinsic dimension identification via graph-theoretic methods ⋮ A clustering procedure based on the comparison between the \(k\) nearest neighbors graph and the minimal spanning tree. ⋮ Explicit laws of large numbers for random nearest-neighbour-type graphs ⋮ Local angles and dimension estimation from data on manifolds ⋮ Degree Frequencies in the Minimal Spanning Tree and Dimension Identification ⋮ Nearest neighbors methods for support vector machines

Cites Work

• Parallel concepts in graph theory
• Connectivity of the mutual \(k\)-nearest-neighbor graph in clustering and outlier detection
• Central limit theorems for some graphs in computational geometry.
• Nonmetric multidimensional scaling. A numerical method
• Some Statistical Approaches to Multidimensional Scaling Data
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph-theoretic procedures for dimension identification