Obtaining accurate bounds of the probability of overfitting is a fundamental question in statistical learning theory. In this paper we propose exact combinatorial bounds for the family of classifiers making a lattice. We use some lattice properties to derive the probability of overfitting for a set of classifiers represented by concepts. The extent of a concept, in turn, matches the set of objects correctly classified by the corresponding classifier. Conducted experiments illustrate that the proposed bounds are consistent with the Monte Carlo bounds.
CITATION STYLE
Makhalova, T., & Kuznetsov, S. O. (2017). On overfitting of classifiers making a lattice. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10308 LNAI, pp. 184–197). Springer Verlag. https://doi.org/10.1007/978-3-319-59271-8_12
Mendeley helps you to discover research relevant for your work.