scholarly journals Research on Improved Algorithm Based on AprioriTid Transaction and Candidate Item Compression

Author(s):  
Yonggui Zou ◽  
Bowen Tan
2014 ◽  
Vol 556-562 ◽  
pp. 1510-1514
Author(s):  
Li Qiang Lin ◽  
Hong Wen Yan

For the low efficiency in generating candidate item sets of apriori algorithm, this paper presents a method based on property division to improve generating candidate item sets. Comparing the improved apriori algorithm with the other algorithm and the improved algorithm is applied to the power system accident cases in extreme climate. The experiment results show that the improved algorithm significantly improves the time efficiency of generating candidate item sets. And it can find the association rules among time, space, disasters and fault facilities in the power system accident cases in extreme climate. That is very useful in power system fault analysis.


2012 ◽  
Vol 263-266 ◽  
pp. 2179-2184 ◽  
Author(s):  
Zhen Yun Liao ◽  
Xiu Fen Fu ◽  
Ya Guang Wang

The first step of the association rule mining algorithm Apriori generate a lot of candidate item sets which are not frequent item sets, and all of these item sets cost a lot of system spending. To solve this problem,this paper presents an improved algorithm based on Apriori algorithm to improve the Apriori pruning step. Using this method, the large number of useless candidate item sets can be reduced effectively and it can also reduce the times of judge whether the item sets are frequent item sets. Experimental results show that the improved algorithm has better efficiency than classic Apriori algorithm.


Sign in / Sign up

Export Citation Format

Share Document