17 Mar 2004
CS 3243 - Learning
35
Using information theory
n
To implement
Choose-Attribute
in the
DTL algorithm
n
Entropy:
n
I(P(v
1
), … , P(v
n
)) =
Σ
i=1
-P(v
i
) log
2
P(v
i
)
n
For a training set containing
p
positive
examples and
n
negative examples:
n