Multi-relational data mining
Author:
Open Access
- 1 July 2003
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGKDD Explorations Newsletter
- Vol. 5 (1) , 1-16
Abstract
Data mining algorithms look for patterns in data. While most existing data mining approaches look for patterns in a single data table, multi-relational data mining (MRDM) approaches look for patterns that involve multiple tables (relations) from a relational database. In recent years, the most common types of patterns and approaches considered in data mining have been extended to the multi-relational case and MRDM now encompasses multi-relational (MR) association rule discovery, MR decision trees and MR distance-based methods, among others. MRDM approaches have been successfully applied to a number of problems in a variety of areas, most notably in the area of bioinformatics. This article provides a brief introduction to MRDM, while the remainder of this special issue treats in detail advanced research topics at the frontiers of MRDM.Keywords
This publication has 19 references indexed in Scilit:
- Three Companions for Data Mining in First Order Logic2001
- Inductive Logic Programming for Knowledge Discovery in Databases2001
- Relational Data Mining Applications: An Overview2001
- Propositionalization Approaches to Relational Data Mining2001
- How to Upgrade Propositional Learners to First Order Logic: A Case Study2001
- Diterpene structure elucidation from 13cnmr spectra with inductive logic programmingApplied Artificial Intelligence, 1998
- Inverse entailment and progolNew Generation Computing, 1995
- First-order jk-clausal theories are PAC-learnableArtificial Intelligence, 1994
- Inductive logic programmingNew Generation Computing, 1991
- Generalized subsumption and its applications to induction and redundancyArtificial Intelligence, 1988