Generalization of pattern-growth methods for sequential pattern mining with gap constraints

DOI10.1007/3-540-45065-3_21MaRDI QIDQ4436442zbMATH OpenFDO

Authors Cláudia Antunes, Arlindo L. Oliveira

Publication date 4 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2734/27340239.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• A global constraint for mining sequential patterns with GAP constraint
• scientific article; zbMATH DE number 2222605
• Mining top-k distinguishing sequential patterns with gap constraint
• Mining approximate repeating patterns from sequence data with gap constraints

Cited in

(11)

• Consensus-based modeling using distributed feature construction with ILP
• Mining time-constrained sequential patterns with constraint programming
• Prefix-projection global constraint and top-\(k\) approach for sequential pattern mining
• NegSPan: efficient extraction of negative sequential patterns with embedding constraints
• A global constraint for mining sequential patterns with GAP constraint
• Mining top-k distinguishing sequential patterns with gap constraint
• Mining approximate repeating patterns from sequence data with gap constraints
• DELISP: Efficient discovery of generalized sequential patterns by delimited pattern-growth technology
• Accuracy of generalized context patterns in the context based sequential patterns mining
• scientific article; zbMATH DE number 2222605 (Why is no real title available?)
• NWP-miner: nonoverlapping weak-gap sequential pattern mining

This page was built for publication: Generalization of pattern-growth methods for sequential pattern mining with gap constraints

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