Jump to content

Relational data mining

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tinucherian (talk | contribs) at 13:06, 25 September 2008 (General fixes and clean up using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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.

See also