title: Validation of voting committees.
abstract: This article contains a method to bound the test errors of voting committees with members chosen from a pool of trained classifiers. There are so many prospective committees that validating them directly does not achieve useful error bounds. Because there are fewer classifiers than prospective committees, it is better to validate the classifiers individually than use linear programming to infer committee error bounds. We test the method using credit card data. Also, we extend the method to infer bounds for classifiers in general.
authors.affiliation: Computer Science Department, California Institute of Technology, Pasadena, California 91125, USA.
authors.forename: E
authors.initials: E
authors.lastname: Bax
mesh_terms: D001185:Artificial Intelligence; D006801:Humans; D016014:Linear Models; D015588:Observer Variation; D011897:Random Allocation; D015203:Reproducibility of Results; D012984:Software