Top-k sequence pattern mining with non-overlapping condition

DOI10.2298/FIL1805703CMaRDI QIDQ5024640zbMATH OpenFDO

Authors Xin Chai, Dan Yang, Jingyu Liu, Yan Li, Youxi Wu

Publication date 26 January 2022

Published in Filomat (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2298/FIL1805703C

zbMATH Keywords

gap constraintnon-overlapping conditionsequence pattern miningtop-\(k\)

Mathematics Subject Classification ID

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

Recommendations

• Skopus: mining top-\(k\) sequential patterns under leverage
• Mining top-k distinguishing sequential patterns with gap constraint
• Opportunistic mining of top-\(n\) high utility patterns
• On sequential pattern mining algorithms
• Mining sequential patterns across time sequences

Cites work

• Mining Compressing Sequential Patterns
• Mining top-k distinguishing sequential patterns with gap constraint

Cited in

(3)

• Skopus: mining top-\(k\) sequential patterns under leverage
• Mining top-k distinguishing sequential patterns with gap constraint
• NWP-miner: nonoverlapping weak-gap sequential pattern mining

This page was built for publication: Top-\(k\) sequence pattern mining with non-overlapping condition

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