Abstract
We introduce type extension trees as a formal representation language for complex combinatorial features of relational data. Based on a very simple syntax this language provides a unified framework for expressing features as diverse as embedded
subgraphs on the one hand, and marginal counts of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant
function.
subgraphs on the one hand, and marginal counts of attribute values on the other. We show by various examples how many existing relational data mining techniques can be expressed as the problem of constructing a type extension tree and a discriminant
function.
| Originalsprog | Engelsk |
|---|---|
| Titel | Proceedings of the International Workshop on Mining and Learning with Graphs : in conjunction with ECML/PKDD 2006 |
| Antal sider | 12 |
| Publikationsdato | 2006 |
| Sider | 49-60 |
| Status | Udgivet - 2006 |
| Begivenhed | International Workshop on Mining and Learning with Graphs - Berlin, Tyskland Varighed: 19 maj 2010 → … |
Konference
| Konference | International Workshop on Mining and Learning with Graphs |
|---|---|
| Land/Område | Tyskland |
| By | Berlin |
| Periode | 19/05/2010 → … |