Zitationsschlüssel:
Nottelmann/Fuhr:01
Titel:
Learning probabilistic Datalog rules for information classification and transformation
Autor(en):
H. Nottelmann
N. Fuhr
In:
Zitationsschlüssel:
CIKM:01
Titel:
Proceedings of the 10th International Conference on Information and Knowledge Management
Herausgeber:
Henrique Paques
Ling Liu
David Grossman
Verlag:
ACM
In:
Proceedings of the 10th International Conference on Information and Knowledge Management
Jahr:
2001

BibTeX-Eintrag

Seite(n):
387--394
Jahr:
2001

Zusammenfassung:
Probabilistic Datalog is a combination of classical Datalog (function-free Horn clause predicate logic) with probability theory. Therefore, probabilistic weights may be attached to both facts and rules. But it is often impossible to assign exact rule weights or even to construct the rules themselves. Instead of specifying them manually, learning algorithms can be used to learn both rules and weights. In practice, these algorithms are very slow because they need a large example set and have to test a high number of rules. We apply a number of extensions to these algorithms in order to improve efficiency. Several applications demonstrate the power of learning probabilistic Datalog rules, showing that learning rules is suitable for low dimensional problems (e.g., schema mapping) but inappropriate for higher dimensions like e.g. in text classification.

BibTeX-Eintrag

Volltext als PDF