Fast approximate kNN graph construction for high dimensional data via recursive Lanczos bisection

zbMATH Open1235.68137MaRDI QIDQ2880958FDOQ2880958

Authors: Jie Chen, Haw-Ren Fang, Y. Saad 

Publication date: 17 April 2012

Published in: Journal of Machine Learning Research (JMLR) (Search for Journal in Brave)

Full work available at URL: http://www.jmlr.org/papers/v10/chen09b.html

Recommendations

• Constructing a high-dimensional \(k\)NN-graph using a Z-order curve
• Distributed computation of the \textit{k}nn graph for large high-dimensional point sets
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• scientific article; zbMATH DE number 1559575
• scientific article; zbMATH DE number 1775450

zbMATH Keywords

high dimensional dataspectral methodLanczos algorithmdivide and conquernearest neighbors graph

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (17)

• Edge integrity of nearest neighbor graphs and separator theorems
• Power spectral clustering
• Efficientk-NN graph construction for graphs on variables
• Multi-view graph convolutional networks with attention mechanism
• Index structures for fast similarity search for real vectors. II
• Hierarchically compositional kernels for scalable nonparametric learning
• Novel high intrinsic dimensionality estimators
• Distributed computation of the \textit{k}nn graph for large high-dimensional point sets
• Title not available (Why is that?)
• Riemannian gradient descent methods for graph-regularized matrix completion
• Matrix-free Krylov iteration for implicit convolution of numerically low-rank data
• Graph-based time-space trade-offs for approximate near neighbors
• Constructing a high-dimensional \(k\)NN-graph using a Z-order curve
• A survey of neighborhood construction algorithms for clustering and classifying data points
• Efficient dynamic graph construction for inductive semi-supervised learning
• An incremental learning algorithm based on the \( K\)-associated graph for non-stationary data classification
• Time series clustering via community detection in networks

Uses Software

• svdpack

This page was built for publication: Fast approximate \(k\)NN graph construction for high dimensional data via recursive Lanczos bisection

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