Milling of multi-relational association rules

被引：5
|
作者：
Department of Computer Science and Technology, Renmin University of China, Beijing 100872, China [1 ]
不详 [2 ]
不详 [3 ]
机构：
[1] Department of Computer Science and Technology, Renmin University of China
[2] Department of Management Science and Engineering, Tsinghua University
[3] Key Laboratory of Data Engineering and Knowledge Engineering
来源：
Ruan Jian Xue Bao | 2007年 / 11卷 / 2752-2765期
关键词：
Association rule; Data mining; Relational database; Star schema;
D O I：
10.1360/jos182752
中图分类号：
学科分类号：
摘要：
Association rule mining is one of the most important and basic technique in data mining, which has been studied extensively and has a wide range of applications. However, as traditional data mining algorithms usually only focus on analyzing data organized in single table, applying these algorithms in multi-relational data environment will result in many problems. This paper summarizes these problems, proposes a framework for the mining of multi-relational association rule, and gives a definition of the mining task. After classifying the existing work into two categories, it describes the main techniques used in several typical algorithms, and it also makes comparison and analysis among them. Finally, it points out some issues unsolved and some future further research work in this area.
引用
收藏
页码：2752 / 2765
页数：13
相关论文
共 34 条
  • [1] Domingos P., Prospects and challenges for multi-relational data mining, ACM SIGKDD Explorations Newsletter, 5, 1, pp. 80-83, (2003)
  • [2] Agrawal R., Imilienski T., Swami A., Mining association rules between sets of items in large datasets, Proc. of the 1996 ACM SIGMOD lnt'l Conf. on Management of Data, pp. 207-216, (1993)
  • [3] Agrawal R., Srikant R., Fast algorithm for mining association rules, Proc. of the 20th Int'l Conf. on Very Large Data Bases, pp. 487-499, (1994)
  • [4] Mannila H., Toivonen H., Verkamo A.I., Efficient algorithms for discovering association rules, Proc. of the 1994 AAAI Workshop Knowledge Discovery in Databases (KDD'94), pp. 181-192, (1994)
  • [5] Savasere A., Omiecinski E., Navathe S., An efficient algorithm for mining association rules in large databases, Proc. of the 21st Int'l Conf. on VLDB, pp. 432-443, (1995)
  • [6] Han J., Pei J., Yin Y., Mining frequent patterns without candidate generation, Proc. of the 2000 ACM SIGMOD Int'l Conf. on Management of Data, pp. 1-12, (2000)
  • [7] Zaki M.J., Parthasarathy S., Ogihara M., Li W., New algorithms for fast discovery of association rules, Proc. of the 3rd Int'l Conf. on Knowledge Discovery and Data Mining, pp. 283-286, (1997)
  • [8] Grahne G., Zhu J., Efficiently using prefix-trees in mining frequent itemsets, Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI 2003), 90, (2003)
  • [9] Pasquier N., Bastide Y., Taouil R., Lakhal L., Discovering frequent closed itemsets for association rules, Proc. of the 7th Int'l Conf. Database Theory (ICDT'99), pp. 398-416, (1999)
  • [10] Zaki M.J., Hsiao C.J., CHARM: An efficient algorithm for closed association rule mining, (1999)
1234