Generalization error bounds for the logical analysis of data
This paper analyzes the predictive performance of standard techniques for the logical analysis of data (LAD), within a probabilistic framework. It does so by bounding the generalization error of related polynomial threshold functions in terms of their complexity and how well they fit the training data. We also quantify the predictive accuracy in terms of the extent to which there is a large separation (a large margin) between (most of) the positive and negative observations.
generalization error logical analysis of data polynomial threshold functions lad methods machine learning learning algorithms