{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T07:50:10Z","timestamp":1672559410586},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1007\/bf00993160","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T12:18:07Z","timestamp":1105273087000},"page":"7-26","source":"Crossref","is-referenced-by-count":13,"title":["Randomly fallible teachers: Learning monotone DNF with an incomplete membership oracle"],"prefix":"10.1007","volume":"14","author":[{"given":"Dana","family":"Angluin","sequence":"first","affiliation":[]},{"given":"Donna K.","family":"Slonim","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","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 counterexamples.Information and Computation, 75, 87?106.","journal-title":"Information and Computation"},{"key":"CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D. (1988). Queries and concept learning.Machine Learning, 2, 319?342.","journal-title":"Machine Learning"},{"key":"CR3","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"Angluin, D. (1990). Negative results for equivalence queries.Machine Learning, 5, 121?150.","journal-title":"Machine Learning"},{"key":"CR4","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"Angluin, D., Frazier, M., & Pitt, L. (1992). Learning conjunctions of Horn clauses.Machine Learning, 9, 147?164.","journal-title":"Machine Learning"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., & Karpinski, M. (1993). Learning read-once formulas with queries.JACM, 40, 185?210.","journal-title":"JACM"},{"key":"CR6","first-page":"444","volume-title":"Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing","author":"D. Angluin","year":"1991","unstructured":"Angluin, D., & Kharitonov, M. (1991). When won't membership queries help? InProceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, (pp. 444?454). New Orleans, LA: ACM Press."},{"key":"CR7","first-page":"343","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D., & Laird, P. (1988). Learning from noisy examples.Machine Learning, 2, 343?370.","journal-title":"Machine Learning"},{"key":"CR8","first-page":"139","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"D. Angluin","year":"1991","unstructured":"Angluin, D., & Slonim, D. (1991). Learning monotone DNF with an incomplete membership oracle. InProceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 139?146). Santa Cruz, CA: Morgan Kaufmann."},{"key":"CR9","first-page":"193","volume-title":"Proceedings of the Thirty-First Annual Symposium on Foundations of Computer Science","author":"S. Goldman","year":"1990","unstructured":"Goldman, S., Kearns, M., & Schapire, R. (1990). Exact identification of circuits using fixed points of amplification functions. InProceedings of the Thirty-First Annual Symposium on Foundations of Computer Science, (pp. 193?202). St. Louis, MO: IEEE Computer Society Press."},{"key":"CR10","first-page":"23","volume-title":"Proceedings of the Third Annual Workshop on Computational Learning Theory","author":"T. Hancock","year":"1990","unstructured":"Hancock, T. (1990). Identifying ?-formula decision trees with queries. InProceedings of the Third Annual Workshop on Computational Learning Theory, (pp. 23?37). Rochester, NY: Morgan Kaufmann."},{"key":"CR11","first-page":"151","volume":"5","author":"H. Ishizaka","year":"1990","unstructured":"Ishizaka, H. (1990). Polynomial time learnability of simple deterministic languages.Machine Learning, 5, 151?164.","journal-title":"Machine Learning"},{"key":"CR12","first-page":"190","volume-title":"Proceedings of the Twenty Third Annual ACM Symposium on Theory of Computing","author":"R.M. Karp","year":"1991","unstructured":"Karp, R.M. (1991). Probabilistic recurrence relations. InProceedings of the Twenty Third Annual ACM Symposium on Theory of Computing, (pp. 190?197). New Orleans, LA: ACM Press."},{"key":"CR13","volume-title":"The Computational Complexity of Machine Learning","author":"M. Kearns","year":"1990","unstructured":"Kearns, M. (1990).The Computational Complexity of Machine Learning. Cambridge, MA: MIT Press. (Also, Doctoral dissertation, Harvard University, 1989.)"},{"key":"CR14","first-page":"267","volume-title":"Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1988","unstructured":"Kearns, M., & Li, M. (1988). Learning in the presence of malicious errors. InProceedings of the Twentieth Annual ACM Symposium on Theory of Computing, (pp. 267?280). Chicago, IL: ACM Press."},{"key":"CR15","first-page":"285","volume-title":"Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1987","unstructured":"Kearns, M., Li, M., Pitt, L., & Valiant, L.G. (1987). On the learnability of Boolean formulae. InProceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, (pp. 285?295). New York, NY: ACM Press."},{"key":"CR16","first-page":"433","volume-title":"Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing","author":"M. Kearns","year":"1989","unstructured":"Kearns, M., & Valiant, L. (1989). Cryptographic limitations on learning boolean formulae and finite automata. InProceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, (pp. 433?444). Seattle, WA: ACM Press."},{"key":"CR17","volume-title":"Learning from Good Data and Bad","author":"P. Laird","year":"1987","unstructured":"Laird, P. (1987).Learning from Good Data and Bad. Doctoral dissertation, Department of Computer Science, Yale University, New Haven, CT. (Published asLearning from Good and Bad Data, Kluwer Academic Publishers, 1988.)"},{"key":"CR18","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm.Machine Learning, 2, 285?318.","journal-title":"Machine Learning"},{"key":"CR19","first-page":"167","volume-title":"Proceedings of the Fourth Annual Workshop on Computational Learning Theory","author":"W. Maass","year":"1991","unstructured":"Maass, W. (1991). On-line learning with an oblivious environment and the power of randomization. InProceedings of the Fourth Annual Workshop on Computational Learning Theory, (pp. 167?175). Santa Cruz, CA: Morgan Kaufmann."},{"key":"CR20","first-page":"38","volume-title":"Proceedings of Third Annual Workshop on Computational Learning Theory","author":"V. Raghavan","year":"1990","unstructured":"Raghavan, V., & Schach, S. (1990). Learning switch configurations. InProceedings of Third Annual Workshop on Computational Learning Theory, (pp. 38?51). Rochester, NY: Morgan Kaufmann."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0020-0190(91)90220-C","volume":"37","author":"Y. Sakakibara","year":"1991","unstructured":"Sakakibara, Y. (1991). On learning from queries and counterexamples in the presence of noise.Information Processing Letters, 37, 279?284.","journal-title":"Information Processing Letters"},{"key":"CR22","first-page":"97","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"G. Shackelford","year":"1988","unstructured":"Shackelford, G. & Volper, D. (1988). Learning k-DNF with noise in the attributes. InProceedings of the 1988 Workshop on Computational Learning Theory, (pp. 97?103). Cambridge, MA: Morgan Kaufmann."},{"key":"CR23","first-page":"91","volume-title":"Proceedings of the 1988 Workshop on Computational Learning Theory","author":"R. Sloan","year":"1988","unstructured":"Sloan, R. (1988). Types of noise in data for concept learning. InProceedings of the 1988 Workshop on Computational Learning Theory, (pp. 91?96). Cambridge, MA: Morgan Kaufmann."},{"key":"CR24","unstructured":"Sloan, R. (1989).Computational Learning Theory: New Models and Algorithms. Doctoral dissertation, MIT Laboratory for Computer Science."},{"key":"CR25","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. Valiant","year":"1984","unstructured":"Valiant, L. (1984). A theory of the learnable.CACM, 27, 1134?1142.","journal-title":"CACM"},{"key":"CR26","first-page":"560","volume-title":"Proceedings of the 9th IJCAI","author":"L. Valiant","year":"1985","unstructured":"Valiant, L. (1985). Learning disjunctions of conjunctions. InProceedings of the 9th IJCAI, (pp. 560?566). Los Angeles, CA: Morgan Kaufmann."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993160\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T18:58:41Z","timestamp":1556564321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993160"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF00993160"],"URL":"http:\/\/dx.doi.org\/10.1007\/bf00993160","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":["Artificial Intelligence","Software"],"published":{"date-parts":[[1994,1]]}}}