scientific article; zbMATH DE number 1759588

zbMATH Open0996.68811MaRDI QIDQ4536573FDOQ4536573

Authors: Francisco Moreno-Seco, Luisa Micó, Jose Oncina 

Publication date: 25 June 2002

Title of this publication is not available (Why is that?)

Recommendations

• A modification of the LAESA algorithm for approximated k-NN classification
• scientific article; zbMATH DE number 2090268
• scientific article; zbMATH DE number 2101259
• scientific article; zbMATH DE number 2050893
• Improved \(k\)-nearest neighbor classification

zbMATH Keywords

pattern recognitionmetric spacesnearest neighbour

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Cited In (13)

• Title not available (Why is that?)
• Simple termination conditions for k-nearest neighbor method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Classical and fast parameters tuning in nearest neighbors with stop condition
• 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)
• PCA-based branch and bound search algorithms for computing K nearest neighbors
• A modification of the LAESA algorithm for approximated k-NN classification
• A permutation test approach to the choice of sizekfor the nearest neighbors classifier

This page was built for publication:

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