Non-redundant association rules extraction of frequent concept lattice based on FP-tree
Jin Wang · Computer Engineering and Applications Journal · 2012
The classical algorithm for mining association rules has low efficiency and high redundancy in the process of generating rules. To solve these problems, a new algorithm of finding non-redundant association rules based on frequent concept lattice is proposed. This concept lattice is generated on the basis of the FP-tree. During building lattice, all of nodes are formated according to the index of items which are found in the fequent-item head table. At the same time these nodes are selected by comparing supports. The Hasse graph is composed. In this graph, the intention of node is frequent itemset and the extension of node is support count of this itemset. And the non-redundant association rules are gained by scanning the leaf nodes of lattice. The simulation shows the feasibility of the algorithm proposed.