Relational data mining

Relational data mining is a data mining technique for relational databases. Unlike traditional data mining algorithms, which look for patterns in a single table (propositional patterns), relational data mining algorithms look for patterns among multiple tables (relational patterns). For most types of propositional propatterns, there are corresponding relational patterns. For example, there are relational classification rules, relational regression trees, relational association rules, and so on.

The most important theoretical foundation of relational data mining is inductive logic programming.

A text book on relational data mining can be found at [1].

See also

• Database mining
• Structured data mining