|
Title
|
|
|
|
On monotone data mining languages
| |
|
Author
|
|
|
|
| |
|
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. |
| |
|
Language
|
|
|
|
English
| |
|
Source (journal)
|
|
|
|
Lecture notes in computer science. - Berlin, 1973, currens
| |
|
Publication
|
|
|
|
Berlin
:
2002
| |
|
ISSN
|
|
|
|
0302-9743
[print]
1611-3349
[online]
| |
|
DOI
|
|
|
|
10.1007/3-540-46093-4_7
| |
|
Volume/pages
|
|
|
|
2397
(2002)
, p. 119-132
| |
|
ISI
|
|
|
|
000181438100007
| |
|
Full text (Publisher's DOI)
|
|
|
|
| |
|