Published June 2, 1997 | Version Submitted
Technical Report Open

Validation of Voting Committee

Creators

Abstract

This paper 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 fro classifiers in general.

Additional Information

© 1997 California Institute of Technology. Thanks to Joel Franklin for advice, teaching, and encouragement. Thanks to Yaser Abu-Mostafa for teaching, and thanks to Amir Atiya, Zehra Cataltepe, Malik Magdon-Ismail, Alexander Nicholson, Sam Roweis, Joseph Sill, and Xubo Song for useful pointers and discussions.

Attached Files

Submitted - CS-TR-97-13.pdf

Submitted - CS-TR-97-13.ps

Files

CS-TR-97-13.pdf

Files (1.4 MB)

Name Size
md5:3c4f287dbd3d75ee4be856e090000a38
613.1 kB Preview Download
md5:8299fad37b8b3084b4b77b7855f0b10d
795.2 kB Download

Additional details

Identifiers

Eprint ID
26898
Resolver ID
CaltechCSTR:1997.cs-tr-97-13

Dates

Created
2001-07-19
Created from EPrint's datestamp field
Updated
2019-10-03
Created from EPrint's last_modified field

Caltech Custom Metadata