Adaptive soft k-nearest-neighbour classifiers
From MaRDI portal
Publication:1860089
DOI10.1016/S0031-3203(99)00186-7zbMATH Open1006.68834WikidataQ127580429 ScholiaQ127580429MaRDI QIDQ1860089FDOQ1860089
Authors: Sergio Bermejo, Joan Cabestany
Publication date: 20 February 2003
Published in: Pattern Recognition (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (15)
- Title not available (Why is that?)
- Application of interval-valued aggregation to optimization problem of \(k\)-NN classifiers for missing values case
- Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule
- Nearest-neighbour classifiers in natural scene analysis
- A soft \(K\)-nearest neighbor voting scheme
- Using \(k\)-nearest-neighbor classification in the leaves of a tree
- Learning with nearest neighbour classifiers
- Center-based nearest neighbor classifier
- The intelligent Laplacian classifier
- A selective adaptive \(k\) sub-convex-hull classifier
- A fast nearest neighbor classifier based on self-organizing incremental neural network
- Title not available (Why is that?)
- kNN-P: a kNN classifier optimized by P systems
- Title not available (Why is that?)
- A new nearest neighbor classification algorithm based on local probability centers
Uses Software
This page was built for publication: Adaptive soft \(k\)-nearest-neighbour classifiers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1860089)