Mining association rules between sets of items in large databases
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
Mining frequent patterns without candidate generation
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
An Efficient Algorithm for Mining Association Rules in Large Databases
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Hi-index | 0.00 |
To increase the efficiency of data mining is the emphasis in this field at present. Aiming at the difficulties of data maintaining and updating in association rule mining FP-growth algorithm, this paper proposes a FP-network model which compresses the data needed in association rule mining in a FP-network. Compared with the primary FP-tree model, FP-network is undirected, which enlarge the scale of transaction storage; furthermore, the FP-network is stored through the definition of transaction-item association matrix, it is convenient to make association rule mining on the basic of defining node capability. Experiment results show that the FP-network mining association rule algorithm proposed by this letter not only inherits the merits of FP-growth algorithm, but also maintains and updates data conveniently. It improves the efficiency of association rule mining.