PRISM: an effective approach for frequent sequence mining via prime-block encoding

DOI10.1016/J.JCSS.2009.05.008zbMATH Open1182.68172OpenAlexW2082670841MaRDI QIDQ1049280FDOQ1049280

Authors: Karam Gouda, Mosab Hassaan, Mohammed J. Zaki 

Publication date: 8 January 2010

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2009.05.008

Recommendations

• Efficiently using prime-encoding for mining frequent itemsets in sparse data
• SPADE: An efficient algorithm for mining frequent sequences
• scientific article; zbMATH DE number 2222605
• On sequential pattern mining algorithms
• Closing the gap, sequence mining at scale

zbMATH Keywords

data miningfrequent sequence miningprime encoding

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Cites Work

• SPADE: An efficient algorithm for mining frequent sequences
• Algorithms on Strings, Trees and Sequences
• Database Theory - ICDT 2005
• PRISM: an effective approach for frequent sequence mining via prime-block encoding

Cited In (4)

• Efficient algorithms to identify periodic patterns in multiple sequences
• PRISM: an effective approach for frequent sequence mining via prime-block encoding
• Closing the gap, sequence mining at scale
• Efficiently using prime-encoding for mining frequent itemsets in sparse data

Uses Software

• SPADE
• PrefixSpan
• BIDE

This page was built for publication: PRISM: an effective approach for frequent sequence mining via prime-block encoding

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