Towards a compact SAT-based encoding of itemset mining tasks

DOI10.1007/978-3-030-78230-6_11OpenAlexW3167433919MaRDI QIDQ2117214FDOQ2117214

Nadjet Kamel, Ikram Nekkache, Said Jabbour, Lakhdar Sais

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-78230-6_11

zbMATH Keywords

data miningsatisfiabilityitemset mining

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27)

Cites Work

• Theory and Applications of Satisfiability Testing
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• Itemset mining: a constraint programming perspective
• Some simplified NP-complete graph problems
• MiningZinc: a declarative framework for constraint-based mining

Uses Software

• MiniSat

This page was built for publication: Towards a compact SAT-based encoding of itemset mining tasks

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