Fast k most similar neighbor classifier for mixed data (tree k-MSN)
From MaRDI portal
Publication:2654256
Recommendations
Cites work
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- A Data Structure and an Algorithm for the Nearest Point Problem
- An Algorithm for Finding Nearest Neighbors
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Fast multiscale clustering and manifold identification
- Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform
- scientific article; zbMATH DE number 1149439 (Why is no real title available?)
- Nearest neighbor pattern classification
- On the information and representation of non-Euclidean pairwise data
- On the Least Cost for Proximity Searching in Metric Spaces
- PCA-based branch and bound search algorithms for computing K nearest neighbors
- Reduction techniques for instance-based learning algorithms
- Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
- Search Space Reductions for Nearest-Neighbor Queries
- Some approaches to improve tree-based nearest neighbour search algorithms
- The Dissimilarity Representation for Pattern Recognition
Cited in
(3)
This page was built for publication: Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2654256)