Hybrid ASP-based Approach to Pattern Mining
- 18 January 2019
- journal article
- research article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 19 (04) , 505-535
Abstract
Detecting small sets of relevant patterns from a given data set 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 are considered relevant. Rule-based languages like answer set programming (ASP) seem well suited for specifying such criteria in a form of constraints. Although progress has been made, on the one hand, on solving individual mining problems and, on the other hand, developing generic mining systems, the existing methods focus either on scalability or on generality. In this paper, we make steps toward combining local (frequency, size, and cost) and global (various condensed representations like maximal, closed, and skyline) constraints in a generic and efficient way. We present a hybrid approach for itemset, sequence, and graph mining which exploits dedicated highly optimized mining systems to detect frequent patterns and then filters the results using declarative ASP. To further demonstrate the generic nature of our hybrid framework, we apply it to a problem of approximately tiling a database. Experiments on real-world data sets show the effectiveness of the proposed method and computational gains for itemset, sequence, and graph mining, as well as approximate tiling.Under consideration in Theory and Practice of Logic Programming.Keywords
All Related Versions
This publication has 27 references indexed in Scilit:
- WASP: A Native ASP Solver Based on Constraint LearningLecture Notes in Computer Science, 2013
- Itemset Mining as a Challenge Application for Answer Set EnumerationLecture Notes in Computer Science, 2011
- Answer Set Programming: A Primer2009
- Combining Nonmonotonic Knowledge Bases with External SourcesLecture Notes in Computer Science, 2009
- On the Positive–Negative Partial Set Cover problemInformation Processing Letters, 2008
- clasp: A Conflict-Driven Answer Set Solver2007
- On condensed representations of constrained frequent patternsKnowledge and Information Systems, 2005
- Towards Fault-Tolerant Formal Concept AnalysisLecture Notes in Computer Science, 2005
- Extending and implementing the stable model semanticsArtificial Intelligence, 2002
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993