More Efficient Algorithm for Mining Frequent Patterns with Multiple Minimum Supports

Author(s):  
Wensheng Gan ◽  
Jerry Chun-Wei Lin ◽  
Philippe Fournier-Viger ◽  
Han-Chieh Chao
2014 ◽  
Vol 513-517 ◽  
pp. 759-762
Author(s):  
Xiao Lei Zhao ◽  
Wei Huang

On the basis of the shortcoming of the existed algorithm, this paper probes into sliding windows pattern and introduces an efficient algorithm for data mining frequent pattern over sliding windows. A PSW-tree pattern is set in the algorithm to store frequent and critical pattern in data mining. On this basis, the paper presents a rapid mining algorithmPSW algorithm. In the experiment IBM data generator is used to produce generated data, which proves the validity and better space efficiency of the algorithm.


2016 ◽  
Vol 45 (1) ◽  
pp. 96-111 ◽  
Author(s):  
Thu-Lan Dam ◽  
Kenli Li ◽  
Philippe Fournier-Viger ◽  
Quang-Huy Duong

Author(s):  
Wensheng Gan ◽  
Jerry Chun-Wei Lin ◽  
Philippe Fournier-Viger ◽  
Han-Chieh Chao ◽  
Justin Zhan

Sign in / Sign up

Export Citation Format

Share Document