A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning
DOI10.1016/j.ijar.2019.07.009zbMath1468.68151OpenAlexW2965768175MaRDI QIDQ2302780
Songsak Sriboonchitta, Orakanya Kanjanatarakul, Thierry Denoeux
Publication date: 26 February 2020
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2019.07.009
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- Proposition and learning of some belief function contextual correction mechanisms
- Belief functions contextual discounting and canonical decompositions
- Relevance and truthfulness in information correction and fusion
- Learning from partially supervised data using mixture models and belief functions
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- The transferable belief model
- Decision making in the TBM: the necessity of the pignistic transformation
- Decision-making with belief functions: a review
- Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression
- Evidential Editing K-Nearest Neighbor Classifier
- Computational Statistics
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Handling possibilistic labels in pattern classification using evidential reasoning.
- Corrigendum to ``Belief functions contextual discounting and canonical decompositions
- An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
This page was built for publication: A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning