Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
From MaRDI portal
Publication:2654256
DOI10.1016/j.patcog.2009.08.014zbMath1187.68460OpenAlexW2044931470MaRDI QIDQ2654256
Jesús Ariel Carrasco-Ochoa, Selene Hernández-Rodríguez, José Francisco Martínez-Trinidad
Publication date: 15 January 2010
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.patcog.2009.08.014
Uses Software
Cites Work
- Unnamed Item
- Fast and versatile algorithm for nearest neighbor search based on a lower bound tree
- Reduction techniques for instance-based learning algorithms
- On the information and representation of non-Euclidean pairwise data
- Experimental study on prototype optimisation algorithms for prototype-based classification in vector spaces
- Fast multiscale clustering and manifold identification
- Relaxational metric adaptation and its application to semi-supervised clustering and content-based image retrieval
- Some approaches to improve tree-based nearest neighbour search algorithms
- Fast search algorithms for vector quantization of images using multiple triangle inequalities and wavelet transform
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- The Dissimilarity Representation for Pattern Recognition
- Search Space Reductions for Nearest-Neighbor Queries
- A Data Structure and an Algorithm for the Nearest Point Problem
- A Branch and Bound Algorithm for Computing k-Nearest Neighbors
- An Algorithm for Finding Nearest Neighbors
- PCA-based branch and bound search algorithms for computing K nearest neighbors
- On the Least Cost for Proximity Searching in Metric Spaces
- An Improved Algorithm Finding Nearest Neighbor Using Kd-trees
- Nearest neighbor pattern classification