Citation-Key:
Nottelmann/Fuhr:01
Title:
Learning probabilistic Datalog rules for information classification and transformation
Author(s):
H. Nottelmann
N. Fuhr
In:
Citation-Key:
CIKM:01
Title:
Proceedings of the 10th International Conference on Information and Knowledge Management
Editor(s):
Henrique Paques
Ling Liu
David Grossman
Publisher:
ACM
In:
Proceedings of the 10th International Conference on Information and Knowledge Management
Year:
2001

BibTeX entry

Page(s):
387--394
Year:
2001

Abstract:
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 entry

Fulltext as PDF