Generalization bounds for incremental search classification

March, 2000
Report Number: 
Yoram Gat
J. Comb. Theory A. 98,175-191 (2002)

This paper presents generalization bounds for a certain class of classification algorithms. The bounds presented take advantage of the local nature of the search that these algorithms use in order to obtain bounds that are better than those that can be obtained using VC type bounds. The results are applied to well-known classification algorithms such as classification trees and the perceptron.

PDF File: 
Postscript File: