Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining

DOI10.1007/s10601-016-9252-zzbMath1427.68066OpenAlexW2512519091MaRDI QIDQ1706775

Amina Kemmar, Thierry Charnois, Patrice Boizumault, Yahia Lebbah, Samir Loudni

Publication date: 28 March 2018

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-016-9252-z

zbMATH Keywords

data miningglobal constraintstop-\(k\)sequential pattern miningprefix-projection

Mathematics Subject Classification ID

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

Related Items (1)

Knowledge representation analysis of graph mining

Uses Software

• SPADE
• SPMF
• PrefixSpan
• CloSpan
• BIDE

Cites Work

• Itemset mining: a constraint programming perspective
• Introducing global constraints in CHIP
• A Global Constraint for Mining Sequential Patterns with GAP Constraint
• Mining (Soft-) Skypatterns Using Dynamic CSP
• Constraint-Based Sequence Mining Using Constraint Programming
• Principles and Practice of Constraint Programming – CP 2004
• SPADE: An efficient algorithm for mining frequent sequences
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining