Machine Learning: ECML-98: 10th European Conference on Machine Learning Chemnitz, Germany, April 21–23, 1998 Proceedings

Learning in agent-oriented worlds....Pages 1-3
Naive (Bayes) at forty: The independence assumption in information retrieval....Pages 4-15
Learning verbal transitivity using loglinear models....Pages 17-24
Part-of-speech tagging using decision trees....Pages 25-36
Inference of finite automata: Reducing the search space with an ordering of pairs of states....Pages 37-42
Automatic acquisition of lexical knowledge from sparse and noisy data....Pages 43-48
A normalization method for contextual data: Experience from a large-scale application....Pages 49-54
Learning to classify x-ray images using relational learning....Pages 55-60
ILP experiments in detecting traffic problems....Pages 61-66
Simulating children learning and explaining elementary heat transfer phenomena: A multistrategy system at work....Pages 67-76
Bayes optimal instance-based learning....Pages 77-88
Bayesian and information-theoretic priors for Bayesian network parameters....Pages 89-94
Feature subset selection in text-learning....Pages 95-100
A monotonic measure for optimal feature selection....Pages 101-106
Inducing models of human control skills....Pages 107-118
God doesn't always shave with Occam's razor — Learning when and how to prune....Pages 119-124
Error estimators for pruning regression trees....Pages 125-130
Pruning decision trees with misclassification costs....Pages 131-136
Text categorization with Support Vector Machines: Learning with many relevant features....Pages 137-142
A short note about the application of polynomial kernels with fractional degree in Support Vector Learning....Pages 143-148
Classification learning using all rules....Pages 149-159
Improved pairwise coupling classification with correcting classifiers....Pages 160-171
Experiments on solving multiclass learning problems by n 2 -classifier....Pages 172-177
Combining classifiers by constructive induction....Pages 178-189
Boosting trees for cost-sensitive classifications....Pages 190-195
Naive bayesian classifier committees....Pages 196-207
Batch classifications with discrete finite mixtures....Pages 208-213
Induction of recursive program schemes....Pages 214-225
Predicate invention and learning from positive examples only....Pages 226-237
An inductive logic programming framework to learn a concept from ambiguous examples....Pages 238-249
First-order learning for Web mining....Pages 250-255
Explanation-based generalization in game playing: Quantitative results....Pages 256-267
Scope classification: An instance-based learning algorithm with a rule-based characterisation....Pages 268-279
Error-correcting output codes for local learners....Pages 280-291
Recursive lazy learning for modeling and control....Pages 292-303
Using lattice-based framework as a tool for feature extraction....Pages 304-309
Determining property relevance in concept formation by computing correlation between properties....Pages 310-315
A buffering strategy to avoid ordering effects in clustering....Pages 316-321
Coevolutionary, distributed search for inducing concept descriptions....Pages 322-333
Continuous mimetic evolution....Pages 334-345
A host-parasite genetic algorithm for asymmetric tasks....Pages 346-351
Speeding up Q(λ)-learning....Pages 352-363
Q-learning and redundancy reduction in classifier systems with internal state....Pages 364-369
Composing functions to speed up reinforcement learning in a changing world....Pages 370-381
Theoretical results on reinforcement learning with temporally abstract options....Pages 382-393
A general convergence method for Reinforcement Learning in the continuous case....Pages 394-405
Interpretable neural networks with BP-SOM....Pages 406-411
Convergence rate of minimization learning for neural networks....Pages 412-417