Abstract
Three companion systems, Claudien, ICL and Tilde, are presented. They use a common representation for examples and hypotheses: each example is represented by a relational database. This contrasts with the classical inductive logic programming systems such as Progol and Foil. It is argued that this representation is closer to attribute value learning and hence more natural. Furthermore, the three systems can be considered first order upgrades of typical data mining systems, which induce association rules, classification rules or decision trees respectively.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Agrawal, H. Mannila, R. Srikant, H. Toivonen, and A. Verkamo. Fast discovery of association rules. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 307–328. MIT Press, Cambridge, MA, 1996.
R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proceedings of the ACM SIGMOD Conference on Management of Data, pages 207–216. ACM Press, New York, 1993.
H. Blockeel. Tilde 1.3 User’s manual, 1997. http://www.cs.kuleuven.ac.be/~ml/Tilde/.
H. Blockeel. Top-down induction of first order logical decision trees. PhD thesis, Department of Computer Science, Katholieke Universiteit, Leuven, 1998. http://www.cs.kuleuven.ac.be/~ml/PS/blockee198:phd.ps.gz.
H. Blockeel and L. De Raedt. Lookahead and discretization in ILP. In Proceedings of the Seventh International Workshop on Inductive Logic Programming, pages 77–85. Springer, Berlin, 1997.
H. Blockeel and L. De Raedt. Top-down induction of first order logical decision trees. Artificial Intelligence, 101(1–2): 285–297, 1998.
M. Bongard. Pattern Recognition. Spartan Books, 1970.
I. Bratko and S. Muggleton. Applications of inductive logic programming. Communications of the ACM, 38 (11): 65–70, 1995.
P. Clark and R. Boswell. Rule induction with CN2: Some recent improvements. In Proceedings of the Fifth European Working Session on Learning, pages 151–163. Springer, Berlin, 1991.
P. Clark and T. Niblett. The CN2 algorithm. Machine Learning, 3(4): 261–284, 1989.
L. De Raedt. Logical settings for concept learning. Artificial Intelligence, 95: 187–201, 1997.
L. De Raedt and M. Bruynooghe. A theory of clausal discovery. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pages 1058–1063. Morgan Kaufmann, San Mateo, CA, 1993.
L. De Raedt and L. Dehaspe. Clausal discovery. Machine Learning, 26: 99–146, 1997.
L. De Raedt and W. Van Laer. Inductive constraint logic. In Proceedings of the Sixth International Workshop on Algorithmic Learning Theory, pages 80–94. Springer, Berlin, 1995.
L. Dehaspe and L. De Raedt. Mining a natural language corpus for multirelational association rules. In ECML’97 — Workshop Notes on Empirical Learning of Natural Language Processing Tasks, pages 35–48. Laboratory of Intelligent Systems, Faculty of Informatics and Statistics, University of Economics, Prague, Czech Republic, 1997.
L. Dehaspe and L. De Raedt. Mining association rules in multiple relations. In Proceedings of the Seventh International Workshop on Inductive Logic Programming, pages 125–132. Springer, Berlin, 1997.
L. Dehaspe, L.De Raedt, and W. Van Laer. Claudien — a clausal discovery engine: A user manual. Technical Report CW-239, Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 1996.
S. Džeroski, N. Jacobs, M. Molina, C. Moure, S. Muggleton, and W. Van Laer. Detecting traffic problems with ILP. In Proceedings of the Eighth International Conference on Inductive Logic Programming, pages 281–290. Springer, Berlin, 1998.
R. S. Michalski. A theory and methodology of inductive learning. In R. S. Michalski, J. Carbonell, and T. Mitchell, editors, Machine Learning: An Artificial Intelligence Approach, pages 83–134. Morgan Kaufmann, San Mateo, CA, 1983.
S. Muggleton. Inverse entailment and Progol. New Generation Computing, Special issue on Inductive Logic Programming, 13(3–4): 245–286, 1995.
J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo, CA, 1993.
J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5: 239–266, 1990.
A. Srinivasan, S. Muggleton, M. J. E. Sternberg, and R. D. King. Theories for mutagenicity: A study in first-order and feature-based induction. Artificial Intelligence, 85(1,2): 277–299, 1996.
H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hätönen, and H. Mannila. Pruning and grouping discovered association rules. In Proceedings of the MLnet Familiarization Workshop on Statistics, Machine Learning and Knowledge Discovery in Databases, pages 47–52. FORTH, Heraklion, Greece, 1995.
W. Van Laer. Web pages for the ICL system, 1997. http://www.cs.kuleuven.ac.be/~ml/ICL/.
W. Van Laer, L. De Raedt, and S. Džeroski. On multi-class problems and discretization in inductive logic programming. In Proceedings of the Tenth International Symposium on Methodologies for Intelligent Systems, pages 277–286. Springer, Berlin, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
De Raedt, L., Blockeel, H., Dehaspe, L., Van Laer, W. (2001). Three Companions for Data Mining in First Order Logic. In: Džeroski, S., Lavrač, N. (eds) Relational Data Mining. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-04599-2_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-04599-2_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-07604-6
Online ISBN: 978-3-662-04599-2
eBook Packages: Springer Book Archive