Abstract
A novel query language for database mining, called RDM, is presented. RDM provides primitives for discovering frequent patterns and association rules, for manipulating example sets, for performing predictive and descriptive induction and for reasoning about the generality of hypotheses. RDM is designed for querying deductive databases and employs principles from inductive logic programming. Therefore RDM allows to query patterns that involve multiple relations as well as background knowledge. The embedding of RDM within a programming language such as PROLOG puts database mining on similar grounds as constraint programming. An operational semantics for RDM is outlined and an efficient algorithm for solving RDM queries is presented. This solver integrates Mitchell’s versionspace approach with the well-known APRIORI algorithm by Agrawal et al.
An early extended abstract of this paper appeared as part of [7]. The present paper expands signi?cantly on this work. The work was also presented at the JICSLPWorkshop in Manchester 1998, and the German Machine Learning Workshop, Magdeburg, 1999.
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, T. Imielinski, A. Swami. Mining association rules between sets of items in large databases. In Proceedings of ACM SIGMOD Conference on Management of Data, 1993.
J-F. Boulicaut, M. Klemettinen, H. Mannila. Querying inductive databases: a case study on the MINE RULE operator. in: Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, Lecture Notes in Arti.cial Intelligence, Vol. 1510, Springer-Verlag, 1998. in Proceedings of PKDD 98, Lecture Notes in AI, 1998.
I. Bratko. Prolog Programming for Artificial Intelligence. Addison-Wesley, 1990. 2nd Edition.
L. Dehaspe and L. De Raedt, WARMR: Wanted Association Rules over Multiple Relations, In Proceedings of the International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence, Vol. 1297, Springer Verlag, 1997.
L. Dehaspe, H. Toivonen and R.D. King. Finding frequent substructures in chemical compounds, in Proceedings of KDD-98, 1998.
L. Dehaspe, H. Toivonen. Discovery of Frequent Datalog Patterns, in Data Mining and Knowledge Discovery, Vol. 3, 1999.
L. DeRaedt, An inductive logic programming query language for database mining (Extended Abstract), in Calmet, J. and Plaza, J. (Eds.) Proceedings of Artificial Intelligence and Symbolic Computation, Lecture Notes in Artificial Intelligence, Vol. 1476, Springer Verlag, 1998.
L. De Raedt and L. Dehaspe. Clausal discovery. Machine Learning, 26:99–146, 1997.
Elmasri, R. and Navathe, S. Fundamentals of database systems. Benjamin Cummings, 2nd Edition, 1994.
Fayyad, U., Piatetsky-Shapiro, G. and Smyth, P. Advances in Knowledge Discovery, The MIT Press, 1996.
T. Imielinski and H. Mannila. A database perspectivce on knowledge discovery. Communications of the ACM, 39(11):58–64, 1996.
T. Imielinski, A. Virmani, and A. Abdulghani. A discovery board application programming interface and query language for database mining. In Proceedings of KDD 96. AAAI Press, 1996.
N. Lavrač and S. Džeroski. Inductive Logic Programming: Techniques and Applications. Ellis Horwood, 1994.
H. Mannila and H. Toivonen, Levelwise search and borders of theories in knowledge discovery, Data Mining and Knowledge Discovery, Vol. 1, 1997.
H. Mannila. Inductive databases. in Proceedings of the International Logic Programming Symposium, MIT Press, 1997.
Marriott, K. and Stuckey, P. J. Programming with constraints: an introduction. The MIT Press. 1998.
R. Meo, G. Psaila and S. Ceri, An extension to SQL for mining association rules. Data Mining and Knowledge Discovery, Vol. 2, 1998.
C. Mellish. The description identi.cation algorithm. Artificial Intelligence, Vol. 52, 1990.
T. Mitchell. Generalization as Search, Artificial Intelligence, Vol. 18, 1980.
S. Muggleton and L. DeRaedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19,20:629–679, 1994.
G. Plotkin, A note on inductive generalization, Machine Intelligence, Vol. 3, 1970.
J.R. Quinlan. Learning logical definitions from relations. Machine Learning, 5:239–266, 1990.
W. Shen, K. Ong, B. Mitbander, and C. Zaniolo. Metaqueries for data mining. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pages 375–398. The MIT Press, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
De Raedt, L. (2000). A Logical Database Mining Query Language. In: Cussens, J., Frisch, A. (eds) Inductive Logic Programming. ILP 2000. Lecture Notes in Computer Science(), vol 1866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44960-4_5
Download citation
DOI: https://doi.org/10.1007/3-540-44960-4_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67795-6
Online ISBN: 978-3-540-44960-7
eBook Packages: Springer Book Archive