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...

Full description

Bibliographic Details
Main Authors: Calders, T., Wijsen, J.
Other Authors: Ghelli, G., Grahne, G.
Format: Other Non-Article Part of Journal/Newspaper
Language:English
Published: Springer 2002
Subjects:
DML
Online Access:https://research.tue.nl/en/publications/9963d2df-0ef4-4a27-a9ee-720f65998065
https://doi.org/10.1007/3-540-46093-4_7
Description
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.

Similar Items