Relational data mining
Knowledge discovery in databases gets a lot of attention for several reasons since it became known that it is possible to discover patterns in large, historical collections of data. These patterns can be associated with a meaning; The meaning can be interpreted for marketing goals, for example. The activity of finding these patterns in databases is called data mining. The resulting patterns can be characterized as valid, novel, potentially useful, and ultimately understandable. The techniques of data mining have their roots in logic programming. Because the disciplines of logic programming and database technology are intersectioned only for limited goals such as deductive and statistical databases, traditionally, it is very important to describe the intersection for data mining carefully. The presented book Relational Data Mining is doing this. The authors are well known researchers in the field. The foreword of the book, written by Heikki Mannila, characterizes it as ``a thorough overview of different techniques and strategies used in knowledge discovery in multirelational data. The chapters describe a broad selection of practical inductive logic programming approaches to relational data mining and give a good overview of several interesting applications. Multi-relational data means relational databases with more than one relation in comparison to one of the most common traditional data mining techniques, which is based on organizing the data in one (very large) table. This table is interpreted as a matrix. The given characterization of the book expresses also the opinion of the reviewer. The book is recommended warmly to students of computer science and mathematics and practitioners who have to deal with data mining in relational data bases. The book is partitioned into four parts. Part I, Introduction, with the following contributions: Data mining in a nutshell, Knowledge discovery in databases: An overview, An introduction to inductive logic programming, Inductive logic programming for knowledge discovery in databases. Part II, Techniques, with the following contributions: Three companions for data mining in first-order logic, Inducing classification and regression trees in first-order logic, Relational rule induction with CPROLOG4.4: A tutorial introduction, Discovery of relational association rules, Distance based approaches to relational learning and clustering. Part III, From propositional to relational data mining, with the following contributions: How to upgrade propositional learners to first-order logic: A case study, Propositionalization approaches to relational data mining, Relational learning and boosting, Learning probabilistic relational models. Part IV, Applications and Web resources, with the following contributions: Relational data mining applications: An overview, Four suggestions and a rule concerning the application of ILP, Internet resources on ILP for KDD.
- The GUHA method and its meaning for data mining
- A multistrategy approach to relational knowledge discovery in databases
- Parallel algorithms for enumerating closed patterns from multi-relational data
- A comparison of pruning criteria for probability trees
- Model-based exception mining for object-relational data
- Incorporating symbolic domain knowledge into graph neural networks
- Relational data imputation with quality guarantee
- Propositionalization and embeddings: two sides of the same coin
- Some thoughts on knowledge-enhanced machine learning
- A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics
- Lifted graphical models: a survey
- An empirical study of on-line models for relational data streams
- Description and classification of complex structured objects by applying similarity measures
- Probabilistic and exact frequent subtree mining in graphs beyond forests
- Association discovery from relational data via granular computing
- Frequency-based views to pattern collections
- Propositionalization-based relational subgroup discovery with RSD
- Relational knowledge discovery.
- Mining chains of relations
- On the need for structure modelling in sequence prediction
- Relational and semantic data mining (invited talk)
- Logical and Relational Learning
- From Inductive Logic Programming to Relational Data Mining
- Top-Down Induction of Relational Model Trees in Multi-instance Learning
- Relational concept analysis: mining concept lattices from multi-relational data
- Using trees to mine multirelational databases
- Effective feature construction by maximum common subgraph sampling
- ILP turns 20. Biography and future challenges
- scientific article; zbMATH DE number 1934562 (Why is no real title available?)
- scientific article; zbMATH DE number 1943770 (Why is no real title available?)
- scientific article; zbMATH DE number 1950786 (Why is no real title available?)
- scientific article; zbMATH DE number 1953888 (Why is no real title available?)
- scientific article; zbMATH DE number 1954098 (Why is no real title available?)
- scientific article; zbMATH DE number 1927380 (Why is no real title available?)
- scientific article; zbMATH DE number 1755710 (Why is no real title available?)
- NetSDM: semantic data mining with network analysis
- kLog: a language for logical and relational learning with kernels
- scientific article; zbMATH DE number 2085219 (Why is no real title available?)
- scientific article; zbMATH DE number 1897911 (Why is no real title available?)
- Improving the time efficiency of ILP-based multi-relational concept discovery with dynamic programming approach
- scientific article; zbMATH DE number 1420798 (Why is no real title available?)
- On Tackling Explanation Redundancy in Decision Trees
- Relational association rules and error detection
- scientific article; zbMATH DE number 6026985 (Why is no real title available?)
- scientific article; zbMATH DE number 6027037 (Why is no real title available?)
- Multi-relational data mining.
- Multi-relational model tree induction tightly-coupled with a relational database
- Probabilistic Inductive Logic Programming
- CLP( $\cal{BN}$ ): Constraint Logic Programming for Probabilistic Knowledge
- Inductive Logic Programming
- Relational and Kleene-Algebraic Methods in Computer Science
- scientific article; zbMATH DE number 2241911 (Why is no real title available?)
- Inducing multi-level association rules from multiple relations
- Inducing multi-level association rules from multiple relations
- A differentiable first-order rule learner for inductive logic programming
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
- Ranking relations using analogies in biological and information networks
This page was built for publication: Relational data mining
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2743233)
