Evidential instance selection for \(K\)-nearest neighbor classification of big data
From MaRDI portal
Publication:2060769
DOI10.1016/j.ijar.2021.08.006OpenAlexW3197716620MaRDI QIDQ2060769
Yang You, Qian Wang, Chaoyu Gong, Pei-Hong Wang, Zhi-Gang Su
Publication date: 13 December 2021
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ijar.2021.08.006
Related Items (3)
Lymphoma segmentation from 3D PET-CT images using a deep evidential network ⋮ Adaptive evidential K-NN classification: integrating neighborhood search and feature weighting ⋮ A fast belief rule base generation and reduction method for classification problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 40 years of Dempster-Shafer theory
- A class boundary preserving algorithm for data condensation
- A high-performance, portable implementation of the MPI message passing interface standard
- A memetic algorithm for evolutionary prototype selection: A scaling up approach
- The transferable belief model
- A new evidential \(K\)-nearest neighbor rule based on contextual discounting with partially supervised learning
- Decision-making with belief functions: a review
- Prototype selection for dissimilarity-based classifiers
- Evidential Editing K-Nearest Neighbor Classifier
- An algorithm for a selective nearest neighbor decision rule (Corresp.)
- Asymptotic Properties of Nearest Neighbor Rules Using Edited Data
- Artificial Intelligence and Soft Computing - ICAISC 2004
- Nearest neighbor pattern classification
- Upper and Lower Probabilities Induced by a Multivalued Mapping
This page was built for publication: Evidential instance selection for \(K\)-nearest neighbor classification of big data
