An efficient graph-based approach to mining association rules for large databases

被引：0
作者：
Department of Computer Science and Engineering, National Sun Yat-Sen University, No. 70 Lienhai Rd., Kaohsiung 80424, Taiwan [1 ]
机构：
[1] Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung 80424
来源：
Int. J. Intell. Inf. Database Syst. | 2009年 / 3卷 / 259-274期
关键词：
Association rules; Data mining; Graph-based mining; Knowledge discovery; Large itemsets;
D O I：
10.1504/IJIIDS.2009.027686
中图分类号：
学科分类号：
摘要：
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. Copyright © 2009, Inderscience Publishers.
引用
收藏
页码：259 / 274
页数：15
相关论文
共 12 条
  • [1] Agrawal R., Srikant R., Fast algorithms for mining association rules, Proc. of the 20th Int. Conf. on Very Large Data Bases, pp. 487-499, (1994)
  • [2] Agrawal R., Srikant R., Mining sequential patterns, Proc. of the 11th Int. Conf. on Data Engineering, pp. 3-14, (1995)
  • [3] Han J., Fu Y., Mining frequent patterns without candidate generation: A frequent-pattern tree approach, Data Mining and Knowledge Discovery, 8, 1, pp. 53-87, (2004)
  • [4] Han J., Cheng H., Xin D., Yan X., Frequent pattern mining: Current status and future directions, Data Mining and Knowledge Discovery, 15, 1, pp. 55-86, (2007)
  • [5] Lee W.P., Introduction to Data Mining, (2007)
  • [6] Liu D.Y., Yang J.H., Thong S.M., Li Z.L., Research on high efficiency algorithm based on graph for mining association rules, Computer Engineering and Design, 27, 23, pp. 4475-4478, (2006)
  • [7] Nanopoulos A., Papadopoulos A.N., Manolopoulos Y., Mining association rule in very large clustered domains, Information Systems, 32, 5, pp. 649-669, (2007)
  • [8] Srikant R., Agrawal R., Mining sequential patterns: Generalizations and performance improvements, Proc. of the 5th Int. Conf. on Extending Database Technology, pp. 3-17, (1996)
  • [9] Wei J.M., Yi W.G., Wang M.Y., Novel measurement for mining effective association rules, Knowledge-Based Systems, 19, 8, pp. 739-743, (2006)
  • [10] Weiss M.A., Data Structure and Algorithm Analysis in C, (1993)
12