Constraint-Based Sequence Mining Using Constraint Programming

DOI10.1007/978-3-319-18008-3_20MaRDI QIDQ5741473zbMATH OpenOpenAlexFDO

Authors Benjamin Negrevergne, Tias Guns

Publication date 25 July 2016

Published in Integration of AI and OR Techniques in Constraint Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1501.01178

zbMATH Keywords

constrained pattern miningconstraint programmingdeclarative programmingepisode miningsequence miningsequential pattern mining

Mathematics Subject Classification ID

Database theory (68P15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Abstract: The goal of constraint-based sequence mining is to find sequences of symbols that are included in a large number of input sequences and that satisfy some constraints specified by the user. Many constraints have been proposed in the literature, but a general framework is still missing. We investigate the use of constraint programming as general framework for this task. We first identify four categories of constraints that are applicable to sequence mining. We then propose two constraint programming formulations. The first formulation introduces a new global constraint called exists-embedding. This formulation is the most efficient but does not support one type of constraint. To support such constraints, we develop a second formulation that is more general but incurs more overhead. Both formulations can use the projected database technique used in specialised algorithms. Experiments demonstrate the flexibility towards constraint-based settings and compare the approach to existing methods.

Recommendations

• Mining time-constrained sequential patterns with constraint programming
• Database Support for Data Mining Applications
• scientific article; zbMATH DE number 1863362
• scientific article; zbMATH DE number 2020222
• A global constraint for mining sequential patterns with GAP constraint

Cited in

(23)

• Episodesupport: a global constraint for mining frequent patterns in a long sequence of events
• Mining time-constrained sequential patterns with constraint programming
• Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
• A parameterizable enumeration algorithm for sequence mining
• Design and implementation of bounded-length sequence variables
• NegSPan: efficient extraction of negative sequential patterns with embedding constraints
• Efficient strategies for tough aggregate constraint-based sequential pattern mining
• A global constraint for mining sequential patterns with GAP constraint
• Generalizing itemset mining in a constraint programming setting
• Pushing multiple convertible constrains into frequent itemsets mining
• A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence
• Improving constrained pattern mining with first-fail-based heuristics
• scientific article; zbMATH DE number 1950777 (Why is no real title available?)
• scientific article; zbMATH DE number 1977816 (Why is no real title available?)
• scientific article; zbMATH DE number 2020222 (Why is no real title available?)
• Hybrid ASP-based approach to pattern mining
• MiningZinc: a declarative framework for constraint-based mining
• A compositional typed higher-order logic with definitions
• Database Support for Data Mining Applications
• Constraint-Based Mining and Inductive Databases
• A constraint based structure description language for biosequences
• Itemset mining: a constraint programming perspective
• MASS-CSP: mining with answer set solving for contrast sequential pattern mining

This page was built for publication: Constraint-Based Sequence Mining Using Constraint Programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741473)