Affiliations: [a] Innovative Information Industry Research Center, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus, Shenzhen University Town, Shenzhen, Guangdong, China | [b] Shenzhen Key Laboratory of Internet Information Collaboration, School of Computer Science and Technology, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus, Shenzhen University Town, Shenzhen, Guangdong, China | [c] Department of Computer Science and Information Engineering, National University of Kaohsiung, Kaohsiung, Taiwan | [d] Department of Computer Science and Engineering, National Sun Yat-sen University, Kaohsiung, Taiwan | [e] Computational Intelligence Technology Center, Industrial Technology Research Institute, Hsinchu, Taiwan
Correspondence:
[*]
Corresponding author: Chun-Wei Lin, Harbin Institute of Technology Shenzhen Graduate School, HIT Campus, Shenzhen University Town, Shenzhen, Guangdong, China. E-mail: [email protected].
Abstract: Mining useful information from large databases has become an important research issue in recent years. Among the classes of derived knowledge, sequential patterns can be used to discover customer behaviors to facilitate efficient decision-making. The fast updated frequent-pattern (FUFP)-tree algorithm has been proposed to efficiently mine frequent itemsets through transaction insertion in incremental mining. The present study extends this algorithm to develop an incremental fast updated sequential-pattern (FUSP)-tree algorithm for efficiently handling sequential patterns whether the newly inserted transactions are from customers already in the database or from new customers. An FUSP-tree structure is designed to make the update process easier. The FUSP-growth algorithm is proposed for mining frequent sequences (sequential patterns) from the FUSP-tree. Experimental results show that the proposed FUSP-tree algorithm has good performance for incrementally handling newly inserted transactions.
Keywords: Data mining, sequential pattern, data analysis, incremental mining
