Mining top-k motifs with a SAT-based framework
DOI10.1016/J.ARTINT.2015.11.003zbMATH Open1404.68143OpenAlexW2182849704MaRDI QIDQ511756FDOQ511756
Said Jabbour, Yakoub Salhi, Lakhdar Sais
Publication date: 22 February 2017
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2015.11.003
Recommendations
- A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence
- Itemset frequency satisfiability: complexity and axiomatization
- The complexity of satisfying constraints on databases of transactions
- Minimal sets on propositional formulae. Problems and reductions
- Maximal falsifiability. Definitions, algorithms, and applications
Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Database theory (68P15)
Cites Work
- Title not available (Why is that?)
- Handbook of constraint programming.
- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
- Title not available (Why is that?)
- Solving satisfiability problems with preferences
- Itemset mining: a constraint programming perspective
- On Solving the Partial MAX-SAT Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- On measuring similarity for sequences of itemsets
- Title not available (Why is that?)
- Cardinality networks: a theoretical and empirical study
- Mining (Soft-) Skypatterns Using Dynamic CSP
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
Cited In (3)
Uses Software
This page was built for publication: Mining top-\(k\) motifs with a SAT-based framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q511756)
