From computational learning theory to discovery science

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

Volumn 1644 LNCS, Issue , 1999, Pages 134-148

  Watanabe, Osamu ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; MACHINE LEARNING;

ADAPTIVITY; COMPUTATIONAL LEARNING THEORY; DISCOVERY SCIENCE; LEARNING TECHNIQUES; REAL PROBLEMS; REAL-WORLD; THEORETICAL COMPUTER SCIENCE;

LEARNING ALGORITHMS;

EID: 84887429648     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48523-6_11     Document Type: Conference Paper

References (17)

1. C. Domingo, R. Gavaldfia, and O. Watanabe, Practical algorithms for on- line selection, in Proc. of the First Int'l Conference on Discovery Science, DS'98, Lecture Notes in Artificial Intelligence 1532:150-161, 1998.
2. C. Domingo, R. Gavaldfia, and O. Watanabe, Adaptive sampling methods for scaling up knowledge discovery algorithms, Technical Report C-131, Dept. of Math. and Computing Sciences, Tokyo Institute of Technology, 1999.
3. Y. Freund, Boosting a weak learning algorithm by majority, Information and Computation, 121(2):256-285, 1995.
4. Y. Freund and R.E. Schapire, Experiments with a new boosting algorithm, in Machine Learning: Proc. of the 13th Int'l Conference, 148-156, 1996.
5. Y. Freund and R.E. Schapire, A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci., 55(1):119- 139, 1997.
6. M.J. Kearns and L.G. Valiant, Cryptographic limitations on learning boo- lean formulae and finite automata, J. Assoc. Comput. Mach., 41(1):67-95, 1994.
7. M.J. Kearns and U.V. Vazirani, An Introduction to Computational Learning Theory, Cambridge University Press, 1994.
8. Richard J. Lipton and Jefirey F. Naughton, Query size estimation by adap- Tive sampling, Journal of Computer and System Science, 51:18-25, 1995.
9. R.J. Lipton, J.F. Naughton, D.A. Schneider, and S. Seshadri, Eficient sampling strategies for relational database operations, Theoretical Computer Science, 116:195-226, 1993.
10. J.R. Quinlan, Bagging, boosting, and C4.5, in Proc. of the 13th National Conference on Artificial Intelligence, 725-730, 1996.
11. R. Reischuk and T. Zeugmann, A complete and tight average-case analysis of learning monomial, in Proc. 16th Int'l Sympos. on Theoretical Aspects of Computer Science, STACS'99, 1999, to appear.
12. J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson, and M. Anthony, Structural risk minimization over data-dependent hierarchies, IEEE Trans. Infor- mation Theory, 44(5):1926-1940, 1998.
13. R.E. Schapire, The strength of weak learnability, Machine Learning, 5(2):197-227, 1990.
14. R.E. Schapire, Theoretical views of boosting, in Computational Learning Theory: Proc. of the 4th European Conference, EuroCOLT'99, 1999, to appear.
15. L. Valiant, A theory of the learnable, Communications of the ACM, 27(11):1134-1142, 1984.
16. A. Wald, Sequential Analysis, Wiley Mathematical, Statistics Series, 1947.
17. T. Zeugmann, Lange and Wiehagen's pattern language learning algorithm: An average-case analysis with respect to its total learning time, Annals of Math. and Artificial Intelligence, 23(1-2):117-145, 1998.