A computationally efficient approximation of Dempster-Shafer theory
International Journal of Man-Machine Studies
Artificial Intelligence
k-order additive discrete fuzzy measures and their representation
Fuzzy Sets and Systems - Special issue on fuzzy measures and integrals
New Semantics for Quantitative Possibility Theory
ECSQARU '01 Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
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
A dempster-shafer theoretic framework for boosting based ensemble design
Pattern Analysis & Applications
The combination of multiple classifiers using an evidential reasoning approach
Artificial Intelligence
Belief Functions and Cluster Ensembles
ECSQARU '09 Proceedings of the 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A new technique for combining multiple classifiers using the dempster-shafer theory of evidence
Journal of Artificial Intelligence Research
Results of the RIMES Evaluation Campaign for Handwritten Mail Processing
ICDAR '09 Proceedings of the 2009 10th International Conference on Document Analysis and Recognition
Off-line handwritten word recognition using multi-stream hidden Markov models
Pattern Recognition Letters
Evidential combination of multiple HMM classifiers for multi-script handwriting recognition
IPMU'10 Proceedings of the Computational intelligence for knowledge-based systems design, and 13th international conference on Information processing and management of uncertainty
Classifier fusion in the Dempster--Shafer framework using optimized t-norm based combination rules
International Journal of Approximate Reasoning
An overview of character recognition focused on off-line handwriting
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Hi-index | 0.00 |
The Dempster-Shafer theory (DST) is particularly interesting to deal with imprecise information. However, it is known for its high computational cost, as dealing with a frame of discernment Ω involves the manipulation of up to 2|Ω| elements. Hence, classification problems where the number of classes is too large cannot be considered. In this paper, we propose to take advantage of a context of ensemble classification to construct a frame of discernment where only a subset of classes is considered. We apply this method to script recognition problems, which by nature involve a tremendous number of classes.