ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
In this paper, we examine a method for feature subset selection based on Information Theory. Initially, a framework for de ning the theoretically optimal, but computationally intr...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
Autonomous mobile robots need good models of their environment, sensors and actuators to navigate reliably and efficiently. While this information can be supplied by humans, or le...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
In this paper, we describe two di erent learning tasks for relational structures. When learning a classi er for structures, the relational structures in the training sets are clas...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
We introduce a method for learning Bayesian networks that handles the discretization of continuous variables as an integral part of the learning process. The main ingredient in th...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
This paper discusses issues related to Bayesian network model learning for unbalanced binary classification tasks. In general, the primary focus of current research on Bayesian ne...
ICML
1996
IEEE
15 years 14 days ago
1996
IEEE
Some of the most successful recent applications of reinforcement learning have used neural networks and the TD algorithm to learn evaluation functions. In this paper, we examine t...