Variants of k-regular nearest neighbor graph and their construction

DOI10.1016/j.ipl.2017.06.001zbMath1407.68348OpenAlexW2622959728WikidataQ61913900 ScholiaQ61913900MaRDI QIDQ2361494

Sudipto Mukherjee, Klaus Broelemann, Xiaoyi Jiang, 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 algorithmneighborhood graphk-NNk-regular nearest neighbor

Mathematics Subject Classification ID

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

Uses Software

• UCI-ml

Cites Work

• Supervised neighborhood graph construction for semi-supervised classification
• Graph-based Natural Language Processing and Information Retrieval
• Learning with $\ell ^{1}$-graph for image analysis

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