{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T10:10:02Z","timestamp":1746180602051,"version":"3.40.4"},"reference-count":49,"publisher":"EDP Sciences","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1051\/ita\/2014005","type":"journal-article","created":{"date-parts":[[2014,4,9]],"date-time":"2014-04-09T12:55:56Z","timestamp":1397048156000},"page":"209-245","source":"Crossref","is-referenced-by-count":2,"title":["A Generalized Model of PAC Learning and its Applicability"],"prefix":"10.1051","volume":"48","author":[{"given":"Thomas","family":"Brodag","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Herbold","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Waack","sequence":"additional","affiliation":[]}],"member":"250","published-online":{"date-parts":[[2014,4,9]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"D.W. Aha and D. Kibler, Instance-based learning algorithms.Machine Learn.(1991) 37\u201366.","DOI":"10.1007\/BF00153759"},{"key":"R2","unstructured":"Angluin D. and Laird P., Learning from noisy examples.Machine Learn.2(1988) 343\u2013370."},{"key":"R3","unstructured":"http:\/\/httpd.apache.org\/ (2011)."},{"key":"R4","unstructured":"J.A. Aslam,Noise Tolerant Algorithms for Learning and Searching, Ph.D. thesis. MIT (1995)."},{"key":"R5","doi-asserted-by":"crossref","unstructured":"Aslam J.A. and Decatur S.E., Specification and Simulation of Statistical Query Algorithms for Efficiency and Noise Tolerance.J. Comput. Syst. Sci.56(1998) 191\u2013208.","DOI":"10.1006\/jcss.1997.1558"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"Bartlett P.L., Boucheron S. and Lugosi G., Model selection and error estimation.Machine Learn.48(2002) 85\u2013113.","DOI":"10.1023\/A:1013999503812"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Bartlett P.L., Jordan M.I. and McAuliffe J.D., Convexity, classification, and risk bounds.J. Amer. Stat. Assoc.1001(2006) 138\u2013156.","DOI":"10.1198\/016214505000000907"},{"key":"R8","unstructured":"P.L. Bartlett and S. Mendelson, Rademacher and Gaussian complexities: Risk bounds and structural results, in14th COLT and 5th EuroCOLT(2001) 224\u2013240."},{"key":"R9","unstructured":"P.L. Bartlett and S. Mendelson, Rademacher and Gaussian complexities: Risk bounds and structural results.J. Mach. Learn. Res.(2002) 463\u2013482."},{"key":"R10","doi-asserted-by":"crossref","unstructured":"Blumer A., Ehrenfeucht A., Haussler D. and Warmuth M.K., Learnabilty and the Vapnik\u2212Chervonenkis dimension.J. ACM36(1989) 929\u2013969.","DOI":"10.1145\/76359.76371"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"O. Bousquet, S. Boucheron and G. Lugosi, Introduction to statistical learning theory, inAdv. Lect. Machine Learn.(2003) 169\u2013207.","DOI":"10.1007\/978-3-540-28650-9_8"},{"key":"R12","unstructured":"O. Bousquet, S. Boucheron and G. Lugosi, Introduction to statistical learning theory, inAdv. Lect. Machine Learn., vol. 3176 ofLect. Notes in Artificial Intelligence. Springer, Heidelberg (2004) 169\u2013207."},{"key":"R13","unstructured":"Th. Brodag,PAC-Lernen zur Insolvenzerkennung und Hotspot-Identifikation, Ph.D. thesis, Ph.D. Programme in Computer Science of the Georg-August University School of Science GAUSS (2008)."},{"key":"R14","doi-asserted-by":"crossref","unstructured":"Cesa-Bianchi N., Shalev-Shwartz S. and Shamir O., Online learning of noisy data.IEEE Trans. Inform. Theory57(2011) 7907\u20137931.","DOI":"10.1109\/TIT.2011.2164053"},{"key":"R15","unstructured":"S.E. Decatur, Learning in hybrid noise environments using statistical queries, inFifth International Workshop on Artificial Intelligence and Statistics.Lect. Notes Statis.Springer (1993)."},{"key":"R16","doi-asserted-by":"crossref","unstructured":"S.E. Decatur, Statistical Queries and Faulty PAC Oracles.COLT(1993) 262\u2013268.","DOI":"10.1145\/168304.168346"},{"key":"R17","unstructured":"S.E. Decatur,Efficient Learning from Faulty Data, Ph.D. thesis. Harvard University (1995)."},{"key":"R18","unstructured":"S.E. Decatur, PAC learning with constant-partition classification noise and applications to decision tree induction, inICML \u201997: Proc. of the Fourteenth Int. Conf. on Machine Learn.Morgan Kaufmann Publishers Inc. San Francisco, CA, USA (1997) 83\u201391."},{"key":"R19","doi-asserted-by":"crossref","unstructured":"S.E. Decatur and R. Gennaro, On learning from noisy and incomplete examples, inCOLT(1995) 353\u2013360.","DOI":"10.1145\/225298.225341"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"L. Devroye, L. Gy\u00f6rfi and G. Lugosi,A Probabilistic Theory of Pattern Recognition. Springer, New York (1997).","DOI":"10.1007\/978-1-4612-0711-5"},{"key":"R21","unstructured":"http:\/\/www.eclipse.org\/jdt\/ (2011)."},{"key":"R22","unstructured":"http:\/\/www.eclipe.org\/platform\/ (2011)."},{"key":"R23","unstructured":"N. Fenton and S.L. Pfleeger,Software metrics: a rigorous and practical approach. PWS Publishing Co. Boston, MA, USA (1997)."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"Haussler D. and Haussler D., Can pac learning algorithms tolerate random attribute noise?Algorithmica14(1995) 70\u201384.","DOI":"10.1007\/BF01300374"},{"key":"R25","doi-asserted-by":"crossref","unstructured":"Halperin I., Wolfson H. and Nussinov R., Protein-protein interactions coupling of structurally conserved residues and of hot spots across interfaces. implications for docking.Structure12(2004) 1027\u20131036.","DOI":"10.1016\/j.str.2004.04.009"},{"key":"R26","unstructured":"Haussler D., Quantifying inductive bias: AI learning algorithms and Valiant\u2019s learning framework.Artificial Intelligence36(1988) 177\u2013221."},{"key":"R27","doi-asserted-by":"crossref","unstructured":"Haussler D., Kearns M.J., Littlestone N. and Warmuth M.K., Equivalence of models for polynomial learnability.Inform. Comput.95(1991) 129\u2013161.","DOI":"10.1016\/0890-5401(91)90042-Z"},{"key":"R28","doi-asserted-by":"crossref","unstructured":"Haussler D., Haussler D. and Haussler D., Calculation and optimization of thresholds for sets of software metrics.Empirical Software Engrg.(2011) 1\u201330. 10.1007\/s10664-011-9162-z.","DOI":"10.1007\/s10664-011-9162-z"},{"key":"R29","unstructured":"International Organization of Standardization (ISO) and International Electro-technical Commission (ISEC), Geneva, Switzerland.Software engineering \u2013 Product quality, Parts 1-4(2001-2004)."},{"key":"R30","unstructured":"G. John and P. Langley, Estimating continuous distributions in bayesian classifiers,In Proc. of the Eleventh Conf. on Uncertainty in Artificial Intelligence. Morgan Kaufmann (1995) 338\u2013345."},{"key":"R31","doi-asserted-by":"crossref","unstructured":"Kearns M.J., Efficient noise-tolerant learning from statistical queries.J. ACM45(1998) 983\u20131006.","DOI":"10.1145\/293347.293351"},{"key":"R32","unstructured":"Kearns M.J. and Li M., Learning in the presence of malicious errors.SIAM J. Comput.22(1993) 807\u2013837."},{"key":"R33","unstructured":"Kearns M.J. and Schapire R.E., Efficient Distribution-Free Learning of Probabilistic Concepts.J. Comput. Syst. Sci.48(1994) 464\u2013497."},{"key":"R34","doi-asserted-by":"crossref","unstructured":"Koltchinskii V., Rademacher penalties and structural risk minimization.IEEE Trans. Inform. Theory47(2001) 1902\u20131914.","DOI":"10.1109\/18.930926"},{"key":"R35","unstructured":"Mammen E. and Tsybakov A.B., Smooth discrimination analysis.Ann. Statis.27(1999) 1808\u20131829."},{"key":"R36","doi-asserted-by":"crossref","unstructured":"P. Massart, Some applications of concentration inequalities to statistics.Annales de la Facult\u00e9 des Sciences de Toulouse, volume sp\u00e9cial d\u00e9dia\u00e9` Michel Talagrand (2000) 245\u2013303.","DOI":"10.5802\/afst.961"},{"key":"R37","doi-asserted-by":"crossref","unstructured":"Mendelson S., Rademacher averages and phase transitions in Glivenko-Cantelli classes.IEEE Trans. Inform. Theory48(2002) 1977\u20131991.","DOI":"10.1109\/TIT.2002.1013137"},{"key":"R38","doi-asserted-by":"crossref","unstructured":"Moreira I.S., Fernandes P.A. and Ramos M.J., Hot spots \u2013 A review of the protein-protein interface determinant amino-acid residues.Proteins: Structure, Function, and Bioinformatics,68(2007) 803\u2013812.","DOI":"10.1002\/prot.21396"},{"key":"R39","unstructured":"Nettleton D.F., Orriols-Puig A. and Fornells A., A study of the effect of different types of noise on the precision of supervised learning techniques.Artif. Intell. Rev.33(2010) 275\u2013306."},{"key":"R40","unstructured":"Ofran Y. and Rost B., ISIS: interaction sites identified from sequence.Bioinform.23(2007) 13\u201316."},{"key":"R41","doi-asserted-by":"crossref","unstructured":"Ofran Y. and Rost B., Protein-protein interaction hotspots carved into sequences.PLoS Comput. Biol.3(2007).","DOI":"10.1371\/journal.pcbi.0030119"},{"key":"R42","doi-asserted-by":"crossref","unstructured":"J.C. Platt, Fast training of support vector machines using sequential minimal optimization, inAdvances in kernel methods. Edited by B. Sch\u00f6lkopf, Ch.J.C. Burges and A.J. Smola. MIT Press, Cambridge, MA, USA (1999) 185\u2013208.","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"R43","unstructured":"J. Ross Quinlan,C4.5: programs for machine learning. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1993)."},{"key":"R44","unstructured":"L. Ralaivola, F. Denis and Ch.N. Magnan, CN = CPCN, inICML \u201906: Proc. of the 23rd int. Conf. Machine learn.ACM New York, NY, USA (2006) 721\u2013728."},{"key":"R45","doi-asserted-by":"crossref","unstructured":"B. Sch\u00f6lkopf and A.J. Smola,Learning with Kernels. MIT Press (2002).","DOI":"10.7551\/mitpress\/4175.001.0001"},{"key":"R46","unstructured":"Thorn K.S. and Bogan A.A., Asedb: a database of alanine mutations and their effects on the free energy of binding in protein interactions.Bioinformatics17(2001) 284\u2013285."},{"key":"R47","unstructured":"Tsybakov A.B., Optimal aggregation of classifiers in statistical learning.Ann. Statis.32(2004) 135\u2013166."},{"key":"R48","doi-asserted-by":"crossref","unstructured":"Valiant L., A theory of learnability.Communic. ACM27(1984) 1134\u20131142.","DOI":"10.1145\/1968.1972"},{"key":"R49","unstructured":"L. Valiant, Learning disjunctions of conjunctions, inProc. of 9th Int. Joint Conf. Artificial Int.(1985) 560\u2013566."}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014005\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T09:30:49Z","timestamp":1746178249000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/2014005"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":49,"journal-issue":{"issue":"2"},"alternative-id":["ita120003"],"URL":"https:\/\/doi.org\/10.1051\/ita\/2014005","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"type":"print","value":"0988-3754"},{"type":"electronic","value":"1290-385X"}],"subject":[],"published":{"date-parts":[[2014,4]]}}}