Show simple item record  

dc.contributor.authorBouckaert, Remco R.en_US
dc.date.accessioned2008-03-19T04:58:14Z
dc.date.available2007-07-22en_US
dc.date.available2008-03-19T04:58:14Z
dc.date.issued2002-06-01en_US
dc.identifier.citationBouckaert, R.R. (2002). Accuracy bounds for ensembles under 0 1 loss. (Working paper series. University of Waikato, Department of Computer Science. No. 04/02/2002). Hamilton, New Zealand: University of Waikato.en_US
dc.identifier.urihttps://hdl.handle.net/10289/62
dc.description.abstractThis paper is an attempt to increase the understanding in the behavior of ensembles for discrete variables in a quantitative way. A set of tight upper and lower bounds for the accuracy of an ensemble is presented for wide classes of ensemble algorithms, including bagging and boosting. The ensemble accuracy is expressed in terms of the accuracies of the members of the ensemble. Since those bounds represent best and worst case behavior only, we study typical behavior as well, and discuss its properties. A parameterised bound is presented which describes ensemble bahavior as a mixture of dependent base classifier and independent base classifier areas. Some empirical results are presented to support our conclusions.en_US
dc.format.mimetypeapplication/pdf
dc.language.isoen
dc.publisherDept. of Computer Scienceen_NZ
dc.relation.ispartofseriesComputer Science Working Papers
dc.rightsUniversity of Waikato, Department of Computer Science
dc.titleAccuracy bounds for ensembles under 0 - 1 loss.en_US
dc.typeWorking Paperen_US
uow.relation.series04/02
pubs.elements-id52169
pubs.place-of-publicationUniversity of Waikatoen_NZ


Files in this item

This item appears in the following Collection(s)

Show simple item record