J4

• 计算机科学 • 上一篇    下一篇

一种扩展的关联规则挖掘算法

胡陈勇1,2, 刘大有1, 刘亚波1   

  1. 1. 吉林大学 计算机科学与技术学院, 长春 130012; 2. 中国科学院软件研究所, 北京 100080
  • 收稿日期:2004-04-08 修回日期:1900-01-01 出版日期:2005-03-26 发布日期:2005-03-26
  • 通讯作者: 刘大有

Mining Algorithm of Extended Association Rule

HU Chen-yong1,2, LIU Da-you1, LIU Ya-bo1   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China;2. Institute of Software, Chinese Academy of Sciences, Beijing 100080, China
  • Received:2004-04-08 Revised:1900-01-01 Online:2005-03-26 Published:2005-03-26
  • Contact: LIU Da-you

摘要: 提出一种扩展的关联规则挖掘算法, 该算法扩展了传统 算法都是针对二元数据矩阵的缺点, 引入了挖掘量化的关联规则, 通过试验发现, 该算法同样适用于传统的布尔矩阵. 该算法主要是基于主成分分析法发现数据中特征向量的思想来挖掘数据中的量化关联, 同时定义了比例项目集. 该算法在时空复杂性上也取得了较好的效果

关键词: 关联规则, 主成分分析, 奇异值分解, 比例项目集

Abstract: In this paper is proposed a new method for mining quantitative association rules by means of principal component analysis. In contrast to traditional Boolean data matrix, our algorithm is based on quantitative datab ase, which contains some value knowledge for us. The experiment illustrated that the algorithm also works well on canal binary data matrices. Based on the idea of principal component analysis (PCA) discovering the principal component as quantitative association, the ratio item set is definited as well. In additional, it is shown that for the treatment of the complexity of time and space the method is more effective than traditional methods.

Key words: association rules, principal component analysis, singul ar value decomposition, ratio item set

中图分类号: 

  • TP311