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 search strategy used in...

Full description

Bibliographic Details
Main Authors: Toon Calders, Jef Wijsen
Other Authors: The Pennsylvania State University CiteSeerX Archives
Format: Text
Language:English
Published: Springer 2001
Subjects:
DML
Online Access:http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1243
http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf
id ftciteseerx:oai:CiteSeerX.psu:10.1.1.68.1243
record_format openpolar
spelling ftciteseerx:oai:CiteSeerX.psu:10.1.1.68.1243 2023-05-15T16:01:17+02:00 On monotone data mining languages Toon Calders Jef Wijsen The Pennsylvania State University CiteSeerX Archives 2001 application/pdf http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1243 http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf en eng Springer http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1243 http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf text 2001 ftciteseerx 2016-01-08T17:48:33Z 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. 1 Text DML Unknown
institution Open Polar
collection Unknown
op_collection_id ftciteseerx
language English
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. 1
author2 The Pennsylvania State University CiteSeerX Archives
format Text
author Toon Calders
Jef Wijsen
spellingShingle Toon Calders
Jef Wijsen
On monotone data mining languages
author_facet Toon Calders
Jef Wijsen
author_sort Toon Calders
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
publisher Springer
publishDate 2001
url http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1243
http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf
genre DML
genre_facet DML
op_source http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf
op_relation http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.1243
http://www.adrem.ua.ac.be/bibrem/pubs/CALDERSDBPL01.pdf
op_rights Metadata may be used without restrictions as long as the oai identifier remains attached to it.
_version_ 1766397210829783040

Similar Items