Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Lin, Chun-Weia; b; * | Hong, Tzung-Peic; d | Lin, Wen-Yangc | Lan, Guo-Chenge
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: jerrylin@ieee.org.
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
DOI: 10.3233/IDA-140682
Journal: Intelligent Data Analysis, vol. 18, no. 6, pp. 1013-1026, 2014
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl