On monotone data mining languages

T. Calders, J. Wijsen

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

Abstract

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.
Original languageEnglish
Title of host publicationDatabase programming languages : 8th international workshop, DBPL-8, Frascati, Italy, september 8-10, 2001, revised papers
EditorsG. Ghelli, G. Grahne
Place of PublicationBerlin
PublisherSpringer
Pages119-132
ISBN (Print)3-540-44080-1
DOIs
Publication statusPublished - 2002

Publication series

NameLecture Notes in Computer Science
Volume2397
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'On monotone data mining languages'. Together they form a unique fingerprint.

Cite this