{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:58:24Z","timestamp":1742954304122,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592701"},{"type":"electronic","value":"9783319592718"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59271-8_12","type":"book-chapter","created":{"date-parts":[[2017,5,18]],"date-time":"2017-05-18T15:59:07Z","timestamp":1495123147000},"page":"184-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Overfitting of Classifiers Making a Lattice"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6724-3803","authenticated-orcid":false,"given":"Tatiana","family":"Makhalova","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3284-9001","authenticated-orcid":false,"given":"Sergei O.","family":"Kuznetsov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,19]]},"reference":[{"key":"12_CR1","unstructured":"Bax, E.: Similar classifiers and VC error bounds. CalTech-CS-TR-97-14 (1997)"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1134\/S1054661811010032","volume":"21","author":"PV Botov","year":"2011","unstructured":"Botov, P.V.: Exact estimates of the probability of overfitting for multidimensional modeling families of algorithms. Pattern Recogn. Image Anal. 21(1), 52\u201365 (2011)","journal-title":"Pattern Recogn. Image Anal."},{"key":"12_CR3","unstructured":"Bousquet, O., Elisseeff, A.: Algorithmic stability and generalization performance. In: Proceedings of the 2000 Conference on Advances in Neural Information Processing Systems, vol. 13, pp. 196\u2013202. MIT Press (2001)"},{"key":"12_CR4","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., Elisseeff, A.: Stability and generalization. J. Mach. Learn. Res. 2, 499\u2013526 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chernoff, H.: A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. In: The Annals of Mathematical Statistics, pp. 493\u2013507 (1952)","DOI":"10.1214\/aoms\/1177729330"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-540-27769-9_6","volume-title":"Conceptual Structures at Work","author":"B Ganter","year":"2004","unstructured":"Ganter, B., Grigoriev, P.A., Kuznetsov, S.O., Samokhin, M.V.: Concept-based data mining with scaled labeled graphs. In: Wolff, K.E., Pfeiffer, H.D., Delugach, H.S. (eds.) ICCS-ConceptStruct 2004. LNCS, vol. 3127, pp. 94\u2013108. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-27769-9_6"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-540-45091-7_6","volume-title":"Conceptual Structures for Knowledge Creation and Communication","author":"B Ganter","year":"2003","unstructured":"Ganter, B., Kuznetsov, S.O.: Hypotheses and version spaces. In: Ganter, B., Moor, A., Lex, W. (eds.) ICCS-ConceptStruct 2003. LNCS, vol. 2746, pp. 83\u201395. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45091-7_6"},{"key":"12_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)"},{"key":"12_CR9","unstructured":"Kashnitsky, Y., Ignatov, D.I.: Can FCA-based recommender system suggest a proper classifier? In: Proceedings of the International Workshop \u201cWhat can FCA do for Artificial Intelligence?\u201d (FCA4AI at ECAI 2014), CEUR Workshop Proceedings, pp. 17\u201326 (2014)"},{"key":"12_CR10","unstructured":"Kearns, M.J., Schapire, R.E.: Efficient distribution-free learning of probabilistic concepts. In: Proceedings of 31st Annual Symposium on Foundations of Computer Science, pp. 382\u2013391. IEEE (1990)"},{"issue":"5","key":"12_CR11","doi-asserted-by":"publisher","first-page":"1902","DOI":"10.1109\/18.930926","volume":"47","author":"V Koltchinskii","year":"2001","unstructured":"Koltchinskii, V.: Rademacher penalties and structural risk minimization. IEEE Trans. Inf. Theor. 47(5), 1902\u20131914 (2001)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-1-4612-1358-1_29","volume-title":"High Dimensional Probability II","author":"V Koltchinskii","year":"2000","unstructured":"Koltchinskii, V., Panchenko, D.: Rademacher processes and bounding the risk of function learning. In: Gin\u00e9, E., Mason, D.M., Wellner, J.A. (eds.) High Dimensional Probability II, vol. 47, pp. 443\u2013457. Springer, Heidelberg (2000)"},{"issue":"1","key":"12_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1015362183","volume":"30","author":"V Koltchinskii","year":"2002","unstructured":"Koltchinskii, V., Panchenko, D.: Empirical margin distributions and bounding the generalization error of combined classifiers. Ann. Stat. 30(1), 1\u201350 (2002)","journal-title":"Ann. Stat."},{"issue":"3","key":"12_CR14","first-page":"200","volume":"3","author":"SO Kuznetsov","year":"2013","unstructured":"Kuznetsov, S.O., Poelmans, J.: Knowledge representation and processing with formal concept analysis. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 3(3), 200\u2013215 (2013)","journal-title":"Wiley Interdisc. Rev.: Data Min. Knowl. Discov."},{"key":"12_CR15","unstructured":"Langford, J.: Quantitatively tight sample complexity bounds. Ph.D. thesis\/Carnegie Mellon thesis (2002)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"McAllester, D.A.: Pac-Bayesian model averaging. In: Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pp. 164\u2013170. ACM (1999)","DOI":"10.1145\/307400.307435"},{"issue":"1","key":"12_CR17","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C.: On the method of bounded differences. Surv. Comb. 141(1), 148\u2013188 (1989)","journal-title":"Surv. Comb."},{"key":"12_CR18","unstructured":"Philips, P., et al.: Data-dependent analysis of learning algorithms (2005)"},{"key":"12_CR19","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1162\/153244303765208377","volume":"3","author":"M Seeger","year":"2002","unstructured":"Seeger, M.: Pac-Bayesian generalisation error bounds for Gaussian process classification. J. Mach. Learn. Res. 3, 233\u2013269 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"12_CR20","unstructured":"Sill, J.: Monotonicity and connectedness in learning systems. Ph.D. thesis, California Institute of Technology (1998)"},{"issue":"1","key":"12_CR21","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1214\/aop\/1176988847","volume":"22","author":"M Talagrand","year":"1994","unstructured":"Talagrand, M.: Sharper bounds for Gaussian and empirical processes. Ann. Probab. 22(1), 28\u201376 (1994)","journal-title":"Ann. Probab."},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/BF02699376","volume":"81","author":"M Talagrand","year":"1995","unstructured":"Talagrand, M.: Concentration of measure and isoperimetric inequalities in product spaces. Publications Math\u00e9matiques de l\u2019Institut des Hautes Etudes Scientifiques 81(1), 73\u2013205 (1995)","journal-title":"Publications Math\u00e9matiques de l\u2019Institut des Hautes Etudes Scientifiques"},{"key":"12_CR23","unstructured":"Tolstikhin, I.O.: The probability of overfitting for the compact and sparse sets of predictors. In: Intelligent Data Processing: Theory and Applications: IDP-8, pp. 83\u201386 (2010)"},{"issue":"2","key":"12_CR24","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"VN Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16(2), 264\u2013280 (1971)","journal-title":"Theory Probab. Appl."},{"issue":"2","key":"12_CR25","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1134\/S1054661808020090","volume":"18","author":"KV Vorontsov","year":"2008","unstructured":"Vorontsov, K.V.: Combinatorial probability and the tightness of generalization bounds. Pattern Recogn. Image Anal. 18(2), 243\u2013259 (2008)","journal-title":"Pattern Recogn. Image Anal."},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1134\/S105466181003003X","volume":"20","author":"KV Vorontsov","year":"2010","unstructured":"Vorontsov, K.V.: Exact combinatorial bounds on the probability of overfitting for empirical risk minimization. Pattern Recogn. Image Anal. 20(3), 269\u2013285 (2010)","journal-title":"Pattern Recogn. Image Anal."},{"key":"12_CR27","first-page":"6","volume":"1","author":"KV Vorontsov","year":"2013","unstructured":"Vorontsov, K.V., Frey, A.I., Sokolov, E.A.: Computable combinatorial overfitting bounds. Mach. Learn. 1, 6 (2013)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Formal Concept Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59271-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:24:57Z","timestamp":1710343497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59271-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592701","9783319592718"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59271-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICFCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Concept Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icfca2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icfca2017.irisa.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}