A Branch and Bound Algorithm for Computing k-Nearest Neighbors

Cited in

(33)

WINNING ENTRY OF THE K. U. LEUVEN TIME-SERIES PREDICTION COMPETITION
A fuzzy extended \(k\)-nearest neighbors rule
Random clustering forest for extended belief rule-based system
An optimal-transport finite-particle method for mass diffusion
Probably correct \(k\)-nearest neighbor search in high dimensions
A complete system for NN classification based on a VLSI array processor
Evaluation of prototype learning algorithms for nearest-neighbor classifier in application to handwritten character recognition
Image classification based on quantum K-nearest-neighbor algorithm
Chromatic distribution of k-nearest neighbors of a line segment in a planar colored point set
Efficient prototype reordering in nearest neighbor classification
Distance-based index structures for fast similarity search
Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
Chromatic nearest neighbor searching: A query sensitive approach
GRAFT, a complete system for data fusion
Index structures for fast similarity search for real vectors. II
Some approaches to improve tree-based nearest neighbour search algorithms
Self-generating prototypes for pattern classification
Thinking ultrametrically, thinking \(p\)-adically
Fast nearest neighbors search in graph space based on a branch-and-bound strategy
Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem
A fast nearest neighbor search algorithm by filtration
Performance of feature-selection methods in the classification of high-dimension data
A VNS based framework for early diagnosis of the Alzheimer's disease converted from mild cognitive impairment
Parallel algorithms for nearest neighbor search problems in high dimensions
A novel texture clustering method based on shift invariant DWT and locality preserving projection
Model-free and prior-free data-driven inference in mechanics
Model-free data-driven inference in computational mechanics
Vertex nomination via seeded graph matching
Dual‐tree fast exact max‐kernel search
Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
Efficient data structures for model-free data-driven computational mechanics
Fast exact \(k\) nearest neighbors search using an orthogonal search tree

This page was built for publication: A Branch and Bound Algorithm for Computing k-Nearest Neighbors

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