Evidential Editing K-Nearest Neighbor Classifier
From MaRDI portal
Publication:3451206
DOI10.1007/978-3-319-20807-7_42zbMath1465.68224OpenAlexW2406693602MaRDI QIDQ3451206
Lianmeng Jiao, Thierry Denoeux, Quan Pan
Publication date: 10 November 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20807-7_42
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 (3)
A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning ⋮ Evidential instance selection for \(K\)-nearest neighbor classification of big data ⋮ Cautious classification based on belief functions theory and imprecise relabelling
Uses Software
Cites Work
- Unnamed Item
- Representing uncertainty on set-valued variables using belief functions
- Decision making in the TBM: the necessity of the pignistic transformation
- Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
- Discriminatory Analysis. Nonparametric Discrimination: Consistency Properties
- k-nearest-neighbor Bayes-risk estimation
- Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
- Fuzzy sets
- Upper and Lower Probabilities Induced by a Multivalued Mapping
This page was built for publication: Evidential Editing K-Nearest Neighbor Classifier