Relational data mining

From Wikipedia, the free encyclopedia

Relational data mining is the 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.

[edit] See also

• Data mining
• Database mining
• Structured data mining

[edit] External links

• Web page for a text book on relational data mining