Slide 9

9
MACHINE LEARNING:
SYMBOL-BASED
9.0 Introduction 9.5 Knowledge and Learning
9.1 A Framework for Symbol-based 9.6 Unsupervised Learning
Learning
9.7 Reinforcement Learning
9.2 Version Space Search
9.8 Epilogue and References
9.3 The ID3 Decision Tree Induction
9.9 Exercises
Algorithm
9.4 Inductive Bias and Learnability
 Slide 9
Table 9.1: Data from credit history of loan applications.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Figure 9.13: A decision tree for credit risk assessment.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Figure 9.14: A simplified decision tree for credit risk assessment.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
The induction algorithm begins with a sample of correctly classified members
of the target categories. ID3 constructs a decision tree according to the
algorithm:

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Figure 9.15: A partially constructed decision tree.

Figure 9.16: Another partially constructed decision tree.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Table 9.2: The evaluation of ID3

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Figure 9.17: Specific and generalized proof that an object, X, is a cup.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9
Figure 9.18: An explanation structure of the cup example.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1
Figure 9.19: An analogical mapping.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1
Figure 9.20: The steps of a CLUSTER/2 run.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1

Figure 9.21: A COBWEB clustering for four one-celled

organisms, adapted from Gennari et al.
(1989).
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1
A COBWEB algorithm is defined:

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1
Figure 9.22: Merging and splitting of nodes.

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Figure 9.23: A sequence of tic-tac-toe for moves.
Dashed arrows indicate possible move
choices, down solid arrows indicate
A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger

selected moves, up solid arrows

indicate reward, when reward function
changes state’s value.
© 2002 Addison Wes
Slide 9.1
 Slide 9.1
Figure 9.24: Backup diagrams for (a) V* and (b) Q*, adapted from Sutton and
Barto (1998).

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes
 Slide 9.1
Figure 9.25: A step.

Figure 9.26 An example of a 4 x 4 grid world, adapted from Sutton and Barto
(1998).

A R T I F I C I A L I N T E L L I G E N C E: Structure and Strategies for Complex Problem Solving, 4th Edition George F. Luger © 2002 Addison Wes