The influence of oppositely classified examples on the generalization complexity of Boolean functions


In this paper, we analyze Boolean functions using a recently proposed measure of their complexity. This complexity measure, motivated by the aim of relating the complexity of the functions with the generalization ability that can be obtained when the functions are implemented in feed-forward neural networks, is the sum of a number of components. We… (More)
DOI: 10.1109/TNN.2006.872352


9 Figures and Tables

Slides referencing similar topics