An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
From MaRDI portal
Recommendations
- A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning
- Evidential editing K-nearest neighbor classifier
- Likelihood inference in nearest-neighbour classification models
- On supervised and semi-supervised k-nearest neighbor algorithms
- Ensemble enhanced evidential \(k\)-NN classifier through random subspaces
Cites work
- Handling possibilistic labels in pattern classification using evidential reasoning.
- scientific article; zbMATH DE number 3560492 (Why is no real title available?)
- Learning from partially supervised data using mixture models and belief functions
- Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression
- Proposition and learning of some belief function contextual correction mechanisms
- The transferable belief model
Cited in
(4)- Evidential instance selection for \(K\)-nearest neighbor classification of big data
- A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning
- Evidential editing K-nearest neighbor classifier
- Learning contextual discounting and contextual reinforcement from labelled data
This page was built for publication: An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108658)
