{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:04:38Z","timestamp":1725480278390},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540667483"},{"type":"electronic","value":"9783540467694"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46769-6_26","type":"book-chapter","created":{"date-parts":[[2007,2,28]],"date-time":"2007-02-28T07:42:39Z","timestamp":1172648559000},"page":"313-322","source":"Crossref","is-referenced-by-count":7,"title":["Finding Relevant Variables in PAC Model with Membership Queries"],"prefix":"10.1007","author":[{"given":"David","family":"Guijarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Tarui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuie","family":"Tsukiji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,5,19]]},"reference":[{"key":"26_CR1","first-page":"319","volume":"2","author":"D. Angluin","year":"1987","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319, 1987.","journal-title":"Machine Learning"},{"key":"26_CR2","unstructured":"M. Ben-Or and N. Linial. Collective coin flipping. Advances in Computing Research, 5, 1989."},{"key":"26_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Proc. CRYPTO 93","author":"A. Blum","year":"1994","unstructured":"A. Blum, M. Furst, M.l. Kearns, and R. J. Lipton. Cryptographic primitives based on hard learning problems. In Proc. CRYPTO 93, pages 278\u2013291, 1994. LNCS 773."},{"issue":"1","key":"26_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, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50(1):32\u201340, 1995.","journal-title":"Journal of Computer and System Sciences"},{"key":"26_CR5","unstructured":"A.L. Blum and P. Langrey. Selection of relevant features and examples. Machine Learning. to be appeared."},{"key":"26_CR6","volume-title":"Combinatorics","author":"B. Bollobas","year":"1986","unstructured":"B. Bollobas. Combinatorics. Cambridge Univ. Press, Cambridge, 1986."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"P. Damaschke. Adaptive versus nonadaptive attribute-efficient learning. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 590\u2013596, 1998","DOI":"10.1145\/276698.276874"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 64\u201374, 1994.","DOI":"10.1109\/SFCS.1994.365704"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","volume":"36","author":"D. Haussler","year":"1988","unstructured":"D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant\u2019s model. Artificial Intelligence, 36(2):177\u2013221, 1988.","journal-title":"Artificial Intelligence"},{"key":"26_CR10","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/3-540-62685-9_15","volume":"1208","author":"R. Uehara","year":"1997","unstructured":"R. Uehara, K. Tsuchida, and I. Wegener. Optimal attribute-efficient learning of disjunction, parity and threshold functions. In Proceedings of the 3rd European Conference on Computational Learning Theory, volume 1208 of LNAI, pages 171\u2013184, 1997.","journal-title":"Proceedings of the 3rd European Conference on Computational Learning Theory"},{"issue":"11","key":"26_CR11","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1985","unstructured":"L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134\u20131142, 1985.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46769-6_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,15]],"date-time":"2019-02-15T22:23:55Z","timestamp":1550269435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46769-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667483","9783540467694"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-46769-6_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}