{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:59Z","timestamp":1759637639429,"version":"3.30.2"},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,8,1]],"date-time":"2003-08-01T00:00:00Z","timestamp":1059696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3638,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2003,8]]},"DOI":"10.1016\/s0022-0000(03)00047-3","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T23:51:31Z","timestamp":1054079491000},"page":"46-62","source":"Crossref","is-referenced-by-count":13,"title":["On parallel attribute-efficient learning"],"prefix":"10.1016","volume":"67","author":[{"given":"Peter","family":"Damaschke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(03)00047-3_BIB1","series-title":"Genetic Mapping and DNA Sequencing","first-page":"133","article-title":"A comparative survey of non-adaptive pooling designs","volume":"Vol. 81","author":"Balding","year":"1996"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1006\/jcta.1996.0041","article-title":"Optimal pooling designs with error detection","volume":"74","author":"Balding","year":"1996","journal-title":"J. Combin. Theory A"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB3","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1006\/jcss.1995.1004","article-title":"Learning in the presence of finitely or infinitely many irrelevant attributes","volume":"50","author":"Blum","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB4","doi-asserted-by":"crossref","unstructured":"N.H. Bshouty, L. Hellerstein, Attribute-efficient learning in query and mistake-bound models, Ninth Conference on Computational Learning Theory COLT\u201996, Assoc. Comput. Mach. Press, New York, pp. 235\u2013243.","DOI":"10.1145\/238061.238108"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB5","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0020-0190(98)00096-9","article-title":"Randomized group testing for mutually obscuring defectives","volume":"67","author":"Damaschke","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB6","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1007616604496","article-title":"Adaptive versus nonadaptive attribute-efficient learning","volume":"41","author":"Damaschke","year":"2000","journal-title":"Mach. Learning"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0020-0255(96)00155-7","article-title":"Group testing with unreliable tests","volume":"96","author":"De Bonis","year":"1997","journal-title":"Inform. Sci."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB8","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0020-0190(98)00088-X","article-title":"Improved algorithms for group testing with inhibitors","volume":"67","author":"De Bonis","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB9","doi-asserted-by":"crossref","unstructured":"A. Dhagat, L. Hellerstein, PAC learning with irrelevant attributes, 35th IEEE Symposium on Foundations of Computer Science FOCS\u201999, IEEE Comput. Soc., Los Alamitos, CA, pp. 64\u201374.","DOI":"10.1109\/SFCS.1994.365704"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB10","doi-asserted-by":"crossref","unstructured":"M. Farach, S. Kannan, E. Knill, S. Muthukrishnan, Group testing problems in experimental molecular biology, Compression and Complexity of Sequences\u201997, IEEE Comput. Soc., Los Alamitos, CA, pp. 357\u2013367.","DOI":"10.1109\/SEQUEN.1997.666930"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB11","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/S0166-218X(98)00119-X","article-title":"On the cut-off point for combinatorial group testing","volume":"91","author":"Fischer","year":"1999","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB12","unstructured":"T. Hofmeister, An application of codes to attribute-efficient learning, Fifth European Conference on Computational Learning Theory EuroCOLT\u201999, Lecture Notes in Artificial Intelligence, Vol. 1572, Springer-Verlag, Berlin, 1999, pp. 101\u2013110."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB13","doi-asserted-by":"crossref","unstructured":"J. Kivinen, H. Mannila, E. Ukkonen, Learning hierarchical rule sets, Fifth Conference on Computational Learning Theory COLT\u201992, Assoc. Comput. Mach. Press, New York, pp. 37\u201344.","DOI":"10.1145\/130385.130389"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB14","unstructured":"E. Knill, Lower bounds for identifying subset members with subset queries, Sixth ACM-SIAM Symposium on Discrete Algorithms SODA\u201995, Assoc. Comput. Mach. Press, New York, pp. 369\u2013377."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00116827","article-title":"Learning quickly when irrelevant attributes abound","volume":"2","author":"Littlestone","year":"1988","journal-title":"Mach. Learning"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB16","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1109\/TIT.1960.1057584","article-title":"Binary codes with specified minimum distances","volume":"6","author":"Plotkin","year":"1960","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1006\/jcss.1999.1666","article-title":"Computational sample complexity and attribute-efficient learning","volume":"60","author":"Servedio","year":"2000","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/S0022-0000(03)00047-3_BIB18","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1145\/333623.333628","article-title":"Classical versus quantum communication complexity","volume":"30","author":"Ta-Shma","year":"1999","journal-title":"SIGACT News"},{"key":"10.1016\/S0022-0000(03)00047-3_BIB19","unstructured":"R. Uehara, K. Tsuchida, I. Wegener, Optimal attribute-efficient learning of disjunction, parity, and threshold functions, Third European Conference on Computational Learning Theory EuroCOLT\u201997, Lecture Notes in Artificial Intelligence, Vol. 1208, Springer-Verlag, Berlin, pp. 171\u2013184."},{"key":"10.1016\/S0022-0000(03)00047-3_BIB20","doi-asserted-by":"crossref","unstructured":"L.G. Valiant, Projection learning, 11th Conference on Computational Learning Theory COLT\u201998, Assoc. Comput. Mach. Press, New York, pp. 287\u2013293.","DOI":"10.1145\/279943.279999"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000473?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000003000473?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,12]],"date-time":"2024-12-12T18:48:42Z","timestamp":1734029322000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000003000473"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,8]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,8]]}},"alternative-id":["S0022000003000473"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(03)00047-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"type":"print","value":"0022-0000"}],"subject":[],"published":{"date-parts":[[2003,8]]}}}