Bax, Eric (1998) Validation of Voting Committees. Neural Computation, 10 (4). pp. 975-986. ISSN 0899-7667 http://resolver.caltech.edu/CaltechAUTHORS:20090918-132020441
- Published Version
See Usage Policy.
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:20090918-132020441
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.
|Additional Information:||© 1998 The MIT Press. Received January 27, 1997; accepted August 19, 1997. Thanks to Joel Franklin for advice, teaching, and encouragement. Thanks to Yaser Abu-Mostafa for teaching, and to Amir Atiya, Zehra Cataltepe, Malik Magdon-Ismail, Alexander Nicholson, Sam Roweis, Joseph Sill, and Xubo Song for useful pointers and discussions.|
|Official Citation:||Validation of Voting Committees Eric Bax Neural Computation 1998 10:4, 975-986|
|Usage Policy:||No commercial reproduction, distribution, display or performance rights in this work are provided.|
|Deposited By:||George Porter|
|Deposited On:||22 Sep 2009 17:45|
|Last Modified:||26 Dec 2012 11:24|
Repository Staff Only: item control page