The combination of multiple classifiers using an evidential reasoning approach

DOI10.1016/j.artint.2008.06.002zbMath1184.68385MaRDI QIDQ2389681

Yaxin Bi, David. A. Bell, J. W. Guan

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2008.06.002

zbMATH Keywords

evidential reasoning; ensemble methods; combination functions; Dempster's rule of combination; evidential structures

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

Related Items

Logistic Regression Revisited: Belief Function Analysis, Matrix games with payoffs of belief structures, Approximate classification with web ontologies through evidential terminological trees and forests, Heterogeneous information fusion: combination of multiple supervised and unsupervised classification methods based on belief functions, Two-probabilities focused combination in recommender systems, Measuring Impact of Diversity of Classifiers on the Accuracy of Evidential Ensemble Classifiers, HOW TO RANDOMLY GENERATE MASS FUNCTIONS

Uses Software

• UCI-ml

Cites Work

• Bagging predictors
• Reinvestigating Dempster's idea on evidence combination
• Is combining classifiers with stacking better than selecting the best one?
• Implementing Dempster's rule for hierarchical evidence
• Measures of diversity in classifier ensembles and their relationship with the ensemble accuracy
• Approximating the combination of belief functions using the fast Möbius transform in a coarsened frame.
• On the justification of Dempster's rule of combination
• Conjunctive and disjunctive combination of belief functions induced by nondistinct bodies of evidence
• Analyzing the degree of conflict among belief functions
• Upper and Lower Probabilities Induced by a Multivalued Mapping
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item