Högskolan i Skövde

his.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
On Evidential Combination Rules for Ensemble Classifiers
Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.ORCID-id: 0000-0001-8382-0300
Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.
Högskolan i Skövde, Institutionen för kommunikation och information. Högskolan i Skövde, Forskningscentrum för Informationsteknologi.ORCID-id: 0000-0003-2973-3112
2008 (engelsk)Inngår i: Proceedings of the 11th International Conference on Information Fusion: Cologne, Germany, June 30 - July 03, 2008, IEEE, 2008, s. 553-560Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

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.

sted, utgiver, år, opplag, sider
IEEE, 2008. s. 553-560
Emneord [en]
Ensemble classifiers, random forests, evidence theory, Dempster-Shafer theory, combination rules
Forskningsprogram
Teknik
Identifikatorer
URN: urn:nbn:se:his:diva-3606Scopus ID: 2-s2.0-56749142942ISBN: 978-3-00-024883-2 (digital)ISBN: 978-3-8007-3092-6 (tryckt)OAI: oai:DiVA.org:his-3606DiVA, id: diva2:291094
Konferanse
11th International Conference on Information Fusion, FUSION 2008, Cologne, 30 June 2008 through 3 July 2008, IEEE Catalog Number CFP08FUS, INSPEC Accession Number: 10365759, Code 74110
Merknad

10.1109/ICIF.2008.4632259

Tilgjengelig fra: 2010-01-29 Laget: 2010-01-29 Sist oppdatert: 2025-09-29bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Scopushttps://ieeexplore.ieee.org/document/4632259

Person

Boström, HenrikJohansson, RonnieKarlsson, Alexander

Søk i DiVA

Av forfatter/redaktør
Boström, HenrikJohansson, RonnieKarlsson, Alexander
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric

isbn
urn-nbn
Totalt: 1688 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf