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

一种基于序列数的关联规则挖掘算法
引用本文:王仕平,蒋玲,熊江,方刚.一种基于序列数的关联规则挖掘算法[J].西南农业大学学报,2011,33(3).
作者姓名:王仕平  蒋玲  熊江  方刚
作者单位:成都大学信息科学与技术学院;成都大学实验技术中心;重庆三峡学院计算机科学系;
基金项目:重庆市教委科技资助项目(KJ091108)
摘    要:在关联规则挖掘研究中,为了在产生候选频繁项时减少算法存在的重复计算和冗余候选项,为了在计算支持数时减少扫描事务数据库的次数,提出了一种基于序列数的关联规则挖掘算法,其关联规则适合挖掘任何长度.该算法用事务属性的布尔约简法,将传统事务数据转换成二进制数,然后用数字的递增和递减两种方式双向搜索候选频繁项;算法通过序列数的度来计算支持数,实现一次扫描数据库,有效地提高了算法的效率.

关 键 词:数据挖掘  关联规则  布尔约简法  双向搜索  序列数  

An Algorithm of Association Rule Mining Based on Sequence Number
WANG Shi-ping,JIANG Ling,XIONG Jiang,FANG Gang .School of Information Science , Technology,Chengdu University,Chengdu ,China.An Algorithm of Association Rule Mining Based on Sequence Number[J].Journal of Southwest Agricultural University,2011,33(3).
Authors:WANG Shi-ping  JIANG Ling  XIONG Jiang  FANG Gang School of Information Science  Technology  Chengdu University  Chengdu  China
Institution:WANG Shi-ping1,JIANG Ling2,XIONG Jiang3,FANG Gang3 1.School of Information Science and Technology,Chengdu University,Chengdu 610106,China,2.Center of Experimert Technology,3.Department of Computer Science,Chongqing Three Gorges College,Wanzhou Chongqing 404000
Abstract:In association rule mining research,in order to reduce repeated computing and redundant candidate of algorithm when generating candidate frequent itemsets,and to reduce the time of repeated scanning of transaction database when computing support,an algorithm of association rule mining based on sequence number is presented,which is suitable for mining any long association rules.The algorithm uses Boolean reduction of transaction attributes to turn traditional transaction data into binary,and then uses two wa...
Keywords:data mining  association rule  Boolean reduction  double search  sequence number  
本文献已被 CNKI 等数据库收录!
点击此处可从《西南农业大学学报》浏览原始摘要信息
点击此处可从《西南农业大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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