节点文献

基于确信因子的有效关联规则挖掘

Mining Efficient Association Rules Based on CF Gene

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 吴良杰刘红祥况振东

【Author】 Wu Liangjie Liu Hongxiang Kuang Zhendong(College of Computer Science and Technology,Harbin Engineering University,Harbin150001)

【机构】 哈尔滨工程大学计算机科学与技术学院哈尔滨工程大学计算机科学与技术学院 哈尔滨150001哈尔滨150001哈尔滨150001

【摘要】 通过对现有的关联规则算法分析与研究发现,生成的关联规则具有相大的冗余性,且可能是无趣的,甚至是虚假的,为此人们主要提出了兴趣度作为有效规则评判标准。该文在先前研究的基础上,以确信因子为基础,提出确信度来使规则的有效性判断更加客观、合理。同时在算法中引入规则取舍,提高了挖掘有效规则的效率。

【Abstract】 By analyzing and studying the most current algorithms about mining association rules,people find that gener-ated association rules are quite redundant ,and many rules,which possess high support and confidence are uninteresting,and even are false.Therefore,interest measurer is introduced to enchance the validity of association rules.Based on the previous work,this paper proposes CF measure and put s it as threshold to mine valuable rules.At the same time ,this paper establishes a theory architecture to accept or reject or reserve synchronously a pair of rules by analyzing CF gene,and introduces it to the algorithms.Finally,this algorithms is evaluated and is more efficient through experiments.

【关键词】 数据挖掘关联规则确信因子
【Key words】 data miningassociation rulesCF gene
  • 【文献出处】 计算机工程与应用 ,Computer Engineering and Applications , 编辑部邮箱 ,2004年32期
  • 【分类号】TP311
  • 【被引频次】5
  • 【下载频次】99
节点文献中: 

本文链接的文献网络图示:

本文的引文网络