{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:47:21Z","timestamp":1725482841379},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657019"},{"type":"electronic","value":"9783540490975"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49097-3_8","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T06:32:28Z","timestamp":1175754748000},"page":"91-100","source":"Crossref","is-referenced-by-count":1,"title":["Exact Learning when Irrelevant Variables Abound"],"prefix":"10.1007","author":[{"given":"David","family":"Guijarro","sequence":"first","affiliation":[]},{"given":"V\u00edctor","family":"Lav\u00edn","sequence":"additional","affiliation":[]},{"given":"Vijay","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,11,19]]},"reference":[{"key":"8_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and Concept Learning. Machine Learning, 2, (1988), 319\u2013342.","journal-title":"Machine Learning"},{"key":"8_CR2","first-page":"121","volume":"5","author":"D. Angluin","year":"1990","unstructured":"D. Angluin. Negative Results for Equivalence Queries. Machine Learning, 5, (1990), 121\u2013150.","journal-title":"Machine Learning"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1006\/inco.1995.1157","volume":"123","author":"J.C. Bioch","year":"1995","unstructured":"J.C. Bioch and T. Ibaraki. Complexity of Identification and Dualization of Positive Boolean Functions. Information and Computation, 123:50\u201363, 1995.","journal-title":"Information and Computation"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1006\/jcss.1995.1004","volume":"50","author":"A. Blum","year":"1995","unstructured":"A. Blum, L. Hellerstein, N. Littlestone. Learning in the Presence of Finitely or Infinitely Many Attributes. Journal of Computer and System Science, pages 50:32\u201340, 1995.","journal-title":"Journal of Computer and System Science"},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N. Bshouty","year":"1995","unstructured":"N. Bshouty. Exact Learning Boolean Functions via the Monotone Theory. Information and Computation, 123(1):146\u2013153, Nov 1995.","journal-title":"Information and Computation"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"N. Bshouty, R. Cleve, S. Kannan, and C. Tamon. Oracles and Queries that are Sufficient for Exact Learning. Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, pages 130\u2013139, 1994.","DOI":"10.1145\/180139.181067"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"N.H. Bshouty, L. Hellerstein. Attribute-efficient Learning in Query and Mistake Bound Models. Proceedings of the Ninth Conference on Computational Learning Theory, pages 235\u2013243, 1996.","DOI":"10.1145\/238061.238108"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"P. Damaschke. Adaptive versus Non-Adaptive Attribute-Efficient Learning. Proceedings of the 35th ACM Symposium on Theory of Computing, pages 590\u2013596, 1998.","DOI":"10.1145\/276698.276874"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"P. Damaschke. Computational Aspects of Parallel Attribute-Efficient Learning. To appear in: Proceedings of the 9th International Workshop on Al gorithmic Learning Theory, 1998.","DOI":"10.1007\/3-540-49730-7_8"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"A. Dhagat, L. Hellerstein. PAC Learning with Irrelevant Attributes. Proceedings of the 35th IEEE Foundations of Computer Science, pages 64\u201375, 1994.","DOI":"10.1109\/SFCS.1994.365704"},{"key":"8_CR11","unstructured":"R. Gavald\u00e1. On the Power of Equivalence Queries. Proceedings of the 2nd European Conference on Computational Learning Theory, (1993), 193\u2013203."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"M.R. Garey","key":"8_CR12","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York, 1979."},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"S. Goldman, M. Kearns. On the Complexity of Teaching. Proceedings of the 4rd Workshop on Computational Learning Theory, (1991), 303\u2013314.","DOI":"10.1016\/B978-1-55860-213-7.50031-6"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"T. Hancock. Identifying \u00b5-Formula Decision Trees with Queries. Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 23\u201337, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50005-9"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins. How Many Queries are Needed to Learn? Proceedings of the 27th ACM Symposium on the Theory of Computing, (1995), 190\u2013199.","DOI":"10.1145\/225058.225114"},{"issue":"6","key":"8_CR16","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"E. Kushilevitz and Y. Mansour. Learning Decision Trees Using the Fourier Spectrum. SIAM Journal of Computing, 22(6):1331\u20131348, 1993.","journal-title":"SIAM Journal of Computing"},{"key":"8_CR17","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"N. Littlestone. Learning Quickly When Irrelevant Variables Abound. Machine Learning, 2:285\u2013318, 1988.","journal-title":"Machine Learning"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. Proceedings of the 22nd ACM Symposium on the Theory of Computing, (1990), 312\u2013323.","DOI":"10.1145\/100216.100244"},{"key":"8_CR19","unstructured":"D. Wilkins. Learning Restricted-Read Branching Programs with Queries. Ph.D. Thesis, Vanderbilt University, 1995."}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49097-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:33:06Z","timestamp":1556321586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49097-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657019","9783540490975"],"references-count":19,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-49097-3_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}