{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:22:55Z","timestamp":1752229375281,"version":"3.41.2"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,8,1]],"date-time":"1997-08-01T00:00:00Z","timestamp":870393600000},"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":["Machine Learning"],"published-print":{"date-parts":[[1997,8]]},"DOI":"10.1023\/a:1007311411259","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"211-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Malicious Omissions and Errors in Answers to Membership Queries"],"prefix":"10.1007","volume":"28","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u0101rti\u0146\u0161","family":"Kri\u0137is","sequence":"additional","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","reference":[{"key":"140962_CR1","unstructured":"Anderson, J. R. (1980). Cognitive Psychology and Its Implications. W. H. Freeman and Company."},{"issue":"2","key":"140962_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987). Learning regular sets from queries and counter examples. Inform. Comput., 75(2):87\u2013106.","journal-title":"Inform. Comput."},{"issue":"4","key":"140962_CR3","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4): 319\u2013342.","journal-title":"Machine Learning"},{"key":"140962_CR4","unstructured":"Angluin, D. (1994). Exact learning of \u03bc-DNF formulas with malicious membership queries. Technical Report YALEU\/DCS\/TR-1020, Yale University Department of Computer Science."},{"key":"140962_CR5","unstructured":"Angluin, D., & Kri\u0137is, M. (1994a). Malicious membership queries and exceptions. Technical Report YALEU\/-DCS\/TR-1019, Yale University Department of Computer Science."},{"key":"140962_CR6","first-page":"57","volume-title":"Proc. 7th Annu. ACM Workshop on Comput. Learning Theory","author":"D. Angluin","year":"1994","unstructured":"Angluin, D., & Kri\u0137is, M. (1994b). Learning with malicious membership queries and exceptions. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 57\u201366. ACM Press, New York, NY."},{"issue":"1","key":"140962_CR7","first-page":"7","volume":"14","author":"D. Angluin","year":"1994","unstructured":"Angluin, D., & Slonim, D. K. (1994). Randomly fallible teachers: learning monotone DNF with an incomplete membership oracle. Machine Learning, 14(1): 7\u201326.","journal-title":"Machine Learning"},{"key":"140962_CR8","first-page":"263","volume-title":"Proc. of the 26th Annual ACM Symposium on Theory of Computing","author":"P. Auer","year":"1994","unstructured":"Auer, P., & Long, P. M. (1994). Simulating access to hidden information while learning. In Proc. of the 26th Annual ACM Symposium on Theory of Computing, pages 263\u2013272. ACM Press, New York, NY."},{"key":"140962_CR9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1109\/72.80287","volume":"2","author":"E. Baum","year":"1991","unstructured":"Baum, E. (1991). Neural net algorithms that learn in polynomial time from examples and queries. IEEE Transactions on Neural Networks, 2: 5\u201319.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"140962_CR10","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(92)90367-O","volume":"100","author":"R. Board","year":"1992","unstructured":"Board, R., & Pitt, L. (1992). On the necessity of Occam algorithms. Theoret. Comput. Sci., 100: 157\u2013184.","journal-title":"Theoret. Comput. Sci."},{"key":"140962_CR11","first-page":"302","volume-title":"Proceedings of the 34th Annual Symposium on Foundations of Computer Science","author":"N. H. Bshouty","year":"1993","unstructured":"Bshouty, N. H., (1993). Exact learning via the monotone theory. In Proceedings of the 34th Annual Symposium on Foundations of Computer Science, pages 302\u2013311. IEEE Computer Society Press, Los Alamitos, CA."},{"key":"140962_CR12","unstructured":"Bultman, W. J. (1991). Topics in the Theory of Machine Learning and Neural Computing. PhD thesis, University of Illinois at Chicago Mathematics Department."},{"issue":"1","key":"140962_CR13","first-page":"81","volume":"18","author":"T. Dean","year":"1995","unstructured":"Dean, T., Angluin, D., Basye, K., Engelson, S., Kaelbling, L., Kokkevis, E., & Maron, O. (1995). Learning finite automata with stochastic output functions and an application to map learning. Machine Learning, 18(1): 81\u2013108.","journal-title":"Machine Learning"},{"key":"140962_CR14","first-page":"328","volume-title":"Proc. 7th Annu. ACM Workshop on Comput. Learning Theory","author":"M. Frazier","year":"1994","unstructured":"Frazier, M., Goldman, S., Mishra, N., & Pitt, L. (1994). Learning from a consistently ignorant teacher. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 328\u2013339. ACM Press, New York, NY."},{"issue":"4","key":"140962_CR15","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1137\/0222047","volume":"22","author":"S. A. Goldman","year":"1993","unstructured":"Goldman, S. A., Kearns, M. J., & Schapire, R. E. (1993). Exact identification of read-once formulas using fixed points of amplification functions. SIAM J. Comput., 22(4): 705\u2013726.","journal-title":"SIAM J. Comput."},{"key":"140962_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/130385.130394","volume-title":"Proc. 5th Annu. Workshop on Comput. Learning Theory","author":"S. A. Goldman","year":"1992","unstructured":"Goldman, S. A., & Mathias, H. D. (1992). Learning k-term DNF formulas with an incomplete membership oracle. In Proc. 5th Annu. Workshop on Comput. Learning Theory, pages 77\u201384. ACM Press, New York, NY."},{"key":"140962_CR17","first-page":"392","volume-title":"Proc. 25th Annu. ACM Sympos. Theory Comput.","author":"M. Kearns","year":"1993","unstructured":"Kearns, M. (1993). Efficient noise-tolerant learning from statistical queries. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 392\u2013401. ACM Press, New York, NY."},{"issue":"6","key":"140962_CR18","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1991","unstructured":"Kushilevitz, E., & Mansour, Y. (1993). Learning decision trees using the Fourier spectrum. SIAM J. Comput., 22(6): 1331\u20131348. Earlier version appeared in STOC 1991.","journal-title":"SIAM J. Comput."},{"key":"140962_CR19","unstructured":"Lang, K. J., & Baum, E. B. (1992). Query learning can work poorly when a human oracle is used. In International Joint Conference on Neural Networks, Beijing."},{"key":"140962_CR20","first-page":"107","volume":"9","author":"W. Maass","year":"1992","unstructured":"Maass, W., & Tur\u00e1n, G. (1992). Lower bound methods and separation results for on-line learning models. Machine Learning, 9: 107\u2013145.","journal-title":"Machine Learning"},{"issue":"2\/3","key":"140962_CR21","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1022899313248","volume":"18","author":"D. Ron","year":"1995","unstructured":"Ron, D., & Rubinfeld, R. (1995). Learning fallible deterministic finite automata. Machine Learning, 18(2\/3):149\u2013185.","journal-title":"Machine Learning"},{"issue":"5","key":"140962_CR22","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0020-0190(91)90220-C","volume":"37","author":"K. Sakakibara","year":"1991","unstructured":"Sakakibara, K. (1991). On learning from queries and counterexamples in the presence of noise. Inform. Proc. Lett., 37(5):279\u2013284.","journal-title":"Inform. Proc. Lett."},{"key":"140962_CR23","first-page":"237","volume-title":"Proc. 7th Annu. ACM Workshop on Comput. Learning Theory","author":"R. H. Sloan","year":"1994","unstructured":"Sloan, R. H., & Tur\u00e1n G. (1994). Learning with queries but incomplete information. In Proc. 7th Annu. ACM Workshop on Comput. Learning Theory, pages 237\u2013245. ACM Press, New York, NY."},{"key":"140962_CR24","first-page":"560","volume-title":"Proceedings of the 9th International Joint Conference on Artificial Intelligence","author":"L. G. Valiant","year":"1985","unstructured":"Valiant, L. G. (1985). Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, vol. 1, pages 560\u2013566, Los Angeles, California. International Joint Committee for Artificial Intelligence."},{"key":"140962_CR25","first-page":"771","volume":"32","author":"Y. Zhuravlev","year":"1985","unstructured":"Zhuravlev, Y., & Kogan, Y. (1985). Realization of boolean functions with a small number of zeros by disjunctive normal forms, and related problems. Soviet Math. Doklady, 32:771\u2013775.","journal-title":"Soviet Math. Doklady"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007311411259.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007311411259\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007311411259.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:29:58Z","timestamp":1752146998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007311411259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,8]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1997,8]]}},"alternative-id":["140962"],"URL":"https:\/\/doi.org\/10.1023\/a:1007311411259","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[1997,8]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}