TABLE OF CONTENTS The problem of mining frequent sequences is to extract frequently occurring subsequences in a sequence database. It was first put forward in [1]. Since then, many algorithms have been proposed to solve the problem efficiently [6], [9], [7], [4]. This paper surveys several notable algorithms for mining frequent sequences, and analyze their characterstics.
[1]Rakesh Agrawal and Ramakrishnan Srikant. Mining sequential patterns. In Proc. of the 11th Int'l Conference on Data Engineering, Taipei, Taiwan, March (1995).
[6]Ramakrishnan Srikant and Rakesh Agrawal. Mining sequential patterns: Generalizations and performance improvements. In Proc. of the 5th Conference on Extending Database Technology (EDBT), Avignion, France, March (1996).
[9]Minghua Zhang, Ben Kao, C.L. Yip, and David Cheung. A GSP-based efficient algorithm for mining frequent sequences. In Proc. of IC-AI'2001, Las Vegas, Nevada, USA, (June 2001).
[7]Mohammed J. Zaki. Efficient enumeration of frequent sequences. In Proceedings of the 1998 ACM 7th International Conference on Information and Knowledge Management (CIKM'98), Washington, United States, November (1998).
[4]Jian Pei, Jiawei Han, Behzad Mortazavi-Asl; Helen Pinto, Qiming Chen, Umeshwar Dayal, and Mei-Chun Hsu. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proc. 17th IEEE International Conference on Data Engineering (ICDE), Heidelberg, Germany, April (2001).
Data mining has recently attracted considerable attention from database practitioners and researchers because of its applicability in many...
