首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于记录对比的关联规则挖掘算法设计
引用本文:钟云,陆鑫.基于记录对比的关联规则挖掘算法设计[J].实验科学与技术,2006,4(2):48-51.
作者姓名:钟云  陆鑫
作者单位:电子科技大学,成都,610054
摘    要:介绍了数据挖掘及关联规则的基本概念、数据挖掘算法设计的基本方法、现在流行的基于“支持-可信度”的经典关联规则挖掘算法,有针对性地指出了基于“支持度-可信度”的关联规则挖掘算法的诸多不足之处,在此基础上提出了基于记录对比的关联规则算法设计思想。该算法不再认为数据源中的备条记录是独立的,而认为可以通过记录对比,从记录与记录的差异中,找出某种潜在的关系。最后对基于记录对比的关联规则挖掘算法和基于“支持度-可信度”的关联规则挖掘算法进行了对比分析。

关 键 词:数据挖掘  关联规则  算法
文章编号:1672-4550(2006)02-0048-04
收稿时间:2005-11-05
修稿时间:2005-12-09

Designing Association-Rule Algorithms on Data Mining Based on the Relation of the Records
ZHONG Yun,LU Xin.Designing Association-Rule Algorithms on Data Mining Based on the Relation of the Records[J].Experiment Science & Technology,2006,4(2):48-51.
Authors:ZHONG Yun  LU Xin
Institution:University of Electronic Science and Technology of China Chengdu 610054
Abstract:This paper introduces the perception of Data Mining and Association rule, the way of designing Data Mining Algorithms, and some shortcomings of the classical algorithms. Then, it comes up with the new algorithms of Data Mining based on the relation of the records of the data source. Working with this algorithm, the information and association rules will always be considered among the relations of the recorded data source. Eventually, this new algorithm is compared with classical algorithms.
Keywords:data mining  association rules  algorithms
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号