[Lecture Notes in Computer Science] Machine Learning: ECML 2002 Volume 2430 || Improved Smoothing for Probabilistic Suffix Trees Seen as Variable Order Markov Chains
✍ Scribed by Elomaa, Tapio; Mannila, Heikki; Toivonen, Hannu
- Book ID
- 121803625
- Publisher
- Springer Berlin Heidelberg
- Year
- 2002
- Tongue
- English
- Weight
- 167 KB
- Edition
- 1
- Category
- Article
- ISBN
- 3540367551
No coin nor oath required. For personal study only.
✦ Synopsis
This book constitutes the refereed preceedings of the 13th European Conference on Machine Learning, ECML 2002, held in Helsinki, Finland in August 2002. The 41 revised full papers presented together with 4 invited contributions were carefully reviewed and selected from numerous submissions. Among the topics covered are computational discovery, search strategies, Classification, support vector machines, kernel methods, rule induction, linear learning, decision tree learning, boosting, collaborative learning, statistical learning, clustering, instance-based learning, reinforcement learning, multiagent learning, multirelational learning, Markov decision processes, active learning, etc.