On parallel attribute-efficient learning

Journal of Computer and System Sciences

Volumn 67, Issue 1, 2003, Pages 46-62

  Damaschke, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

Auxiliary computation; Binary codes; Learning by queries; Limits of parallelization; Monotone Boolean functions; Randomization; Relevant variables; Special assignment families

Indexed keywords

BINARY CODES; BOOLEAN ALGEBRA; LEARNING SYSTEMS; PARALLEL PROCESSING SYSTEMS; QUERY LANGUAGES; THEOREM PROVING;

AUXILARY COMPUTATION;

COMPUTER SCIENCE;

EID: 0042520915     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0022-0000(03)00047-3     Document Type: Article

References (20)

1. D.J. Balding, D.C. Torney, A comparative survey of non-adaptive pooling designs, in: T. Speed, M.S. Waterman (Eds.), Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and its Applications, Vol. 81, Springer, Berlin, 1996, pp. 133-155.
2. D.J. Balding, D.C. Torney, Optimal pooling designs with error detection, J. Combin. Theory A 74 (1996) 131-140.
3. A. Blum, L. Hellerstein, N. Littlestone, Learning in the presence of finitely or infinitely many irrelevant attributes, J. Comput. System Sci. 50 (1995) 32-40.
4. N.H. Bshouty, L. Hellerstein, Attribute-efficient learning in query and mistake-bound models, Ninth Conference on Computational Learning Theory COLT'96, Assoc. Comput. Mach. Press, New York, pp. 235-243.
5. P. Damaschke, Randomized group testing for mutually obscuring defectives, Inform. Process. Lett. 67 (1998) 131-135.
6. P. Damaschke, Adaptive versus nonadaptive attribute-efficient learning, Mach. Learning 41 (2000) 197-215.
7. A. De Bonis, L. Gargano, U. Vaccaro, Group testing with unreliable tests, Inform. Sci. 96 (1997) 1-14.
8. A. De Bonis, U. Vaccaro, Improved algorithms for group testing with inhibitors, Inform. Process. Lett. 67 (1998) 57-64.
9. A. Dhagat, L. Hellerstein, PAC learning with irrelevant attributes, 35th IEEE Symposium on Foundations of Computer Science FOCS'99, IEEE Comput. Soc., Los Alamitos, CA, pp. 64-74.
10. M. Farach, S. Kannan, E. Knill, S. Muthukrishnan, Group testing problems in experimental molecular biology, Compression and Complexity of Sequences'97, IEEE Comput. Soc., Los Alamitos, CA, pp. 357-367.
11. P. Fischer, N. Klasner, I. Wegener, On the cut-off point for combinatorial group testing, Discrete Appl. Math. 91 (1999) 83-92.
12. T. Hofmeister, An application of codes to attribute-efficient learning, Fifth European Conference on Computational Learning Theory EuroCOLT'99, Lecture Notes in Artificial Intelligence, Vol. 1572, Springer-Verlag, Berlin, 1999, pp. 101-110.
13. J. Kivinen, H. Mannila, E. Ukkonen, Learning hierarchical rule sets, Fifth Conference on Computational Learning Theory COLT'92, Assoc. Comput. Mach. Press, New York, pp. 37-44.
14. E. Knill, Lower bounds for identifying subset members with subset queries, Sixth ACM-SIAM Symposium on Discrete Algorithms SODA'95, Assoc. Comput. Mach. Press, New York, pp. 369-377.
15. N. Littlestone, Learning quickly when irrelevant attributes abound: a new linear-threshold algorithm, Mach. Learning 2 (1988) 285-318.
16. M. Plotkin, Binary codes with specified minimum distances, IEEE Trans. Inform. Theory 6 (1960) 445-450.
17. R.A. Servedio, Computational sample complexity and attribute-efficient learning, J. Comput. System Sci. 60 (2000) 161-178.
18. A. Ta-Shma, Classical versus quantum communication complexity, SIGACT News 30 (3) (1999) 25-34.
19. R. Uehara, K. Tsuchida, I. Wegener, Optimal attribute-efficient learning of disjunction, parity, and threshold functions, Third European Conference on Computational Learning Theory EuroCOLT'97, Lecture Notes in Artificial Intelligence, Vol. 1208, Springer-Verlag, Berlin, pp. 171-184.
20. L.G. Valiant, Projection learning, 11th Conference on Computational Learning Theory COLT'98, Assoc. Comput. Mach. Press, New York, pp. 287-293.