Computational aspect. Of parallel attribute-efficient learning

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

Volumn 1501, Issue , 1998, Pages 103-111

  Damaschke, Peter ^a  

^a UNIVERSITY OF HAGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COARSENING;

COMPUTATIONAL AMOUNTS; COMPUTATIONAL ASPECTS; EFFICIENT LEARNING; FUNCTION CLASS; MEMBERSHIP QUERY; VERIFICATION ROUTINES;

BOOLEAN FUNCTIONS;

EID: 84961304819     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49730-7_8     Document Type: Conference Paper

References (18)

1. D.J. Balding, D.C. Torney: A comparative surve. 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, J. Of Combinatorial Theory A 74 (1996), 131-140
3. A. Blum, L. Hellerstein, N. Littlestone: Learning in the presenc. Of finitely or infinitely many irrelevant attributes, J. Of Computer and System Sciences 50 (1995), 32-40
4. N.H. Bshouty, R. Cleve: On the exact learnin. Of formulas in parallel, 33rd IEEE Symposium on Foundation. Of Computer Science FOCS (1992), 513-522
5. N.H. Bshouty, L. Hellerstein: Attribute-efficient learning in query and mistake-bound models, 9th Computational Learning Theory COLT (1996), 235-243
6. C.J. Colbourn, J.H. Dinitz: The CRC Handboo. Of Combinatorial Designs,CRC Press 1996, Section V6.1: Nonadaptive group testing 105
7. P. Damaschke: Adaptive vs. nonadaptive attribute-efficient learning, preliminary version in: 30th ACM Symposium on Theor. Of Computing STOC (1998), 590-596
8. A. Dhagat, L. Hellerstein: PAC learning with irrelevant attributes, 35th IEEE Symposium on Foundation. Of Computer Science FOCS (1994), 64-74
9. D.Z. Du, F.K. Hwang: Combinatorial Group Testing and Its Applications,World Scientific 1993
10. M. Farach, S. Kannan, E. Knill, S. Muthukrishnan: Group testing problems in experimental molecular biology, Proc. Of Sequences'97
11. S. Goldman, M. Kearns: On the complexit. Of teaching, J. Of Computer and System Sciences 50 (1995), 20-31
12. S. Goldman, M. Kearns, R. Schapire: Exact identificatio. Of read-once formulas using fixed point. Of amplification functions, SIAM J. Of Computing 22 (1993), 705-726
13. T. Hegedus: Combinatorial results on the complexit. Of teaching and learning, 19th Symposium on Mathematical Foundation. Of Computer Science MFCS (1994), LNCS 841 (Springer), 393-402
14. T. Hegedus, P. Indyk: On learning disjunction. Of zero-one threshold functions with queries, 8th Workshop on Algorithmic Learning Theory ALT (1997), LNAI 1316 (Springer), 446-460
15. N. Littlestone: Learning quickly when irrelevant attributes abound: A linear threshold algorithm, Machine Learning 2 (1988), 285-318
16. R. Motwani, P. Raghavan: Randomized Algorithms, Cambridge Univ. Press 1995
17. M. Naor, L.J. Schulman, A. Srinivasan: Splitters and near-optimal derandomization, 36th IEEE Symposium on Foundation. Of Computer Science FOCS(1995), 182-191
18. G. Seroussi, N.H. Bshouty: Vector sets for exhaustive testin. Of logic circuits, IEEE Transactions on Information Theory 34 (1988), 513-522