Science is a seamless web: each idea spins out to a new research task, and each research finding suggests a repair or an elaboration of the network o… - Pat Langley

In recent years, researchers have made considerable progress on the of inductive learning tasks, but for theoretical results to have impact on practice, they must deal with the average case. In this paper we present an average-case analysis of a simple algorithm that induces one-level decision trees for concepts defined by a single relevant attribute. Given knowledge about the number of training instances, the number of irrelevant attributes, the amount of class and attribute noise, and the class and attribute distributions, we derive the expected classification accuracy over the entire instance space. We then examine the predictions of this analysis for different settings of these domain parameters, comparing them to experimental results to check our reasoning.

As aims to address larger, more complex tasks, the problem of focusing on the most relevant information in a potentially overwhelming quantity of data has become increasingly important.

BACON.4 does not have heuristics for considering trigonometric functions of variables directly . Thus, in the run described here we simply told the system to examine the sines. In the following chapter we will see how BACON can actually arrive at the sine term on its own in a rather subtle manner.