On monotone data mining languages
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 sear...
Main Authors: | , |
---|---|
Format: | Article in Journal/Newspaper |
Language: | English |
Published: |
2002
|
Subjects: | |
Online Access: | https://hdl.handle.net/10067/1041620151162165141 |
id |
ftunivantwerpen:c:irua:104162 |
---|---|
record_format |
openpolar |
spelling |
ftunivantwerpen:c:irua:104162 2023-07-16T03:58:08+02:00 On monotone data mining languages Calders, Toon Wijsen, J. 2002 https://hdl.handle.net/10067/1041620151162165141 eng eng info:eu-repo/semantics/altIdentifier/isi/000181438100007 info:eu-repo/semantics/altIdentifier/doi/10.1007/3-540-46093-4_7 info:eu-repo/semantics/closedAccess 0302-9743 Lecture notes in computer science Computer. Automation info:eu-repo/semantics/article 2002 ftunivantwerpen https://doi.org/10.1007/3-540-46093-4_7 2023-06-26T22:16:24Z 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. Article in Journal/Newspaper DML IRUA - Institutional Repository van de Universiteit Antwerpen 119 132 |
institution |
Open Polar |
collection |
IRUA - Institutional Repository van de Universiteit Antwerpen |
op_collection_id |
ftunivantwerpen |
language |
English |
topic |
Computer. Automation |
spellingShingle |
Computer. Automation Calders, Toon Wijsen, J. On monotone data mining languages |
topic_facet |
Computer. Automation |
description |
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. |
format |
Article in Journal/Newspaper |
author |
Calders, Toon Wijsen, J. |
author_facet |
Calders, Toon Wijsen, J. |
author_sort |
Calders, Toon |
title |
On monotone data mining languages |
title_short |
On monotone data mining languages |
title_full |
On monotone data mining languages |
title_fullStr |
On monotone data mining languages |
title_full_unstemmed |
On monotone data mining languages |
title_sort |
on monotone data mining languages |
publishDate |
2002 |
url |
https://hdl.handle.net/10067/1041620151162165141 |
genre |
DML |
genre_facet |
DML |
op_source |
0302-9743 Lecture notes in computer science |
op_relation |
info:eu-repo/semantics/altIdentifier/isi/000181438100007 info:eu-repo/semantics/altIdentifier/doi/10.1007/3-540-46093-4_7 |
op_rights |
info:eu-repo/semantics/closedAccess |
op_doi |
https://doi.org/10.1007/3-540-46093-4_7 |
container_start_page |
119 |
op_container_end_page |
132 |
_version_ |
1771545138417369088 |