Relational data mining
Encyclopedia
Relational data mining is the data mining
Data mining
Data mining , a relatively young and interdisciplinary field of computer science is the process of discovering new patterns from large data sets involving methods at the intersection of artificial intelligence, machine learning, statistics and database systems...

 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 rule
Classification rule
Given a population whose members can be potentially separated into a number of different sets or classes, a classification rule is a procedure in which the elements of the population set are each assigned to one of the classes. A perfect test is such that every element in the population is assigned...

s, relational regression tree
Decision tree learning
Decision tree learning, used in statistics, data mining and machine learning, uses a decision tree as a predictive model which maps observations about an item to conclusions about the item's target value. More descriptive names for such tree models are classification trees or regression trees...

,
relational association rules, and so on.

The most important theoretical foundation of relational data mining is
inductive logic programming
Inductive logic programming
Inductive logic programming is a subfield of machine learning which uses logic programming as a uniform representation for examples, background knowledge and hypotheses...

.

External links

The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK