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.
|Title of host publication||Database programming languages : 8th international workshop, DBPL-8, Frascati, Italy, september 8-10, 2001, revised papers|
|Editors||G. Ghelli, G. Grahne|
|Place of Publication||Berlin|
|Publication status||Published - 2002|
|Name||Lecture Notes in Computer Science|