To Örebro University

oru.seÖrebro University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
MiningZinc: A declarative framework for constraint-based mining
Department of Computer Science, KU Leuven, Belgium.
Department of Computer Science, KU Leuven, Belgium.
Department of Computer Science, KU Leuven, Belgium; LIACS, Universiteit Leiden, Netherlands.
Faculty of IT, Monash University, National ICT Australia (NICTA), Australia.
Show others and affiliations
2017 (English)In: Artificial Intelligence, ISSN 0004-3702, E-ISSN 1872-7921, Vol. 244, p. 6-29Article in journal (Refereed) Published
Abstract [en]

We introduce MiningZinc, a declarative framework for constraint-based data mining. MiningZinc consists of two key components: a language component and an execution mechanism.

First, the MiningZinc language allows for high-level and natural modeling of mining problems, so that MiningZinc models are similar to the mathematical definitions used in the literature. It is inspired by the Zinc family of languages and systems and supports user-defined constraints and functions.

Secondly, the MiningZinc execution mechanism specifies how to compute solutions for the models. It is solver independent and supports both standard constraint solvers and specialized data mining systems. The high-level problem specification is first translated into a normalized constraint language (FlatZinc). Rewrite rules are then used to add redundant constraints or solve subproblems using specialized data mining algorithms or generic constraint programming solvers. Given a model, different execution strategies are automatically extracted that correspond to different sequences of algorithms to run. Optimized data mining algorithms, specialized processing routines and generic solvers can all be automatically combined.

Thus, the MiningZinc language allows one to model constraint-based itemset mining problems in a solver independent way, and its execution mechanism can automatically chain different algorithms and solvers. This leads to a unique combination of declarative modeling with high-performance solving.

Place, publisher, year, edition, pages
Amsterdam, Netherlands: Elsevier, 2017. Vol. 244, p. 6-29
Keywords [en]
Constraint-based mining, Itemset mining, Constraint programming, Declarative modeling, Pattern mining
National Category
Mechanical Engineering Computer Sciences
Identifiers
URN: urn:nbn:se:oru:diva-84461DOI: 10.1016/j.artint.2015.09.007ISI: 000394630400002Scopus ID: 2-s2.0-84945906748OAI: oai:DiVA.org:oru-84461DiVA, id: diva2:1452918
Available from: 2020-07-08 Created: 2020-07-08 Last updated: 2020-08-21Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

De Raedt, Luc

Search in DiVA

By author/editor
De Raedt, Luc
In the same journal
Artificial Intelligence
Mechanical EngineeringComputer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 136 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf