期刊文献+

基于频繁集的多层次交互式关联规则挖掘 被引量:5

Frequent Itemsets-Based Multiple-Level Interesting Association Rules Mining
在线阅读 下载PDF
导出
摘要 文章研究了一种知识发现与数据挖掘中关联规则的发现方法。针对现有大型超市销售事务数据库 ,提出了一种新的多层次信息获取方法。运用关联规则挖掘所产生的频繁集对数据压缩表示 ,并给出了按用户的实际需求交互式挖掘感兴趣关联规则的算法。该算法在挖掘速度和效率上有较大提高。 A novel algorithm to discover association rules in Knowledge Discovery and Data Mining is presented. According to the current large-scale supermarket transaction data set, a new multiple-level taxonomy is proposed. The frequent itemsets obtained when identifying association rules can be used to compress the data set. Then, an algorithm, which is based on the frequent itemsets, ispresented to find the interesting rules interactively with the users' practicalneeds.Therefore, mining process and efficiency are greatly improved.
作者 赵奕 施鹏飞
出处 《微电子学与计算机》 CSCD 北大核心 2000年第3期54-58,共5页 Microelectronics & Computer
基金 国家自然科学基金!(69835010)
关键词 频繁集 多层次信息 关联规则 数据挖掘 数据库 Frequent itemset,Multiple-level taxonomy,Interactive,Association rules
  • 相关文献

参考文献1

  • 1Han J,Proc 21st Intl Conf Very Large Data Bases,1995年,9期,420页

同被引文献21

  • 1熊金志,李广明,高晓雷,牛熠.一阶多项式光滑的支持向量分类机的一般模型[J].计算机工程与应用,2007,43(10):76-78. 被引量:5
  • 2Han J,Kamber M. Data Mining:Concepts and Techniques[M]. San Mateo, CA: Morgan Kaufmann, 2000.
  • 3Agrawal R,Srikant S. Fast Algorithms for Mining Association Rules in Large Databases[A]. In: Proc. of the 20th Intl. Conf. on Very Large Data Bases[C]. Morgan Kaufman, 1994. 487-499.
  • 4Park J S,Chen M S,Yu P S. An effective hash-based algorithm for mining association rules[A]. In: Proc. 1995 ACM SIGMOD Intl. Conf. Management of Data[C]. SanJose,CA, 1995. 175-186.
  • 5Savasere A,Omiecinski E, Navathe S. An efficient algorithm for mining association rules[A]. In: Proc. of the 21st Intl. Conf. on Very Large Databases [C]. Zurich,Switzerland, 1995. 432- 444.
  • 6Toivonen H. Sampling large databases for association rules[A]. In: Proc. of the 22nd Intl. conf. on Very Large Databases[C]. Mumbai, India, 1996. 134- 145.
  • 7Han J, Pci J, Yin Y. Mining frequent patterns without candidate generation[A]. In: Proc. of the 2000 ACM SIGMOD Intl. Conf. on Management of Data[C]. Dalas, TX,2000.
  • 8Chen M S, Han J W. Data mining:an overview from database perspective[J]. IEEE Transactions on Knowledge and Data Engineering, 1996,8(6) :866-883.
  • 9Bayardo R J, Agrawal R, Gunopulos D. Constraint-based rule mining in large, dense databases[A]. In: Proc. of the 15th Int 1 Conf. on Data Engineering[C]. Sydney, Austratia, 1999.88- 197.
  • 10赵俊杰,胡学钢.基于文本分类的文档相似度计算[J].微型电脑应用,2008,24(12):46-47. 被引量:6

引证文献5

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部