An efficient graph-based approach to mining association rules for large databases. (13th August 2009)

• Record Type: Journal Article
• Authors: Huang, Lee-Wen; Chang, Ye-In
• Is Part Of: International journal of intelligent information and database systems. Volume 3:Number 3(2009)
• Page Start: 259
• Page End: 274
• Publication Date: 2009-08-13
• Subjects: association rules -- data mining -- graph-based mining -- large itemsets -- knowledge discovery; Database management -- Computer programs -- Periodicals; Information retrieval -- Computer programs -- Periodicals; Information storage and retrieval systems -- Computer programs -- Periodicals; Artificial intelligence -- Periodicals; Expert systems (Computer science) -- Periodicals; Intelligent agents (Computer software) -- Periodicals; 006.33
• Languages: English
• ISSNs: 1751-5858

Abstract

The task of data mining is to find the useful information within the incredible sets of data. One of important research areas of data mining is mining association rules. If we can find these relations by mining association rules, we can provide better selling strategy to gain more customers' attentions. However, in some applications, the large itemsets may not always correlate with each other. In this paper, we propose a new graph-based algorithm to discover the association rules. It represents the large itemsets as a graph, which constructs a graph based on L2. Then, by dividing the items to several groups, the association rule can be mined efficiently. We conduct several experiments using different synthetic transaction databases. The simulation results show that the GAR algorithm outperforms the FP-growth algorithm in the execution time for all transaction databases.