Using Answer Set Programming for pattern mining
Serial pattern mining consists in extracting the frequent sequential patterns from a unique sequence of itemsets. This paper explores the ability of a declarative language, such as Answer Set Programming (ASP), to solve this issue efficiently. We propose several ASP implementations of the frequent sequential pattern mining task: a non-incremental and an incremental resolution. The results show that the incremental resolution is more efficient than the non-incremental one, but both ASP programs are less efficient than dedicated algorithms. Nonetheless, this approach can be seen as a first step toward a generic framework for sequential pattern mining with constraints.
Code (0)
등록된 구현이 없습니다.
Tasks
Sequential Pattern MiningSimilar Papers 제목 키워드 기반
Declarative Sequential Pattern Mining of Care Pathways
Sequential pattern mining algorithms are widely used to explore care pathways database, but they generate a deluge of patterns, mostly redundant or useless. Clinicians need tools to express complex mining queries in orde…
Sequential Pattern MiningEfficiency Analysis of ASP Encodings for Sequential Pattern Mining Tasks
This article presents the use of Answer Set Programming (ASP) to mine sequential patterns. ASP is a high-level declarative logic programming paradigm for high level encoding combinatorial and optimization problem solving…
Sequential Pattern MiningExtended High Utility Pattern Mining: An Answer Set Programming Based Framework and Applications
Detecting sets of relevant patterns from a given dataset is an important challenge in data mining. The relevance of a pattern, also called utility in the literature, is a subjective measure and can be actually assessed f…
ICU AdmissionHybrid ASP-based Approach to Pattern Mining
Detecting small sets of relevant patterns from a given dataset is a central challenge in data mining. The relevance of a pattern is based on user-provided criteria; typically, all patterns that satisfy certain criteria a…
Graph MiningGenerating Explainable Rule Sets from Tree-Ensemble Learning Methods by Answer Set Programming
We propose a method for generating explainable rule sets from tree-ensemble learners using Answer Set Programming (ASP). To this end, we adopt a decompositional approach where the split structures of the base decision tr…
Ensemble Learning