Exact learning when irrelevant variables abound

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

Volumn 1572, Issue , 1999, Pages 91-100

  Guijarro, David ^a   Lavín, Víctor ^a   Raghavan, Vijay ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b VANDERBILT UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TABLES; DECISION TREES; EQUIVALENCE CLASSES; POLYNOMIAL APPROXIMATION; QUERY PROCESSING;

EQUIVALENCE QUERIES; EXACT LEARNING; IRRELEVANT VARIABLES; MEMBERSHIP QUERY; POLYNOMIAL-TIME; REPRESENTATION CLASS; TREE REPRESENTATION; TRUTH TABLES;

BOOLEAN FUNCTIONS;

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

References (19)

1. D. Angluin. Queries and Concept Learning. Machine Learning, 2, (1988), 319-342.
2. D. Angluin. Negative Results for Equivalence Queries. Machine Learning, 5, (1990), 121-150.
3. J. C. Bioch and T. Ibaraki. Complexity of Identification and Dualization of Positive Boolean Functions. Information and Computation, 123: 50-63, 1995.
4. A. Blum, L. Hellerstein, N. Littlestone. Learning in the Presence of Finitely or Infinitely Many Attributes. Journal of Computer and System Science, pages 50: 32-40, 1995.
5. N. Bshouty. Exact Learning Boolean Functions via the Monotone Theory. Information and Computation, 123(1): 146-153, Nov 1995.
6. N. Bshouty, R. Cleve, S. Kannan, and C. Tamon. Oracles and Queries that are Sufficient for Exact Learning. Proceedings of the Seventh Annual A CM Conference on Computational Learning Theory, pages 130-139, 1994.
7. N. H. Bshouty, L. Hellerstein. Attribute-efficient Learning in Query and Mistake Bound Models. Proceedings of the Ninth Conference on Computational Learning Theory, pages 235-243, 1996.
8. P. Damaschke. Adaptive versus Non-Adaptive Attribute-Efficient Learning. Proceedings of the 35th ACM Symposium on Theory of Computing, pages 590-596, 1998.
9. P. Damaschke. Computational Aspects of Parallel Attribute-Efficient Learning. To appear in: Proceedings of the 9th International Workshop on Al gorithmic Learning Theory, 1998.
10. A. Dhagat, L. Hellerstein. PAC Learning with Irrelevant Attributes. Proceedings of the 35th IEEE Foundations of Computer Science, pages 64-75, 1994.
11. R. Gavalda. On the Power of Equivalence Queries. Proceedings of the 2nd European Conference on Computational Learning Theory, (1993), 193-203.
12. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
13. S. Goldman, M. Kearns. On the Complexity of Teaching. Proceedings of the 4rd Workshop on Computational Learning Theory, (1991), 303-314.
14. T. Hancock. Identifying μ-Formula Decision Trees with Queries. Proceedings of the Third Annual Workshop on Computational Learning Theory, pages 23-37, 1990.
15. L. Hellerstein, K. Pillaipakkamnatt, V. Raghavan, D. Wilkins. How Many Queries are Needed to Learn? Proceedings of the 27th ACM Symposium on the Theory of Computing, (1995), 190-199.
16. E. Kushilevitz and Y. Mansour. Learning Decision Trees Using the Fourier Spectrum. SIAM Journal of Computing, 22(6): 1331-1348, 1993.
17. N. Littlestone. Learning Quickly When Irrelevant Variables Abound. Machine Learning, 2: 285-318, 1988.
18. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. Proceedings of the 22nd ACM Symposium on the Theory of Computing, (1990), 312-323.
19. D. Wilkins. Learning Restricted-Read Branching Programs with Queries. Ph. D. Thesis, Vanderbilt University, 1995.