Mining top-k motifs with a SAT-based framework

DOI10.1016/J.ARTINT.2015.11.003MaRDI QIDQ511756zbMATH OpenOpenAlexFDO

Authors Yakoub Salhi, Said Jabbour, 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

zbMATH Keywords

data miningmodelingBoolean satisfiabilitytop-\(k\) motifs

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 1696694 (Why is no real title available?)
• scientific article; zbMATH DE number 5139161 (Why is no real title available?)
• scientific article; zbMATH DE number 1445317 (Why is no real title available?)
• scientific article; zbMATH DE number 3313427 (Why is no real title available?)
• scientific article; zbMATH DE number 2243357 (Why is no real title available?)
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• Cardinality networks: a theoretical and empirical study
• Handbook of constraint programming.
• Itemset mining: a constraint programming perspective
• Mining (soft-) skypatterns using dynamic CSP
• On Solving the Partial MAX-SAT Problem
• On measuring similarity for sequences of itemsets
• Solving satisfiability problems with preferences
• Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

Cited in

(4)

• Implementing efficient All solutions SAT solvers
• A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence
• Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group
• Parallel Discovery of Top-k Weighted Motifs in Large Graphs

Describes a project that uses

Uses Software

• CP-nets
• MiniSat

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)