anytime algorithms for learning anytime classifiers saher ... - Technion

Technion - Computer Science Department - Ph.D. Thesis PHD-2008-12 - 2008
LSID3 Tree Size / ID3 Tree Size
LSID3 Accuracy
1
0.8
0.6
0.4
0.2
0
100
90
80
70
60
50
AutoM
AutoS
Balance
Breast
Connect
Corral
Glass
Iris
Monk1
Monk3
Mushr
Solar
Tic
Voting
Wine
Zoo
XOR3D
XOR4D
MUX20
MUXOR
XOR5
XOR5N
XOR10
Monk2
(a)
40
40 50 60 70 80 90 100
ID3 Accuracy
(b)
Figure 3.20: Performance differences between LSID3(5) and ID3. The upper figure
gives the relative size of the trees produced by LSID3 in comparison to ID3. The
lower figure plots the accuracy achieved by both algorithms. Each point represents a
dataset. The x-axis represents the accuracy of ID3 while the y-axis represents that
of LSID3. The dashed line indicates equality. Points are above it if LSID3 performs
better and below it if ID3 is better.
Consistent Trees
Figure 3.20 illustrates the differences in tree size and generalization accuracy of
LSID3(5) and ID3. Figure 3.21 compares the performance of LSID3 to that of
ID3-k. The full results, including significance tests, are available in Tables 3.3-3.6.
Table 3.3 shows the size of the trees induced by the above mentioned algorithms,
while Table 3.4 lists the differences between the algorithms and states whether
47