Variants of k-regular nearest neighbor graph and their construction

DOI10.1016/J.IPL.2017.06.001MaRDI QIDQ2361494zbMATH OpenOpenAlexWikidataFDO

Authors Klaus Broelemann, Xiaoyi Jiang, Sudipto Mukherjee, Ananda S. Chowdhury

Publication date 30 June 2017

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2017.06.001

zbMATH Keywords

algorithmsgreedy algorithmk-NNk-regular nearest neighborneighborhood graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces
• A generalization of Kneser graphs
• scientific article; zbMATH DE number 4025480
• On nearest-neighbor graphs
• On nearest-neighbor graphs
• Greedy construction of nearly regular graphs
• The graph regularity method: variants, applications, and alternative methods
• scientific article; zbMATH DE number 4208095
• On constructing regular distance-preserving graphs

Cites work

• Graph-based natural language processing and information retrieval.
• Learning with $\ell ^{1}$-graph for image analysis
• Supervised neighborhood graph construction for semi-supervised classification

Cited in

(3)

• Dense neighborhoods on affinity graph
• Efficientk-NN graph construction for graphs on variables
• Practical Construction of k-Nearest Neighbor Graphs in Metric Spaces

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Variants of k-regular nearest neighbor graph and their construction

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