Fast accumulation lattice algorithm for mining sequential patterns

Authors:
Nancy P. Lin;Wei-Hua Hao;Hung-Jen Chen
Affiliations:
Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan;Department of Computer Science and Information Engineering, Tamkang University, Tamsui, Taipei, Taiwan
Venue:
ACOS'07 Proceedings of the 6th Conference on WSEAS International Conference on Applied Computer Science - Volume 6
Year:
2007

Citing 10
Cited 2

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
FreeSpan: frequent pattern-projected sequential pattern mining

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
SPADE: an efficient algorithm for mining frequent sequences

Machine Learning
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Discovering Frequent Closed Itemsets for Association Rules

ICDT '99 Proceedings of the 7th International Conference on Database Theory
CLOSET+: searching for the best strategies for mining frequent closed itemsets

Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
BIDE: Efficient Mining of Frequent Closed Sequences

ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Mining Sequential Patterns by Pattern-Growth: The PrefixSpan Approach

IEEE Transactions on Knowledge and Data Engineering
FS-Miner: efficient and incremental mining of frequent sequence patterns in web logs

Proceedings of the 6th annual ACM international workshop on Web information and data management
Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques

Fast mining maximal sequential patterns

SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
Fast mining of closed sequential patterns

WSEAS Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Sequential Patterns has many diverse applications in many fields recently. And it has become one of the most important issues of Data Mining. The major problem in previous studies of mining sequential patterns is too many candidates sequences has been generated during the mining process, costing computing power and increasing runtime. In this paper we propose a new algorithm, Fast Accumulation Lattice (FAL) to alleviate this problem. FAL scan sequential database only once to construct the lattice structure which is a quasi-compressed data representation of original sequential database. The advantages of FAL are: reduce scan times, reduce searching space and minimize requirement of memory for searching frequent sequences, and maximal frequent sequences as well.