Foil-Gain
- We select the literal with biggest gain
\[
\text{Foil-Gain}(L,R) \equiv t \left( \log_{2}\frac{p_{1}}{p_{1}+n_{1}} - \log_{2}\frac{p_{0}}{p_{0}+n_{0}} \right) \]
Where
- $L$ is the candidate literal to add to rule $R$
- $p_0$ = number of positive bindings of $R$
- $n_0$ = number of negative bindings of $R$
- $p_1$ = number of positive bindings of $R+L$
- $n_1$ = number of negative bindings of $R+L$
- $t$ is the number of positive bindings of $R$ also covered by $R+L$
- It's interesting to note that
$-\log_{2}\frac{p_{0}}{p_{0}+n_{0}}$ is the optimal number of
bits needed to indicate the class of a positive binding
covered by $R$
José M. Vidal
.
31 of 47