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.
CITATION STYLE
Calders, T., & Wijsen, J. (2002). On monotone data mining languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2397, pp. 119–132). Springer Verlag. https://doi.org/10.1007/3-540-46093-4_7
Mendeley helps you to discover research relevant for your work.