{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:46:16Z","timestamp":1725551176297},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634942"},{"type":"electronic","value":"9783540695837"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","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":[[1997]]},"DOI":"10.1007\/3-540-63494-0_63","type":"book-chapter","created":{"date-parts":[[2010,4,5]],"date-time":"2010-04-05T19:22:49Z","timestamp":1270495369000},"page":"315-336","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning Logic programs with random classification noise"],"prefix":"10.1007","author":[{"given":"Tam\u00e1s","family":"Horv\u00e1th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert H.","family":"Sloan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gy\u00f6rgy","family":"Tur\u00e1n","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,8,18]]},"reference":[{"issue":"4","key":"19_CR1","first-page":"343","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin and P. Laird.Learning from noisy examples. Machine Learning, 2(4):343\u2013370, 1988.","journal-title":"Machine Learning"},{"key":"19_CR2","unstructured":"J. A. Aslam and S. E. Decatur. Improved noise-tolerant learning and generalized statistical queries. Technical Report TR-17-94, Center for Research in Computing Technology, Division of Applied Sciences, Harvard University, 1994."},{"key":"19_CR3","first-page":"501","volume":"2","author":"W. W. Cohen","year":"1995","unstructured":"W. W. Cohen. Pac-learning recursive logic programs: efficient algorithms. J. AI Research, 2:501\u2013539, 1995.","journal-title":"J. AI Research"},{"key":"19_CR4","first-page":"541","volume":"2","author":"W. W. Cohen","year":"1995","unstructured":"W. W. Cohen. Pac-learning recursive logic programs: negative results. J. AI Research, 2:541\u2013573, 1995.","journal-title":"J. AI Research"},{"key":"19_CR5","first-page":"262","volume-title":"Proc. 6th Annu. Workshop on Comput. Learning Theory","author":"S. E. Decatur","year":"1993","unstructured":"S. E. Decatur. Statistical queries and faulty PAC oracles. In Proc. 6th Annu. Workshop on Comput. Learning Theory, pages 262\u2013268. ACM Press, New York, NY, 1993."},{"key":"19_CR6","volume-title":"Proc. 5th Scandinavian Conf. on Artificial Intelligence","author":"S. D\u017aeroski","year":"1995","unstructured":"S. D\u017aeroski. Learning first-order clausal theories in the presence of noise. In Proc. 5th Scandinavian Conf. on Artificial Intelligence, Amsterdam, 1995. IOS Press."},{"key":"19_CR7","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/130385.130399","volume-title":"Proc. 5th Annu. Workshop on Comput. Learning Theory","author":"S. D\u017eeroski","year":"1992","unstructured":"S. D\u017eeroski, S. Muggleton, and S. Russell. PAC-learnability of determinate logic programs. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 128\u2013135. ACM Press, New York, NY, 1992."},{"key":"19_CR8","unstructured":"R. Gennaro. PAC-learning PROLOG clauses with or without errors. Tech. Memo 500, MIT Laboratory for Computer Science, 1994."},{"key":"19_CR9","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/BF01300374","volume":"14","author":"S. A. Goldman","year":"1995","unstructured":"S. A. Goldman and R. H. Sloan.Can PAC learning algorithms tolerate random attribute noise? Algorithmica, 14:70\u201384, 19953.","journal-title":"Algorithmica"},{"issue":"301","key":"19_CR10","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding. Probability inequalities for sums of bounded random variables. tJournal of the American Statistical Association, 58(301):13\u201330, Mar. 1963.","journal-title":"tJournal of the American Statistical Association"},{"key":"19_CR11","unstructured":"T. Horvith and G. Turin. Learning logic programs with structured background knowledge. In L. De Raedt, editor, 5th Int. Workshop on Inductive Logic Programming, pages 53\u201376, 1995. Also in Advances in Inductive Logic Programming (ed. L. De Raedt). IOS Press, 1996, pages 172-191. (IOS Frontiers in AI and Appl.)."},{"key":"19_CR12","series-title":"Proc. 25th Annu. ACM Sympos. Theory Comput.","first-page":"392","volume-title":"Efficient noise-tolerant learning from statistical queries","author":"M. Kearns","year":"1993","unstructured":"M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 392\u2013401. ACM Press, New York, NY, 1993."},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M. Kearns","year":"1993","unstructured":"M. Kearns and M. Li. Learning in the presence of malicious errors. SIAM J. Comput., 22:807\u2013837, 1993.","journal-title":"SIAM J. Comput."},{"key":"19_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An Introduction to Computational Learning Theory","author":"M. J. Kearns","year":"1994","unstructured":"M. J. Kearns and U. V. Vazirani.An Introduction to Computational Learning Theory. The MIT Press, Cambridge, Massachusetts, 1994."},{"key":"19_CR15","first-page":"495","volume-title":"Inductive Logic Programmingming","author":"N. Lavra\u0107","year":"1992","unstructured":"N. Lavra\u0107 and S. D\u017aeroski. Inductive learning of relations from noisy examples. In S. H. Muggleton, editor, Inductive Logic Programming, pages 495\u2013514, London, 1992. Academic Press."},{"key":"19_CR16","volume-title":"Inductive Logic Programmingming: Techniques and Applications","author":"N. Lavra\u010d","year":"1994","unstructured":"N. Lavra\u010d and S. D\u017eeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, New York, 1994."},{"key":"19_CR17","doi-asserted-by":"crossref","unstructured":"N. Lavra\u010d, S. Dieroski, and I. Bratko. Handling imperfect data in inductive logic programming. In L. De Raedt, editor, Advances in Inductive Logic Programming, pages 48\u201364. IOS Press, 1996.","DOI":"10.1007\/978-3-662-04599-2_3"},{"key":"19_CR18","unstructured":"Y. Mansour and M. Parnas. On learning conjunctions with malicious noise. In Israel System and Theory Computer Symposium (ISTCS 96), 1996. (To appear)."},{"key":"19_CR19","unstructured":"S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming, pages 281\u2013298. Academic Press, 1992."},{"key":"19_CR20","first-page":"97","volume-title":"Proc. 1st Annu. Workshop on Comput. Learning Theory","author":"G. Shackelford","year":"1988","unstructured":"G. Shackelford and D. Volper. Learning k-DNF with noise in the attributes. In Proc. 1st Annu. Workshop on Comput. Learning Theory, pages 97\u2013103, San Mateo, CA, 1988. Morgan Kaufmann."},{"key":"19_CR21","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0020-0190(95)00016-6","volume":"54","author":"R. H. Sloan","year":"1995","unstructured":"R. H. Sloan. Four types of noise in data for PAC learning. Inf. Process. Lett., 54:157\u2013162, 1995.","journal-title":"Inf. Process. Lett."},{"key":"19_CR22","unstructured":"A. Srinivasan, S. H. Muggleton, and M. Bain. Distinguishing exceptions from noise in non-monotonic learning. In Proc. Second International Workshop on Inductive Logic Programming, Tokyo, Japan, 1992. ICOT TM-1182."},{"key":"19_CR23","series-title":"Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1","first-page":"560","volume-title":"Learning disjunctions of conjunctions","author":"L. G. Valiant","year":"1985","unstructured":"L. G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pages 560\u2013566, Los Angeles, California, 1985. International Joint Committee for Artificial Intelligence."}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63494-0_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,3]],"date-time":"2020-06-03T14:04:48Z","timestamp":1591193088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63494-0_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634942","9783540695837"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63494-0_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"18 August 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}