On Evidential Combination Rules for Ensemble Classifiers

Boström, HenrikHögskolan i Skövde,Institutionen för kommunikation och information,Forskningscentrum för Informationsteknologi (author)

QC 20180119. QC 20200113
10.1109/ICIF.2008.4632259
Ensemble classifiers are known to generally perform better than each individual classifier of which they consist. One approach to classifier fusion is to apply Shafer’s theory of evidence. While most approaches have adopted Dempster’s rule of combination, a multitude of combination rules have been proposed. A number of combination rules as well as two voting rules are compared when used in conjunction with a specific kind of ensemble classifier, known as random forests, w.r.t. accuracy, area under ROC curve and Brier score on 27 datasets. The empirical evaluation shows that the choice of combination rule can have a significant impact on the performance for a single dataset, but in general the evidential combination rules do not perform better than the voting rules for this particular ensemble design. Furthermore, among the evidential rules, the associative ones appear to have better performance than the non-associative.

Johansson, RonnieHögskolan i Skövde,Institutionen för kommunikation och information,Forskningscentrum för Informationsteknologi(Swepub:his)joso (author)
Karlsson, AlexanderHögskolan i Skövde,Institutionen för kommunikation och information,Forskningscentrum för Informationsteknologi(Swepub:his)karx (author)
Högskolan i SkövdeInstitutionen för kommunikation och information (creator_code:org_t)

In:Proceedings of the 11th International Conference on Information Fusion: IEEE, s. 553-56097838007309269783000248832

By the author/editor: Boström, Henrik; Johansson, Ronni ...; Karlsson, Alexan ...

About the subject

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.