Parallel attribute-efficient learning of monotone boolean functions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1851, Issue , 2000, Pages 504-512

  Damaschke, Peter ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY;

ADVERSARY ARGUMENT; CONSTANT FACTORS; EFFICIENT LEARNING; EXACT LEARNING; LAS VEGAS; MEMBERSHIP QUERY; MONOTONE BOOLEAN FUNCTIONS; MONOTONE FUNCTIONS;

BOOLEAN FUNCTIONS;

EID: 0346478925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44985-X     Document Type: Conference Paper

References (21)

1. D.J. Balding, D.C. Torney: A comparative survey of non-adaptive pooling designs, in: Genetic Mapping and DNA Sequencing (IMA Volumes in Mathematics and Its Applications) (Springer 1995), 133-155
2. D.J. Balding, D.C. Torney: Optimal pooling designs with error detection, Journal of Comb. Theory A 74 (1996), 131-140
3. A. Blum, L. Hellerstein, N. Littlestone: Learning in the presence of finitely or infinitely many irrelevant attributes, Journal of Computer and System Sciences 50 (1995), 32-40
4. N.H. Bshouty, L. Hellerstein: Attribute-efficient learning in query and mistakebound models, 9th Conf. on Computational Lerning Theory COLT'96, 235-243
5. P. Damaschke: Adaptive versus nonadaptive attribute-efficient learning, 30th ACM Symp. on Theory of Computing STOC'98, 590-596, accepted by Machine Learning
6. P. Damaschke: Computational aspects of parallel attribute-efficient learning, 9th Int. Workshop on Algorithmic Learning Theory ALT'98, LNAI 1501, 103-111
7. P. Damaschke: Randomized group testing for mutually obscuring defectives, Info. Proc. Letters 67 (1998), 131-135
8. A. De Bonis, L. Gargano, U. Vaccaro: Group testing with unreliable tests, Info. Sci. 96 (1997), 1-14
9. A. De Bonis, U. Vaccaro: Improved algorithms for group testing with inhibitors, Info. Proc. Letters 67 (1998), 57-64
10. A. Dhagat, L. Hellerstein: PAC learning with irrelevant attributes, 35th IEEE Symp. on Foundations of Computer Science FOCS'94, 64-74
11. M. Farach, S. Kannan, E. Knill, S. Muthukrishnan: Group testing problems in experimental molecular biology, Compression and Complexity of Sequences '97, 357-367
12. P. Fischer, N. Klasner, I. Wegener: On the cut-off point for combinatorial group testing, Discrete Applied Math. 91 (1999), 83-92
13. T. Hofmeister: An application of codes to attribute-efficient learning, 5th European Conf. on Computational Learning Theory EuroCOLT'99, LNAI 1572 (1999), 101-110
14. J. Kivinen, H. Mannila, E. Ukkonen: Learning hierarchical rule sets, 5th Conf. on Computational Learning Theory COLT'92, 37-44
15. E. Knill: Lower bounds for identifying subset members with subset queries, 6th ACM-SIAM Symp. on Discrete Algorithms SODA'95, 369-377
16. N. Littlestone: Learning quickly when irrelevant attributes abound: a new linearthreshold algorithm, Machine Learning 2 (1988), 285-318
17. M. Plotkin: Binary codes with specified minimum distances, IEEE Trans. Info. Theory 6 (1960), 445-450
18. R.A. Servedio: Computational sample complexity and attribute-efficient learning, 31st ACM Symp. on Theory of Computing STOC'99
19. A. Ta-Shma: Classical versus quantum communication complexity, SIGACT News 30(3) (1999), 25-34
20. R. Uehara, K. Tsuchida, I. Wegener: Optimal attribute-efficient learning of disjunction, parity, and threshold functions, 3rd European Conf. on Computational Learning Theory EuroCOLT'97, LNAI 1208, 171-184
21. L.G. Valiant: Projection learning, 11th Conf. on Computational Learning Theory COLT'98, 287-293