Study on a New Mining Association Rule Without Candidate Generation~4/―Relim Algorithm
Xiping Liu · Computing Technology and Automation · 2006
Fp-growth algorithm is one of the currently fastest and most popular algorithms for mining association rule without candidate generation.However,it has disadvantages such as complicated data structure and lower space utilization rate.Recursive elimination(Relim) algorithm,which is proposed by Christian Borgelt in 2004 based on the Fp-growth algorithm,is a new algorithm in mining association rule without candidate generation.The dramatic advantages of Relim algorithm are its simplicity of structure and high space utilization rate.In this paper,the Relim algorithm is described firstly,and then is compared with the Fp-growth algorithm.The comparison results show that,even though the Relim algorithm has simple structure,its speed is not slower than that of the Fp-growth algorithm,even faster when the minimal support is set high or there are fewer frequent item sets.