Finding relevant variables in PAC model with membership queries

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

Volumn 1720, Issue , 1999, Pages 313-322

  Guijarro, David ^a   Tarui, Jun ^b   Tsukiji, Tatsuie ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^c NAGOYA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY DISTRIBUTION; LINEAR TIME; MEMBERSHIP QUERY; QUADRATIC TIME; RESEARCH FRONTIERS; UNIFORM DISTRIBUTION; VERSION SPACE;

DATA MINING;

EID: 84957092370     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46769-6_26     Document Type: Conference Paper

References (11)

1. D. Angluin. Queries and concept learning. Machine Learning, 2:319, 1987.
2. M. Ben-Or and N. Linial. Collective coin flipping. Advances in Computing Research, 5, 1989.
3. A. Blum, M. Furst, M.l. Kearns, and R. J. Lipton. Cryptographic primitives based on hard learning problems. In Proc. CRYPTO 93, pages 278-291, 1994. LNCS 773.
4. A. Blum, L. Hellerstein, and N. Littlestone. Learning in the presence of finitely or infinitely many irrelevant attributes. Journal of Computer and System Sciences, 50(1):32-40, 1995.
5. A.L. Blum and P. Langrey. Selection of relevant features and examples. Machine Learning. to be appeared.
6. B. Bollobas. Combinatorics. Cambridge Univ. Press, Cambridge, 1986.
7. P. Damaschke. Adaptive versus nonadaptive attribute-efficient learning. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC-98), pages 590-596, 1998.
8. A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 64-74, 1994.
9. D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant's model. Artificial Intelligence, 36(2):177-221, 1988.
10. R. Uehara, K. Tsuchida, and I. Wegener. Optimal attribute-efficient learning of disjunction, parity and threshold functions. In Proceedings of the 3rd European Conference on Computational Learning Theory, volume 1208 of LNAI, pages 171-184, 1997.
11. L. G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1985.