A new evidential K-nearest neighbor rule based on contextual discounting with partially supervised learning
DOI10.1016/J.IJAR.2019.07.009zbMATH Open1468.68151OpenAlexW2965768175MaRDI QIDQ2302780FDOQ2302780
T. Denœux, Songsak Sriboonchitta, Orakanya Kanjanatarakul
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
Recommendations
- An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
- Adaptive evidential K-NN classification: integrating neighborhood search and feature weighting
- Evidential instance selection for \(K\)-nearest neighbor classification of big data
- Evidential editing \(K\)-nearest neighbor classifier
- On supervised and semi-supervised \(k\)-nearest neighbor algorithms
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)
Cites Work
- Learning from partially supervised data using mixture models and belief functions
- Title not available (Why is that?)
- Upper and Lower Probabilities Induced by a Multivalued Mapping
- Computational Statistics
- The transferable belief model
- Belief functions: The disjunctive rule of combination and the generalized Bayesian theorem
- Decision making in the TBM: the necessity of the pignistic transformation
- 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
- Corrigendum to ``Belief functions contextual discounting and canonical decompositions
- Decision-making with belief functions: a review
- Handling possibilistic labels in pattern classification using evidential reasoning.
- Evidential Editing K-Nearest Neighbor Classifier
- An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
- Parametric classification with soft labels using the evidential EM algorithm: linear discriminant analysis versus logistic regression
Cited In (9)
- Lymphoma segmentation from 3D PET-CT images using a deep evidential network
- Learning from fuzzy labels: theoretical issues and algorithmic solutions
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- An Evidential K-Nearest Neighbor Classifier Based on Contextual Discounting and Likelihood Maximization
- Belief functions and rough sets: survey and new insights
- A heuristic representation learning based on evidential memberships: case study of UCI-SPECTF
- Evidential instance selection for \(K\)-nearest neighbor classification of big data
- Special issue from the 5th international conference on belief functions (BELIEF 2018)
- Uncertainty quantification in logistic regression using random fuzzy sets and belief functions
Uses Software
This page was built for publication: A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2302780)
