{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:22:56Z","timestamp":1773616976687,"version":"3.50.1"},"reference-count":30,"publisher":"Pleiades Publishing Ltd","issue":"5","license":[{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T00:00:00Z","timestamp":1619827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1134\/s0005117921050106","type":"journal-article","created":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T09:22:54Z","timestamp":1622539374000},"page":"863-876","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Sharpness Estimation of Combinatorial Generalization Ability Bounds for Threshold Decision Rules"],"prefix":"10.1134","volume":"82","author":[{"given":"Sh. Kh.","family":"Ishkina","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. V.","family":"Vorontsov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2021,6,1]]},"reference":[{"key":"2132_CR1","unstructured":"Kohavi, R., A study of cross-validation and bootstrap for accuracy estimation\nand model selection, Proc. Int. Joint Conf. Artif. Intell.\n(1995), pp. 1137\u20131143."},{"issue":"2","key":"2132_CR2","first-page":"264","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N. and Chervonenkis, A.Ya., On uniform convergence of the rates\nof occurrence of events to their probabilities, Teor. Veroyatn. Ee\nPrimen., 1971, vol. 16, no. 2, pp. 264\u2013280.","journal-title":"Teor. Veroyatn. Ee Primen."},{"key":"2132_CR3","volume-title":"Teoriya raspoznavaniya obrazov (Pattern Recognition Theory)","author":"V.N. Vapnik","year":"1974","unstructured":"Vapnik, V.N. and Chervonenkis, A.Ya., Teoriya raspoznavaniya\nobrazov (Pattern Recognition Theory), Moscow: Nauka, 1974."},{"key":"2132_CR4","volume-title":"Vosstanovlenie zavisimostei po empiricheskim dannym (Recovering Dependences from Empirical Data)","author":"V.N. Vapnik","year":"1979","unstructured":"Vapnik, V.N., Vosstanovlenie zavisimostei po empiricheskim\ndannym (Recovering Dependences from Empirical Data), Moscow:\nNauka, 1979."},{"issue":"2","key":"2132_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1134\/S1054661808020090","volume":"18","author":"K.V. Vorontsov","year":"2008","unstructured":"Vorontsov, K.V., Combinatorial probability and the tightness of\ngeneralization bounds, Pattern Recognit. Image Anal.,\n2008, vol. 18, no. 2, pp. 243\u2013259.","journal-title":"Pattern Recognit. Image Anal."},{"key":"2132_CR6","unstructured":"Langford, J., Quantitatively tight sample complexity bounds, \nPh.D. Thesis, \nPittsburgh: Carnegie Mellon Univ.,2002."},{"issue":"1","key":"2132_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y. and Schapire, R.E., A decision-theoretic generalization of on-line\nlearning and an application to boosting, J. Comput. Syst.\nSci., 1997, vol. 55, no. 1, pp. 119\u2013139.","journal-title":"J. Comput. Syst. Sci."},{"key":"2132_CR8","doi-asserted-by":"crossref","unstructured":"Kearns, M.J. et.al., An experimental and theoretical comparison of model\nselection methods, in Computational Learning Theory,\n1995, pp. 21\u201330.","DOI":"10.1145\/225298.225301"},{"key":"2132_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1051\/ps:2005018","volume":"9","author":"S. Boucheron","year":"2005","unstructured":"Boucheron, S., Bousquet, O., and Lugosi, G., Theory of classification: A\nsurvey of some recent advances, ESAIM: Probab. Stat.,\n2005, vol. 9, pp. 323\u2013375.","journal-title":"ESAIM: Probab. Stat."},{"key":"2132_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107298019","volume-title":"Understanding Machine Learning: from Theory to Algorithms","author":"S. Shalev-Shwartz","year":"2014","unstructured":"Shalev-Shwartz, S. and Ben-David, S., Understanding Machine Learning: from Theory to Algorithms,\nCambridge: Cambridge Univ. Press, 2014."},{"key":"2132_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22147-7","volume-title":"Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: \u00c9cole d\u2019\u00c9t\u00e9 de Probabilit\u00e9s de Saint-Flour XXXVIII-2008. Lecture Notes in Mathematics","author":"V. Koltchinskii","year":"2011","unstructured":"Koltchinskii, V., Oracle Inequalities in Empirical\nRisk Minimization and Sparse Recovery Problems: \u00c9cole d\u2019\u00c9t\u00e9 de\nProbabilit\u00e9s de Saint-Flour XXXVIII-2008. Lecture Notes in Mathematics,\nBerlin\u2013Heidelberg: Springer-Verlag, 2011."},{"key":"2132_CR12","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1134\/S1064562409060032","volume":"80","author":"K.V. Vorontsov","year":"2009","unstructured":"Vorontsov, K.V., Tight bounds for the probability of overfitting, Dokl. Math., 2009, vol. 80, p. 793.","journal-title":"Dokl. Math."},{"key":"2132_CR13","doi-asserted-by":"crossref","unstructured":"Vorontsov, K.V. and Ivahnenko, A.A., Tight combinatorial generalization\nbounds for threshold conjunction rules, in 4th Int. Conf. on Pattern\nRecognition and Machine Intelligence, 2011. Lecture Notes in Computer Science,\nBerlin\u2013Heidelberg: Springer-Verlag, 2011, pp. 66\u201373.","DOI":"10.1007\/978-3-642-21786-9_13"},{"issue":"3","key":"2132_CR14","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1134\/S1054661809030055","volume":"19","author":"K.V. Vorontsov","year":"2009","unstructured":"Vorontsov, K.V., Splitting and similarity phenomena in the sets of classifiers\nand their effect on the probability of overfitting, Pattern Recognit.\nImage Anal., 2009, vol. 19, no. 3, pp. 412\u2013420.","journal-title":"Pattern Recognit. Image Anal."},{"key":"2132_CR15","unstructured":"Zhivotovskii, N.K. and Vorontsov, K.V., Criteria of tightness of combinatorial\nestimates of generalization ability, in Intellektualizatsiya obrabotki\ninformatsii (IOI-2012) (Intellectualization of Information Processing (IIP-2012)),\nMoscow: Torus Press, 2012, pp. 25\u201328."},{"issue":"6","key":"2132_CR16","first-page":"734","volume":"1","author":"K.V. Vorontsov","year":"2013","unstructured":"Vorontsov, K.V., Frei, A.I., and Sokolov, E.A., Countable combinatorial\nestimates of the probability of overfitting, Mash. Obuchenie Anal.\nDannykh, 2013, vol. 1, no. 6, pp. 734\u2013743.","journal-title":"Mash. Obuchenie Anal. Dannykh"},{"issue":"6","key":"2132_CR17","first-page":"761","volume":"1","author":"A.I. Frei","year":"2013","unstructured":"Frei, A.I. and Tolstikhin, I.O., Combinatorial estimates of the probability of\noverfitting based on clusterization and covers of the set of algorithms, Mash. Obuchenie Anal. Dannykh, 2013, vol. 1, no. 6,\npp. 761\u2013778.","journal-title":"Mash. Obuchenie Anal. Dannykh"},{"issue":"2","key":"2132_CR18","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1006\/inco.1994.1097","volume":"115","author":"D. Haussler","year":"1994","unstructured":"Haussler, D., Littlestone, N., and Warmuth, M.K., Predicting\n$$0, 1\n$$-functions on randomly drawn points, Inf. Comput., 1994, vol. 115, no. 2,\npp. 248\u2013292.","journal-title":"Inf. Comput."},{"issue":"3","key":"2132_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1134\/S105466181003003X","volume":"20","author":"K.V. Vorontsov","year":"2010","unstructured":"Vorontsov, K.V., Exact combinatorial bounds on the probability of overfitting\nfor empirical risk minimization, Pattern Recognit. Image\nAnal., 2010, vol. 20, no. 3, pp. 269\u2013285.","journal-title":"Pattern Recognit. Image Anal."},{"issue":"4","key":"2132_CR20","first-page":"52","volume":"20","author":"P.V. Botov","year":"2010","unstructured":"Botov, P.V., Exact estimates of the probability of overfitting for\nmultidimensional modeling families of algorithms, Pattern Recognit.\nImage Anal., 2010, vol. 20, no. 4, pp. 52\u201365.","journal-title":"Pattern Recognit. Image Anal."},{"key":"2132_CR21","unstructured":"Tolstikhin, I.O., Probability of overfitting of some sparse families of\nalgorithms, Mezhdunar. konf. IOI-8  (Int. Conf. IIP-8)\n(2008), Moscow: MAKS Press, 2010, pp. 83\u201386."},{"issue":"3","key":"2132_CR22","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1134\/S1054661810030016","volume":"20","author":"A.I. Frei","year":"2010","unstructured":"Frei, A.I., Accurate estimates of the generalization ability for symmetric set of\npredictors and randomized learning algorithms, Pattern Recognit.\nImage Anal., 2010, vol. 20, no. 3, pp. 241\u2013250.","journal-title":"Pattern Recognit. Image Anal."},{"key":"2132_CR23","unstructured":"Botov, P.V., Exact bounds on probability of overfitting for monotone and\nunimodal families of algorithms, Matematicheskie metody\nraspoznavaniya obrazov-14  (Mathematical Methods of Pattern Recognition-14),\nMoscow: MAKS Press, 2009, pp. 7\u201310."},{"issue":"1","key":"2132_CR24","doi-asserted-by":"publisher","first-page":"49","DOI":"10.13108\/2018-10-1-49","volume":"10","author":"Sh.Kh. Ishkina","year":"2018","unstructured":"Ishkina, Sh.Kh., Combinatorial bounds of overfitting for threshold classifiers,\nUfa Math. J., 2018, vol. 10, no. 1,\npp. 49\u201363.","journal-title":"Ufa Math. J."},{"key":"2132_CR25","volume-title":"Raspoznavanie. Matematicheskie metody. Programnaya sistema. Prakticheskie primeneniya (Recognition. Mathematical Methods. Program System. Practical Applications)","author":"Yu.I. Zhuravlev","year":"2005","unstructured":"Zhuravlev, Yu.I., Ryazanov, V.V., and Sen\u2019ko, O.V., Raspoznavanie.\nMatematicheskie metody. Programnaya sistema. Prakticheskie primeneniya\n(Recognition. Mathematical Methods. Program System. Practical Applications), Moscow:\nFAZIS, 2005."},{"key":"2132_CR26","first-page":"5","volume":"33","author":"Yu.I. Zhuravlev","year":"1978","unstructured":"Zhuravlev, Yu.I., On an algebraic approach to solving recognition or\nclassification problems, Probl. Kibern., 1978, vol. 33,\npp. 5\u201368.","journal-title":"Probl. Kibern."},{"issue":"2","key":"2132_CR27","doi-asserted-by":"publisher","first-page":"173","DOI":"10.17537\/2011.6.173","volume":"6","author":"I.S. Guz","year":"2011","unstructured":"Guz, I.S., Constructive estimates of complete sliding control for threshold\nclassification, Mat. Biol. Bioinf., 2011, vol. 6, no. 2,\npp. 173\u2013189.","journal-title":"Mat. Biol. Bioinf."},{"key":"2132_CR28","unstructured":"GiHub Project https:\/\/github.com\/shaurushka\/theshold-clfs-gen-bound."},{"key":"2132_CR29","unstructured":"Vorontsov, K.V., Combinatorial theory of overfitting: how connectivity and\nsplitting reduces the local complexity, 9th IFIP WG 12.5 Int. Conf.,\nAIAI , Berlin\u2013Heidelberg: Springer, 2013."},{"key":"2132_CR30","doi-asserted-by":"crossref","unstructured":"Hoeffding, W., Probability inequalities for sums of bounded random variables,\nJ. Am. Stat. Assoc., 1963, no. 58,\npp. 13\u201330.","DOI":"10.1080\/01621459.1963.10500830"}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921050106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117921050106","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117921050106.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:30:42Z","timestamp":1773613842000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117921050106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5]]},"references-count":30,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["2132"],"URL":"https:\/\/doi.org\/10.1134\/s0005117921050106","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5]]},"assertion":[{"value":"29 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 December 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}