An Error Bound Based on a Worst Likely Assignment

  • Authors:
  • Eric Bax;Augusto Callejas

  • Affiliations:
  • -;-

  • Venue:
  • The Journal of Machine Learning Research
  • Year:
  • 2008
  • Validation of network classifiers

    SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition

Quantified Score

Hi-index 0.02

Visualization

Abstract

This paper introduces a new PAC transductive error bound for classification. The method uses information from the training examples and inputs of working examples to develop a set of likely assignments to outputs of the working examples. A likely assignment with maximum error determines the bound. The method is very effective for small data sets.