作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2007, Vol. 33 ›› Issue (10): 34-35,6. doi: 10.3969/j.issn.1000-3428.2007.10.012

• 软件技术与数据库 • 上一篇    下一篇

一种量化关联规则挖掘算法

佟 强1,3,周园春1,3,吴开超1,2,3,阎保平2   

  1. (1. 中国科学院计算技术研究所,北京 100080;2. 中国科学院计算机网络信息中心,北京 100080;3. 中国科学院研究生院,北京 100080)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2007-05-20 发布日期:2007-05-20

A Method for Mining Quantitative Association Rules

TONG Qiang1,3, ZHOU Yuanchun1,3, WU Kaichao1,2,3 , YAN Baoping2   

  1. (1. Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080; 2. Computer Network Information Center, Chinese Academy of Sciences, Beijing 100080; 3. Graduate School, Chinese Academy of Sciences, Beijing 100080)
  • Received:1900-01-01 Revised:1900-01-01 Online:2007-05-20 Published:2007-05-20

摘要: 提出了一种新的挖掘量化关联规则的方法。该方法使用聚类算法把数据库中的交易记录分成若干个簇,把簇投影到数值型属性所在的域,形成重叠的、有意义的区间。实验结果显示,这种方法能够有效地挖掘量化关联规则,并且能够发现以前的算法可能遗漏的重要的规则。

关键词: 数据挖掘, 量化关联规则, 频集, 聚类

Abstract: This paper proposes a novel method to find quantitative association rules by clustering the transactions of a database into clusters and projecting them into the domains of the quantitative attributes to form meaningful intervals which may be overlapped. Experimental results show the method can efficiently find quantitative association rules, and can find important association rules which may be missed by the previous algorithms.

Key words: Data mining, Quantitative association rule, Frequent set, Cluster

中图分类号: