On monotone data mining languages
We present a simple Data Mining Logic (DML) that can express common data mining tasks, like "Find Boolean association rules" or "Find inclusion dependencies." At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strateg...
| Main Authors: | , |
|---|---|
| Language: | English |
| Published: |
Springer
2002
|
| Subjects: | |
| Online Access: | http://repository.tue.nl/659644 |
| Summary: | We present a simple Data Mining Logic (DML) that can express common data mining tasks, like "Find Boolean association rules" or "Find inclusion dependencies." At the center of the paper is the problem of characterizing DML queries that are amenable to the levelwise search strategy used in the a-priori algorithm. We relate the problem to that of characterizing monotone first-order properties for finite models. |
|---|