This paper examines the induction of classification rules from examples using real-world data. Real-world data is almost always characterized by two features, which are important ...
This paper describes a new methodfor inducing logic programs from examples which attempts to integrate the best aspects of existingILP methodsintoa singlecoherent framework. In pa...
John M. Zelle, Raymond J. Mooney, Joshua B. Konvis...
Compositional Q-Learning (CQ-L) (Singh 1992) is a modular approach to learning to performcomposite tasks made up of several elemental tasks by reinforcement learning. Skills acqui...
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
Reinforcement learning (RL) algorithms provide a sound theoretical basis for building learning control architectures for embedded agents. Unfortunately all of the theory and much ...
Satinder P. Singh, Tommi Jaakkola, Michael I. Jord...
Conservation of information (COI) popularized by the no free lunch theorem is a great leveler of search algorithms, showing that on average no search outperforms any other. Yet in ...
This paper presents an approach to automatic discovery of functions in Genetic Programming. The approach is based on discovery of useful building blocks by analyzing the evolution...
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
Michael J. Pazzani, Christopher J. Merz, Patrick M...