Abstract
Multi-relational data mining (MRDM) is a form of data mining operating on data stored in multiple database tables. While machine learning and data mining are traditionally concerned with learning from single tables, MRDM is required in domains where the data are highly structured. One approach to MRDM is to use a predicate-logical language like clausal logic or Prolog to represent and reason about structured objects, an approach which came to be known as inductive logic programming (ILP) [18],[19],[15],[16],[13],[17],[2],[5].
In this talk I will review recent developments that have led from ILP to the broader field of MRDM. Briefly, these developments include the following: - the use of other declarative languages, including functional and higher-order languages, to represent data and learned knowledge [9],[6],[1]; - a better understanding of knowledge representation issues, and the importance of data modelling in MRDM tasks [7],[11]; - a better understanding of the relation between MRDM and standard single- table learning, and how to upgrade single-table methods to MRDM or downgrade MRDM tasks to single-table ones (propositionalisation) [3],[12],[10],[14]; - the study of non-classificatory learning tasks, such as subgroup discovery and multi-relational association rule mining [8],[4],[21]; - the incorporation of ROC analysis and cost-sensitive classification [20].
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
A. F. Bowers, C. Giraud-Carrier, and J.W. Lloyd. Classification of individuals with complex structure. In Proceedings of the 17th International Conference on Machine Learning, pages 81–88. Morgan Kaufmann, June 2000.
L. De Raedt, editor. Advances in Inductive Logic Programming. IOS Press, 1996.
L. De Raedt. Attribute value learning versus inductive logic programming: The missing links (extended abstract). In D. Page, editor, Proceedings of the 8th International Conference on Inductive Logic Programming, volume 1446 of Lecture Notes in Artificial Intelligence, pages 1–8. Springer-Verlag, 1998.
Luc Dehaspe and Hannu Toivonen. Discovery of relational association rules. In Saso Dzeroski and Nada Lavrac, editors, Relational Data Mining, pages 189–212. Springer-Verlag, September 2001.
Saso Dzeroski and Nada Lavrac, editors. Relational Data Mining. Springer-Verlag, Berlin, September 2001.
P.A. Flach, C. Giraud-Carrier, and J.W. Lloyd. Strongly typed inductive concept learning. In D. Page, editor, Proceedings of the 8th International Conference on Inductive Logic Programming, volume 1446 of Lecture Notes in Artificial Intelligence, pages 185–194. Springer-Verlag, 1998.
Peter A. Flach. Knowledge representation for inductive learning. In Anthony Hunter and Simon Parsons, editors, Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU’99), volume 1638 of Lecture Notes in Artificial Intelligence, pages 160–167. Springer-Verlag, July 1999.
Peter A. Flach and Nicolas Lachiche. Confirmation-guided discovery of first-order rules with tertius. Machine Learning, 42(1/2):61–95, January 2001.
J. Hernández-Orallo and M.J. Ramírez-Quintana. A strong complete schema for inductive functional logic programming. In S. Džeroski and P. Flach, editors, Proceedings of the 9th International Workshop on Inductive Logic Programming, volume 1634 of Lecture Notes in Artificial Intelligence, pages 116–127. Springer-Verlag, 1999.
Stefan Kramer, Nada Lavrac, and Peter Flach. Propositionalization approaches to relational data mining. In Saso Dzeroski and Nada Lavrac, editors, Relational Data Mining, pages 262–291. Springer-Verlag, September 2001.
Nicolas Lachiche and Peter Flach. A first-order representation for knowledge discovery and bayesian classification on relational data. In Pavel Brazdil and Alipio Jorge, editors, PKDD2000 workshop on Data Mining, Decision Support, Meta-learning and ILP: Forum for Practical Problem Presentation and Prospective Solutions, pages 49–60. 4th International Conference on Principles of Data Mining and Knowledge Discovery, September 2000.
Wim Van Laer and Luc De Raedt. How to upgrade propositional learners to first order logic: A case study. In Saso Dzeroski and Nada Lavrac, editors, Relational Data Mining, pages 235–261. Springer-Verlag, September 2001.
N. Lavrač and S. Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.
Nada Lavrač and Peter A. Flach. An extended transformation approach to inductive logic programming. ACM Transactions on Computational Logic, 2(4):458–494, October 2001.
S. Muggleton. Inductive logic programming. New Generation Computing, 8(4):295–317, 1991.
S. Muggleton, editor. Inductive Logic Programming. Academic Press, 1992.
S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19/20:629–679, 1994.
G.D. Plotkin. Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University, 1971.
E.Y. Shapiro. Algorithmic Program Debugging. The MIT Press, 1983.
Ashwin Srinivasan. Context-sensitive models in inductive logic programming. Machine Learning, 43(3):301–324, September 2001.
Stefan Wrobel. Inductive logic programming for knowledge discovery in databases. In Saso Dzeroski and Nada Lavrac, editors, Relational Data Mining, pages 74–101. Springer-Verlag, September 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Flach, P.A. (2001). Multi-relational Data Mining: A Perspective. In: Brazdil, P., Jorge, A. (eds) Progress in Artificial Intelligence. EPIA 2001. Lecture Notes in Computer Science(), vol 2258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45329-6_2
Download citation
DOI: https://doi.org/10.1007/3-540-45329-6_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43030-8
Online ISBN: 978-3-540-45329-1
eBook Packages: Springer Book Archive