Mining Relational Model Trees

author: Annalisa Appice, University of Bari
published: Feb. 25, 2007,   recorded: January 2007,   views: 6334


Related Open Educational Resources

Related content

Report a problem or upload files

If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Lecture popularity: You need to login to cast your vote.


Multi-Relational Data Mining (MRDM) refers to the process of discovering implicit, previously unknown and potentially useful information from data scattered in multiple tables of a relational database. MRDM is necessary to face the substantial complexity added to data mining tasks when properties of units of analysis to be investigated are potentially affected by attributes of related units of analysis eventually of different types and naturally modeled to yield as many tables as the number of object types. Regression is a fundamental task in MRDM where the goal is to examine samples of past experience with known continuous answers (response) and generalize future cases throughan inductive process. Following the mainstream of MRDM research, Mr-SMOTI resorts to the structural approach in order to recursively partition data stored in a tightly-coupled database and build a multi-relational model tree that captures the linear dependence between the response variable and one or more explanatory variables of both the reference objects and task-relevant objects. The model tree is top-down induced by choosing, at each step, either to partition the training space (split nodes) or to introduce a regression variable in the linear models to be associated with the leaves (regression nodes). Internal regression nodes contribute to the definition of multiple models and capture global effects, while straight-line regressions with leaves capture only local effects. The tight-coupling with the database makes the knowledge on data structures (e.g., foreign keys) available free of charge to guide the search in the multi-relational pattern space.

See Also:

Download slides icon Download slides: solomon_appice_mrmt_01.ppt (916.0 KB)

Help icon Streaming Video Help

Link this page

Would you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !

Write your own review or comment:

make sure you have javascript enabled or clear this field: