DocumentCode :
598673
Title :
An improved approach for sequential utility pattern mining
Author :
Lan, Guo-Cheng ; Hong, Tzung-Pei ; Tseng, Vincent S. ; Wang, Shyue-Liang
Author_Institution :
Department of Computer Science and Information Engineering, National Cheng Kung University, Taiwan
fYear :
2012
fDate :
11-13 Aug. 2012
Firstpage :
226
Lastpage :
230
Abstract :
In this paper, we propose an efficient projection-based algorithm to discover high sequential utility patterns from quantitative sequence databases. An effective pruning strategy in the proposed algorithm is designed to tighten upper-bounds for subsequences in mining. By using the strategy, a large number of unpromising subsequences could be pruned to improve execution efficiency. Finally, the experimental results on synthetic datasets show the proposed algorithm outperforms the previously proposed algorithm under different parameter settings.
Keywords :
Educational institutions; Informatics; data mining; high sequence utility upper-bound patterns; high sequential utility patterns; upper-bound;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Granular Computing (GrC), 2012 IEEE International Conference on
Conference_Location :
Hangzhou, China
Print_ISBN :
978-1-4673-2310-9
Type :
conf
DOI :
10.1109/GrC.2012.6468697
Filename :
6468697
Link To Document :
بازگشت