Combining the results in pairwise classification using dempster-shafer theory: a comparison of two approaches

Authors:
Marcin Gromisz;Sławomir Zadrożny
Affiliations:
SRI PAS, Warsaw, Poland;Systems Research Institute PAS, Warsaw, Poland
Venue:
ICAISC'10 Proceedings of the 10th international conference on Artificial intelligence and soft computing: Part I
Year:
2010

Citing 8
Cited 0

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
The transferable belief model

Artificial Intelligence
Round robin classification

The Journal of Machine Learning Research
Pattern Classification (2nd Edition)

Pattern Classification (2nd Edition)
Combining Pattern Classifiers: Methods and Algorithms

Combining Pattern Classifiers: Methods and Algorithms
Modeling Hesitation and Conflict: A Belief-Based Approach for Multi-class Problems

ICMLA '06 Proceedings of the 5th International Conference on Machine Learning and Applications
Pairwise classifier combination using belief functions

Pattern Recognition Letters
Analysis of evidence-theoretic decision rules for pattern classification

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper deals with the multi-class (polychotomous) classification problem solved using an ensemble of binary classifiers. The use of the Dempster-Shafer theory to combine the results of binary classifiers is studied. Two approaches are proposed and compared. Some experimental results are provided.