Mining Relational Model Trees
Description
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.
| Slides | |
| 0:01 | Mining Relational Model Trees |
| 0:45 | Regression problem in classical data mining |
| 1:46 | Regression trees and model trees |
| 2:53 | Model trees: state of the art |
| 3:50 | Model trees: state of the art |
| 5:29 | Two types of nodes |
| 7:11 | What is passed down? |
| 9:17 | An example of model tree |
| 10:18 | Building a regression model stepwise: some tricks |
| 12:31 | The global effect of regression nodes |
| 14:32 | Advantages of the proposed tree structure |
| 15:33 | Evaluating splitting and regression nodes |
| 18:23 | Filtering useless splitting nodes |
| 19:10 | Stopping criteria |
| 21:33 | Related works … and problems |
| 22:32 | Related works … and problems |
| 23:32 | Related works … and problems |
| 24:44 | Related works … and problems |
| 25:31 | Computational complexity |
| 26:25 | Empirical evaluation |
| 27:17 | …Empirical evaluation on laboratory-sized data… |
| 34:15 | …Empirical evaluation on laboratory-sized data |
| 35:04 | … Empirical Evaluation on UCI data… |
| 37:18 | … Empirical Evaluation on UCI data. |
| 38:47 | SMOTI: open issues |
| 40:09 | From classical to relational data mining |
| 41:16 | Multi-relational representation |
| 41:58 | Regression Problem in relational data mining |
| 43:14 | How to work with (multi-)relational data? |
| 47:40 | Strengths and Weaknesses of current multi-relational regression methods |
| 49:34 | Global/local effect+ multi-relational model =Mr-SMOTI |
| 51:39 | What is a regression selection graph? |
| 53:04 | Relational splitting nodes |
| 54:35 | Relational splitting nodes |
| 55:45 | Relational splitting nodes |
| 56:47 | Relational splitting nodes with look-ahead |
| 57:56 | Relational regression nodes |
| 58:20 | Relational model trees: an example |
| 60:18 | How to choose the best relational node? |
| 60:55 | Evaluating relational splitting node |
| 62:05 | Evaluating relational regression node |
| 62:24 | Stopping criteria |
| 62:57 | Mr-SMOTI: some details |
| 63:05 | Empirical evaluation on laboratory-sized data |
| 63:24 | Empirical evaluation on laboratory-sized data |
| 65:47 | Empirical evaluation on laboratory-sized data |
| 66:30 | Empirical evaluation on laboratory-sized data |
| 66:33 | Empirical evaluation on real data |
| 69:36 | Improving efficency |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
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.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





