Discretization Numerical Data for Relational Data with One-to-Many Relations

Most multi-relational data mining deals with nominal or symbolic values, often in the context of structural or graph-based mining (e.g., Inductive Logic Programming (ILP)). Much less attention has been given to the area of discretization of continuous attributes in a relational database, where the issue of one-to-many association between records has to be taken into account. Continuous attributes in multi-relational data mining are seldom used due to the difficulties in handling them particularly when the authors have a one-to-many association in a relational database.

Provided by: Science Publications Topic: Data Management Date Added: Jul 2009 Format: PDF

Find By Topic