Adaptive soft k-nearest-neighbour classifiers
From MaRDI portal
Recommendations
Cited in
(17)- Using \(k\)-nearest-neighbor classification in the leaves of a tree
- A new nearest neighbor classification algorithm based on local probability centers
- Learning with nearest neighbour classifiers
- A fast nearest neighbor classifier based on self-organizing incremental neural network
- Application of interval-valued aggregation to optimization problem of \(k\)-NN classifiers for missing values case
- kNN-P: a kNN classifier optimized by P systems
- A soft \(K\)-nearest neighbor voting scheme
- scientific article; zbMATH DE number 1692454 (Why is no real title available?)
- The intelligent Laplacian classifier
- A parallel network of modified 1-NN and k-NN classifiers – Application to remote-sensing image classification
- Improving the k-NCN classification rule through heuristic modifications
- Estimating the Posterior Probabilities Using the K-Nearest Neighbor Rule
- scientific article; zbMATH DE number 2085223 (Why is no real title available?)
- scientific article; zbMATH DE number 1567946 (Why is no real title available?)
- A selective adaptive k sub-convex-hull classifier
- Nearest-neighbour classifiers in natural scene analysis
- Center-based nearest neighbor classifier
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)