We introduce relational information gain, a refinement scoring function measur- ing the informativeness of newly introduced variables. The gain can be interpreted as a con- ditional entropy in a well-defined sense and can be efficiently approximately computed. In conjunction with simple greedy general-to-specific search algorithms such as FOIL, it yields an efficient and competitive algorithm in terms of predictive accuracy and compactness of the learned theory. In conjunction with the decision tree learner TILDE, it offers a benefi- cial alternative to lookahead, achieving similar performance while significantly reducing the number of evaluated literals.
Relational Information Gain
Passerini, Andrea
2011-01-01
Abstract
We introduce relational information gain, a refinement scoring function measur- ing the informativeness of newly introduced variables. The gain can be interpreted as a con- ditional entropy in a well-defined sense and can be efficiently approximately computed. In conjunction with simple greedy general-to-specific search algorithms such as FOIL, it yields an efficient and competitive algorithm in terms of predictive accuracy and compactness of the learned theory. In conjunction with the decision tree learner TILDE, it offers a benefi- cial alternative to lookahead, achieving similar performance while significantly reducing the number of evaluated literals.File | Dimensione | Formato | |
---|---|---|---|
mlj11.pdf
Solo gestori archivio
Tipologia:
Versione editoriale (Publisher’s layout)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
706.56 kB
Formato
Adobe PDF
|
706.56 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione