FFS -- an I/O-efficient algorithm for mining frequent sequences

DOI10.1007/3-540-45357-1_32MaRDI QIDQ2768938zbMATH OpenFDO

Authors Ming-hua Zhang, Ben Kao, Chi Lap Yip, David W. Cheung

Publication date 10 February 2002

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

Full work available at URL https://doi.org/10.1007/3-540-45357-1_32

zbMATH Keywords

AprioriAll algorithmdata mining

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Computing methodologies and applications (68U99)

Recommendations

• SPADE: An efficient algorithm for mining frequent sequences
• Efficient algorithms for incremental update of frequent sequences
• IDSG: a new algorithm for mining frequent sequences
• Fast FP-growth for association rule mining
• A mining algorithm for fast maximal sequential patterns

Cited in

(2)

• Closing the gap, sequence mining at scale
• IDSG: a new algorithm for mining frequent sequences

This page was built for publication: FFS -- an I/O-efficient algorithm for mining frequent sequences

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