DISCOVERING IMPORTANT SEQUENTIAL PATTERNS WITH LENGTH-DECREASING WEIGHTED SUPPORT CONSTRAINTS

DOI10.1142/S0219622010003968zbMath1205.68332OpenAlexW2066784532MaRDI QIDQ3585097

Keun Ho Ryu, Unil Yun

Publication date: 19 August 2010

Published in: International Journal of Information Technology & Decision Making (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219622010003968

zbMATH Keywords

data miningknowledge discoverylength-decreasing support constraintsweighted sequential pattern mining

Mathematics Subject Classification ID

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

Related Items (1)

Efficient algorithms for mining frequent high utility sequences with constraints

Uses Software

• SPADE

Cites Work

• THE INCREMENTAL MINING OF CONSTRAINED CUBE GRADIENTS
• ACTIVITY MINING: FROM ACTIVITIES TO ACTIONS
• SPADE: An efficient algorithm for mining frequent sequences

This page was built for publication: DISCOVERING IMPORTANT SEQUENTIAL PATTERNS WITH LENGTH-DECREASING WEIGHTED SUPPORT CONSTRAINTS