By Topic

Mining Top-K Sequential Patterns in the Data Stream Environment

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
$31 $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

3 Author(s)
Bi-Ru Dai ; Dept. of Comput. Sci. & Inf. Eng., Nat. Taiwan Univ. of Sci. & Technol., Taipei, Taiwan ; Hung-Lin Jiang ; Chih-Heng Chung

Sequential pattern mining is a process of extracting useful patterns in data sequences. Existing works on mining Top-K patterns on data streams are mostly for non-sequential patterns. In our framework, we focus on the topic of Top-K sequential pattern mining, where users can obtain adequate amount of interesting patterns. The proposed method can automatically adjust the minimum support during mining each batch in the data stream to obtain candidate patterns. Then candidate patterns are maintained by a tree structure for extracting Top-K sequential patterns. Empirical results show that the proposed method is efficient and scalable.

Published in:

Technologies and Applications of Artificial Intelligence (TAAI), 2010 International Conference on

Date of Conference:

18-20 Nov. 2010