Exact estimates of the probability of overfitting for multidimensional modeling families of algorithms-Reference-Cited by-同舟云学术

Exact estimates of the probability of overfitting for multidimensional modeling families of algorithms

Published:2011-03 Issue:1 Volume:21 Page:52-65
ISSN:1054-6618
Container-title:Pattern Recognition and Image Analysis
language:en
Short-container-title:Pattern Recognit. Image Anal.

Author:

Botov P. V.

Publisher

Pleiades Publishing Ltd

Subject

Computer Graphics and Computer-Aided Design,Computer Vision and Pattern Recognition

Link

http://link.springer.com/content/pdf/10.1134/S1054661811010032.pdf

Reference8 articles.

1. P. V. Botov, “Accurate Estimate of Relearning Probability for Monotonic and Unimodal Set of Algorithms,” in Proc. All-Russian Conf. Mathematical Methods for Pattern Recognition-14 (MAKS Press, Moscow, 2009), pp. 7–10.

2. I. O. Tolstikhin, “Relearning Probability of Dense and Rate Sets of Algorithms,” in Proc. Int. Conf. Intellectualization of Information Procession IIP-8 (MAKS Press, Moscow, 2010), pp. 83–86.

3. A. I. Frei, “Accurate Estimates of the Generalization Ability for Symmetric Set of Predictors and Randomized Learning Algorithms,” Pattern Recogn. Image Analysis 30(3), 241–250 (2010).

4. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics (Addison-Wesley, Reading, MA, 1994).

5. K. V. Vorontsov, “Combinatorial Probability and the Tightness of Generalization Bounds,” Pattern Recogn. Image Analysis 18(2), 243–259 (2008).

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On Overfitting of Classifiers Making a Lattice;Formal Concept Analysis;2017