Partial occam’s razor and its applications

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

Volumn 1316, Issue , 1997, Pages 85-99

  Domingo, Carlos ^a   Tsukiji, Tatsuie ^b   Watanabe, Osamu ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b NAGOYA UNIVERSITY   (Japan)

^c TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

ITS APPLICATIONS; PAC LEARNING; POLYNOMIAL-TIME; SAMPLE COMPLEXITY;

LEARNING ALGORITHMS;

EID: 84958035056     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63577-7_37     Document Type: Conference Paper

References (22)

1. H. Almuallim and T.G. Dietterich. Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69(1-2), 279-306, 1994.
2. J.A. Aslam and S.E. Decatur. General bounds on statistical query learning and PAC learning with noise via hypothesis boosting. In Proceedings of the 34th IEEE Symposium on Foundation of Computer Science, 282-291, 1993.
3. D. Angluin and P.D. Laird. Learning from noisy examples. Machine Learning, 2(4):343-370, 1988.
4. A. Blumer, A. Ehrenfeucht, D. Hanssler, and M.K. Warmuth. Occam's razor. Information Processing Letters, 24:377-380,1987.
5. R. Bard and L. Pitt. On the necessity of Occam algorithms. Theoretical Computer Science, 100:157-184, 1992.
6. A. Dhagat and L. Hellerstein. PAC learning with irrelevant attributes. In Proceedings of the 35th IEEE Symposium on Foundation of Computer Science, 64-74, 1994.
7. Y. Freund. Boosting a weak learning algorithm by majority. Information and Computation, 121(2):256-285, 1995.
8. Jeffrey Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. In Proceedings of the 35rd Annual Symposium on Foundations of Computer Science, pages 42-53. IEEE Computer Society Press~ Los Alamitos, CA, 1994.
9. T. Hancock, T. Jiang, M. Li, and J. Tromp. Lower bounds on learning decision lists and trees. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 527-538, 1995.
10. D. Haussler. Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence, 36:177-221, 1988.
11. D. Helmbold and M. K. Warmuth. On weak learning. Journal of Computer and System Sciences, 50(3), 551-573, 1995.
12. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proceedings of the 25th Annual ACM Symposium on Theory of Computing, 392-401, 1993.
13. M.J. Kearns, M. Li and L.G. Valiant. Learning Boolean formulas. Journal of the A CM,41 (6):1298-1328,1994.
14. M.J. Kearns and U.V. Vazirani. An Introduction to Computational Learning Theory. Cambridge University Press, 1994.
15. P.D. Laird. Learning from Good and Bad Data. Kluwer international series in engineering and computer science. Kluwer Academic Publishers, Boston, 1988.
16. N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
17. N. Littlestone. From on line to batch learning. In Proceedings of the 2nd Workshop on Computational Learning Theory, 269-284, 1990.
18. R.L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987.
19. R.E. Schapire. The strength of weak learnability. Machine Learning, 5(2):197-227, 1990.
20. L.G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134-1142, 1984.
21. L.G. Valiant. Learning disjunctions of conjunctions. In Proceedings of the 9th International Joint Conference on Artificial Intelligence, 560-566, 1985.
22. M. K. Warmuth. Posted in the COLT list.