A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence

MaRDI QIDQ3457225zbMATH OpenFDO

Authors Emmanuel Coquery, Said Jabbour, Lakhdar Sais, Yakoub Salhi

Publication date 11 December 2015

Full work available at URL http://ebooks.iospress.nl/volumearticle/6982

Mathematics Subject Classification ID

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

Recommendations

• A proposition for sequence mining using pattern structures
• Mining top-\(k\) motifs with a SAT-based framework
• Rough Sets and Current Trends in Computing
• scientific article; zbMATH DE number 2112391
• Constraint-Based Sequence Mining Using Constraint Programming

Cited in

(7)

• Mining time-constrained sequential patterns with constraint programming
• A proposition for sequence mining using pattern structures
• scientific article; zbMATH DE number 1943774 (Why is no real title available?)
• MiningZinc: a declarative framework for constraint-based mining
• Mining top-\(k\) motifs with a SAT-based framework
• Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems
• MASS-CSP: mining with answer set solving for contrast sequential pattern mining

This page was built for publication: A SAT-based approach for discovering frequent, closed and maximal patterns in a sequence

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