{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:45:56Z","timestamp":1761291956311,"version":"3.41.2"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"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":[[2000,11]]},"DOI":"10.1023\/a:1007616604496","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T05:54:50Z","timestamp":1040536490000},"page":"197-215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":31,"title":["Adaptive Versus Nonadaptive Attribute-Efficient Learning"],"prefix":"10.1007","volume":"41","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"274347_CR1","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(94)90084-1","volume":"69","author":"H. Almuallim","year":"1994","unstructured":"Almuallim, H. & Dietterich, T.G. (1994). Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69, 279\u2013305.","journal-title":"Artificial Intelligence"},{"key":"274347_CR2","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., & Roth, R. (1992a). Construction of asymptotically good, low-rate errorcorrecting codes through pseudorandom graphs. IEEE Transactions on Information Theory, 38, 509\u2013516.","journal-title":"IEEE Transactions on Information Theory"},{"key":"274347_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","volume":"3","author":"N. Alon","year":"1992","unstructured":"Alon, N., Goldreich, O., H\u0103stad, J., & Peralta, R. (1992b). Simple constructions of almost k-wise independent random variables. Random Structures and Algortihms, 3, 289\u2013304; Ibid. (1993) 4, 119\u2013120.","journal-title":"Random Structures and Algortihms"},{"key":"274347_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0012-365X(93)90473-7","volume":"115","author":"I. Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I. & Triesch, E. (1993). Edge search in graphs and hypergraphs of bounded rank. Discrete Mathematics, 115, 1\u20139.","journal-title":"Discrete Mathematics"},{"key":"274347_CR5","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D. Angluin","year":"1987","unstructured":"Angluin, D. (1987). Queries and concept learning. Machine Learning, 2, 319\u2013342.","journal-title":"Machine Learning"},{"key":"274347_CR6","doi-asserted-by":"crossref","unstructured":"Balding, D. J. & Torney, D. C. (1995). A comparative survey of non-adaptive pooling designs. In Genetic mapping and DNA sequencing (IMA volumes in mathematics and its applications) (pp. 133\u2013155). Springer.","DOI":"10.1007\/978-1-4612-0751-1_8"},{"key":"274347_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jcta.1996.0041","volume":"74","author":"D. J. Balding","year":"1996","unstructured":"Balding, D. J. & Torney, D. C. (1996). Optimal pooling designs with error detection. Journal of Combinatorial Theory A, 74, 131\u2013140.","journal-title":"Journal of Combinatorial Theory A"},{"key":"274347_CR8","doi-asserted-by":"crossref","unstructured":"Beimel, A., Geller, F., & Kushilevitz, E. (1998). The query complexity of finding local minima in the lattice. In Proceedings of the 11th Conference on Computational Learning Theory (COLT) (pp. 294\u2013302). ACM Press.","DOI":"10.1145\/279943.280000"},{"key":"274347_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1007465907571","volume":"29","author":"S. Ben-David","year":"1997","unstructured":"Ben-David, S., Kushilevitz, E., & Mansour, Y. (1997). Online learning versus offline learning. Machine Learning, 29, 45\u201363.","journal-title":"Machine Learning"},{"key":"274347_CR10","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1022653502461","volume":"9","author":"A. Blum","year":"1992","unstructured":"Blum, A. (1992). Learning Boolean functions in an infinite attribute space. Machine Learning, 9, 373\u2013386.","journal-title":"Machine Learning"},{"key":"274347_CR11","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/jcss.1995.1004","volume":"50","author":"A. Blum","year":"1995","unstructured":"Blum, A., Hellerstein, L., & Littlestone, N. (1995). Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50, 32\u201340.","journal-title":"Journal of Computer and System Sciences"},{"key":"274347_CR12","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N. H. Bshouty","year":"1995","unstructured":"Bshouty, N. H. (1995). Exact learning Boolean functions via the monotone theory. Information and Computation, 123, 146\u2013153.","journal-title":"Information and Computation"},{"key":"274347_CR13","doi-asserted-by":"crossref","unstructured":"Bshouty, N. H. & Cleve, R. (1992). On the exact learning of formulas in parallel. In Proceedings of the 33th IEEE Foundations of Computer Science (FOCS) (pp. 513\u2013522). IEEE Press.","DOI":"10.1109\/SFCS.1992.267800"},{"key":"274347_CR14","doi-asserted-by":"crossref","unstructured":"Bshouty, N. H. & Hellerstein, L. (1996). Attribute-efficient learning in query and mistake-bound models. In Proceedings of the 9th Conference on Computational Lerning Theory (COLT) (pp. 235\u2013243). ACM Press.","DOI":"10.1145\/238061.238108"},{"key":"274347_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0304-3975(91)90157-W","volume":"84","author":"M. Clausen","year":"1991","unstructured":"Clausen, M., Dress, A., Grabmeier, J., & Karpinski, M. (1991). On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoretical Computer Science, 84, 151\u2013164.","journal-title":"Theoretical Computer Science"},{"key":"274347_CR16","doi-asserted-by":"crossref","unstructured":"Colbourn, C. J. & Dinitz, J. H. (1996). The CRC Handbook of Combinatorial Designs. CRC Press.","DOI":"10.1201\/9781420049954"},{"key":"274347_CR17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(92)00120-B","volume":"48","author":"P. Damaschke","year":"1994","unstructured":"Damaschke, P. (1994). Atight upper bound for group testing in graphs. Discrete Applied Mathematics, 48, 101\u2013109.","journal-title":"Discrete Applied Mathematics"},{"key":"274347_CR18","doi-asserted-by":"crossref","unstructured":"Damaschke, P. (1997). The algorithmic complexity of chemical threshold testing. In Lecture Notes in Computer Science, Vol. 1203: Proceedings of the 3rd Italian Conference on Algorithms and Complexity (CIAC) (pp. 205\u2013216). Springer.","DOI":"10.1007\/3-540-62592-5_73"},{"key":"274347_CR19","doi-asserted-by":"crossref","unstructured":"Damaschke, P. (1998a). Achip search problem on binary numbers. In Lecture Notes in Computer Science, Vol. 1380: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (LATIN) (pp. 11\u201322). Springer.","DOI":"10.1007\/BFb0054306"},{"key":"274347_CR20","doi-asserted-by":"crossref","unstructured":"Damaschke, P. (1998b). Comutational aspects of parallel attribute-efficient learning. In Lecture Notes in Artificial Intelligence, Vol. 1501: Proceedings of the 9th International Workshop on Algorithmic Learning Theory (ALT) (pp. 103\u2013111). Springer.","DOI":"10.1007\/3-540-49730-7_8"},{"key":"274347_CR21","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(98)00096-9","volume":"67","author":"P. Damaschke","year":"1998","unstructured":"Damaschke, P. (1998c). Randomized group testing for mutually obscuring defectives. Information Processing Letters, 67, 131\u2013135.","journal-title":"Information Processing Letters"},{"key":"274347_CR22","doi-asserted-by":"crossref","unstructured":"De Bonis, A., Gargano, L., & Vaccaro, U. (1998). Improved algorithms for chemical threshold testing problems. In Lecture Notes in Computer Science, Vol. 1449: Proceedings of the 4th Conference on Computing and Combinatorics (COCOON) (pp. 127\u2013136). Springer.","DOI":"10.1007\/3-540-68535-9_16"},{"key":"274347_CR23","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0020-0190(98)00088-X","volume":"67","author":"A. De Bonis","year":"1998","unstructured":"De Bonis, A. & Vaccaro, U. (1998). Improved algorithms for group testing with inhibitors. Information Processing Letters, 67, 57\u201364.","journal-title":"Information Processing Letters"},{"key":"274347_CR24","doi-asserted-by":"crossref","unstructured":"Dhagat, A. & Hellerstein, L. (1994). PAC learning with irrelevant attributes. In Proceedings of the 35th IEEE Foundations of Computer Science (FOCS) (pp. 64\u201374). IEEE Press.","DOI":"10.1109\/SFCS.1994.365704"},{"key":"274347_CR25","doi-asserted-by":"crossref","unstructured":"Du, D. Z. & Hwang, F. K. (1993). Combinatorial Group Testing and its Applications. World Scientific.","DOI":"10.1142\/9789812798183"},{"key":"274347_CR26","doi-asserted-by":"crossref","unstructured":"Farach, M., Kannan, S., Knill, E., & Muthukrishnan, S. (1997). Group testing problems in experimental molecular biology. In Proceedings of Compression and Complexity of Sequences (pp. 357\u2013367). IEEE Computer Society.","DOI":"10.1109\/SEQUEN.1997.666930"},{"key":"274347_CR27","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0166-218X(98)00119-X","volume":"91","author":"P. Fischer","year":"1999","unstructured":"Fischer, P., Klasner, N., & Wegener, I. (1999). On the cut-off point for combinatorial group testing. Discrete Applied Mathematics, 91, 83\u201392.","journal-title":"Discrete Applied Mathematics"},{"key":"274347_CR28","first-page":"271","volume":"14","author":"S. A. Goldman","year":"1994","unstructured":"Goldman, S. A. & Sloan, R. H. (1994). The power of self-directed learning. Machine Learning, 14, 271\u2013294.","journal-title":"Machine Learning"},{"key":"274347_CR29","doi-asserted-by":"crossref","unstructured":"Hofmeister, T. (1999). An application of codes to attribute-efficient learning. In Lecture Notes in Artificial Intelligence, Vol. 1572: Proceedings of 5th European Conference on Computational Learning Theory (EuroCOLT) (pp. 101\u2013110). Springer.","DOI":"10.1007\/3-540-49097-3_9"},{"key":"274347_CR30","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(96)00006-9","volume":"87","author":"R. Khardon","year":"1996","unstructured":"Khardon, R. & Roth, D. (1996). Reasoning with models. Artificial Intelligence, 87, 187\u2013213.","journal-title":"Artificial Intelligence"},{"key":"274347_CR31","doi-asserted-by":"crossref","unstructured":"Kivinen, J., Mannila, H., & Ukkonen, E. (1992). Learning hierarchical rule sets. In Proceedings of the 5th Conference on Computational Learning Theory (COLT) (pp. 37\u201344). ACM Press.","DOI":"10.1145\/130385.130389"},{"key":"274347_CR32","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D. J. Kleitman","year":"1973","unstructured":"Kleitman, D. J. & Spencer, J. H. (1973). Families of k-independent sets. Discrete Mathematics, 6, 255\u2013262.","journal-title":"Discrete Mathematics"},{"key":"274347_CR33","unstructured":"Knill, E. (1995). Lower bounds for identifying subset members with subset queries. In Proceedings of the 6th ACM-SIAM Symposium on Discrete Algorithms (SODA) (pp. 369\u2013377)."},{"key":"274347_CR34","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","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\u2013318.","journal-title":"Machine Learning"},{"key":"274347_CR35","unstructured":"Macula, A. & Reuter, G. Simplified searching for two defects. Journal of Statistical Planning and Inference. To appear."},{"key":"274347_CR36","doi-asserted-by":"crossref","unstructured":"Motwani, R. & Raghavan, P. (1995). Randomized Algorithms. Cambridge University Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"274347_CR37","doi-asserted-by":"crossref","first-page":"838","DOI":"10.1137\/0222053","volume":"22","author":"J. Naor","year":"1993","unstructured":"Naor, J. & Naor, M. (1993). Small-bias probability spaces: Efficient constructions and applications. SIAM Journal on Computing, 22, 838\u2013856.","journal-title":"SIAM Journal on Computing"},{"key":"274347_CR38","doi-asserted-by":"crossref","unstructured":"Naor, M., Schulman, L. J., & Srinivasan, A. (1995). Splitters and near-optimal derandomization. In Proceedings of the 36th IEEE Foundations of Computer Science (FOCS) (pp. 182\u2013191). IEEE Press.","DOI":"10.1109\/SFCS.1995.492475"},{"key":"274347_CR39","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1137\/0220019","volume":"20","author":"R. M. Roth","year":"1991","unstructured":"Roth, R. M. & Benedek, G. M. (1991). Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM Journal on Computing, 20, 291\u2013314.","journal-title":"SIAM Journal on Computing"},{"key":"274347_CR40","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1109\/18.6031","volume":"34","author":"G. Seroussi","year":"1988","unstructured":"Seroussi, G. & Bshouty, N. H. (1988). Vector sets for exhaustive testing of logic circuits. IEEE Transactions on Information Theory, 34, 513\u2013522.","journal-title":"IEEE Transactions on Information Theory"},{"key":"274347_CR41","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0166-218X(95)00120-G","volume":"66","author":"E. Triesch","year":"1996","unstructured":"Triesch, E. (1996). A group testing problem for hypergraphs of bounded rank. Discrete Applied Mathematics, 66, 185\u2013188.","journal-title":"Discrete Applied Mathematics"},{"key":"274347_CR42","doi-asserted-by":"crossref","unstructured":"Uehara, R., Tsuchida, K., & Wegener, I. (1997). Optimal attribute-efficient learning of disjunction, parity, and threshold functions. In Lecture Notes in Artificial Intelligence, Vol. 1208: Proceedings of the 3rd European Conference on Computational Learning Theory (EuroCOLT)(pp. 171\u2013184). Springer.","DOI":"10.1007\/3-540-62685-9_15"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007616604496.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007616604496\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007616604496.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:42:40Z","timestamp":1752147760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007616604496"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["274347"],"URL":"https:\/\/doi.org\/10.1023\/a:1007616604496","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2000,11]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}