By Topic

Capacity and Error Estimates for Boolean Classifiers with Limited Complexity

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Pearl, J. ; SENIOR MEMBER, IEEE, School of Engineering and Applied Science, University of California, Los Angeles, CA 90024.

This paper extends the notions of capacity and distribution-free error estimation to nonlinear Boolean classifiers on patterns with binary-valued features. We establish quantitative relationships between the dimensionality of the feature vectors (d), the combinational complexity of the decision rule (c), the number of samples in the training set (n), and the classification performance of the resulting classifier. Our results state that the discriminating capacity of Boolean classifiers is given by the product dc, and the probability of ambiguous generalization is asymptotically given by (n/dc-1)-1 0(log d)/d) for large d, and n=0(dc). In addition we show that if a fraction ¿ of the training samples is misclassified then the probability of error (¿) in subsequent samples satisfies P(|¿-¿| ¿) m=<2.773 exp (dc-e2n/8) for all distributions, regardless of how the classifier was discovered.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-1 ,  Issue: 4 )