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: Toon Calders Jef, 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.24.3906
http://win-www.uia.ac.be/u/calders/download/monotone.ps
id ftciteseerx:oai:CiteSeerX.psu:10.1.1.24.3906
record_format openpolar
spelling ftciteseerx:oai:CiteSeerX.psu:10.1.1.24.3906 2023-05-15T16:01:16+02:00 On Monotone Data Mining Languages Toon Calders Jef Jef Wijsen The Pennsylvania State University CiteSeerX Archives 2001 application/postscript http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3906 http://win-www.uia.ac.be/u/calders/download/monotone.ps en eng Springer http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3906 http://win-www.uia.ac.be/u/calders/download/monotone.ps Metadata may be used without restrictions as long as the oai identifier remains attached to it. http://win-www.uia.ac.be/u/calders/download/monotone.ps text 2001 ftciteseerx 2016-01-07T19:08:05Z 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. Text DML Unknown
institution Open Polar
collection Unknown
op_collection_id ftciteseerx
language English
description 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.
author2 The Pennsylvania State University CiteSeerX Archives
format Text
author Toon Calders Jef
Jef Wijsen
spellingShingle Toon Calders Jef
Jef Wijsen
On Monotone Data Mining Languages
author_facet Toon Calders Jef
Jef Wijsen
author_sort Toon Calders Jef
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.24.3906
http://win-www.uia.ac.be/u/calders/download/monotone.ps
genre DML
genre_facet DML
op_source http://win-www.uia.ac.be/u/calders/download/monotone.ps
op_relation http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.3906
http://win-www.uia.ac.be/u/calders/download/monotone.ps
op_rights Metadata may be used without restrictions as long as the oai identifier remains attached to it.
_version_ 1766397198151450624

Similar Items