An Algorithm for Finding Nearest Neighbors
From MaRDI portal
Publication:4069807
Cited in
(21)- Nearest neighbors methods for support vector machines
- Comparison of various trees for nearest-point search with/without the Voronoi diagram.
- A fuzzy extended \(k\)-nearest neighbors rule
- Probably correct \(k\)-nearest neighbor search in high dimensions
- Nearest-neighbour estimation of semiparametric regression models
- Efficient prototype reordering in nearest neighbor classification
- Heuristic and optimization approaches to extending the Kohonen self organizing algorithm
- Information storage and search complexity theory
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Algorithms for ordering unorganized points along parametrized curves
- A METHOD FOR DETERMINING k‐NEAREST NEIGHBOURS
- Privacy-preserving \(k\)-nearest neighbour query on outsourced database
- Adaptive tangent distance classifier on recognition of handwritten digits
- Multi-criterion Pareto based particle swarm optimized polynomial neural network for classification: a review and state-of-the-art
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Consolidation of structure of high noise data by a new noise index and reinforcement learning
- Probabilistic analysis of an algorithm for solving the \(k\)-dimensional all-nearest-neighbors problem by projection
- Predicting enzyme family classes by hybridizing gene product composition and pseudo-amino acid composition
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Possibilistic instance-based learning
This page was built for publication: An Algorithm for Finding Nearest Neighbors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4069807)
