Analysis and Comparison of Representative Algorithms for Mining Association Rules
Tao Hong-cai · Computer Technology and Development · 2007
Discovering association rules is an important data mining problem.Recently,there has been considerable research in designing algorithms for this task.Introduce some representative algorithms for discovering all significant association rules among items in large database of transactions,and it's known that there are two key problems that affect the efficiency of discovering association rules,so analyse the strategy each algorithm adopts seperately,and compare their tradeoffs,finally prospects development trends of algorithms of discovering association rules.