Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
type: Item
instance of: scholarly article
title: Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
zbMATH Open document ID: 1427.68066
author: Amina Kemmar
author: Yahia Lebbah
author: Samir Loudni
author: Patrice Boizumault
author: Thierry Charnois
published in: Constraints
publication date: 2018-03-28T00:00:00Z
Mathematics Subject Classification ID: 68P15
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 6853926
zbMATH Keywords: global constraints
zbMATH Keywords: data mining
zbMATH Keywords: sequential pattern mining
zbMATH Keywords: prefix-projection
zbMATH Keywords: top-\(k\)
describes a project that uses: CloSpan
describes a project that uses: SPADE
describes a project that uses: BIDE
describes a project that uses: SPMF
describes a project that uses: PrefixSpan
MaRDI profile type: Publication
full work available at URL: s10601-016-9252-z
OpenAlex ID: W2512519091
cites work: Itemset mining: a constraint programming perspective
cites work: Q5249581
cites work: Introducing global constraints in CHIP
cites work: SPADE: An efficient algorithm for mining frequent sequences
cites work: A Global Constraint for Mining Sequential Patterns with GAP Constraint
cites work: Constraint-Based Sequence Mining Using Constraint Programming
cites work: Supervised descriptive rule discovery: a unifying survey of contrast set, emerging pattern and subgroup mining
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: Mining (Soft-) Skypatterns Using Dynamic CSP
cites work: Q3184605
DOI: 10.1007/S10601-016-9252-Z
description: scientific article; zbMATH DE number 6853926