A modification of the LAESA algorithm for approximated k-NN classification
From MaRDI portal
Publication:4421029
DOI10.1016/S0167-8655(02)00187-3zbMATH Open1054.68125OpenAlexW2052598245MaRDI QIDQ4421029FDOQ4421029
Authors: Francisco Moreno-Seco, Luisa Micó, Jose Oncina
Publication date: 19 August 2003
Published in: Pattern Recognition Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-8655(02)00187-3
Recommendations
Cited In (9)
- Automatic classification of protein structure using the maximum contact map overlap metric
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast \(k\) most similar neighbor classifier for mixed data (tree \(k\)-MSN)
- Comparison of AESA and LAESA search algorithms using string and tree-edit-distances
- Prototype selection for dissimilarity-based classifiers
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- Improved \(k\)-nearest neighbor classification
This page was built for publication: A modification of the LAESA algorithm for approximated k-NN classification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4421029)