Jump to content

Relational data mining

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 178.17.4.37 (talk) at 09:33, 7 June 2014 (Added alternative approaches beyond ILP). 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 patterns, there are corresponding relational patterns. For example, there are relational classification rules, relational regression tree, relational association rules, and so on.

There are several approaches to relational data mining. The oldest one is inductive logic programming, in short ILP. Other possible approaches are:

  1. Statistical relational learning (SRL)
  2. Graph Mining
  3. Propositionalization
  4. Multi-view learning

See also