The full text of this article

 

An efficient graph-based approach to mining association rules for large databases
by Lee-Wen Huang, Ye-In Chang
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 3, No. 3, 2009

 

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.

Online publication date: Fri, 07-Aug-2009

 

is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

 
Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

 
Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:

 

    Username:        Password:         

Forgotten your password?


 
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

 
If you still need assistance, please email subs@inderscience.com