Efficient algorithms for incremental update of frequent sequences

DOI10.1007/3-540-47887-6_18MaRDI QIDQ4739189zbMATH OpenFDO

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

Publication date 12 August 2004

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/2336/23360186.htm

zbMATH Keywords

data miningincremental updatesequence

Mathematics Subject Classification ID

Database theory (68P15) Information storage and retrieval of data (68P20) Computing methodologies and applications (68U99)

Recommendations

• Incremental updating algorithmfor sequence patterns mining based on projected database
• scientific article; zbMATH DE number 826057
• Efficient algorithms for finding a longest common increasing subsequence
• Algorithms and Computation
• Faster Algorithms for Computing Longest Common Increasing Subsequences

Cited in

(7)

• A sequential tree approach for incremental sequential pattern mining
• FFS -- an I/O-efficient algorithm for mining frequent sequences
• A rough sets partitioning model for incremental mining of sequential patterns in large databases
• An incremental algorithm for mining frequent closed patterns
• Efficient incremental algorithm for mining sequence patterns in multiple databases with privacy preserving
• Incremental updating algorithmfor sequence patterns mining based on projected database
• IDSG: a new algorithm for mining frequent sequences

This page was built for publication: Efficient algorithms for incremental update of frequent sequences

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