By Topic

Mining sequential patterns using graph search techniques

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yin-Fu Huang ; Inst. of Electron. & Inf. Eng., National Yunlin Univ. of Sci. & Technol., Taiwan ; Shao-Yuan Lin

Sequential patterns discovery had emerged as an important problem in data mining. In this paper, we propose an effective GST algorithm for mining sequential patterns in a large transaction database. Different from the apriori-like algorithms, the GST algorithm can out of order find large k-sequences (k >= 3);i.e., we can find large k-sequences not directly through large (k-1)-sequences. This leads to that our algorithm has much better performance than the Apriori-like algorithms. Besides, we also propose the method to find new sequential patterns by scanning only new transactions since the database was increased. Through several comprehensive experiments, the GST algorithm gains a significant performance improvement over the Apriori-like algorithms. Also we found as long as the ratio of the items purchased in new transactions is always much better than scanning the entire database.

Published in:

Computer Software and Applications Conference, 2003. COMPSAC 2003. Proceedings. 27th Annual International

Date of Conference:

3-6 Nov. 2003