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

一种挖掘数值属性的二维优化关联规则方法
引用本文:贺志,田盛丰,黄厚宽.一种挖掘数值属性的二维优化关联规则方法[J].软件学报,2007,18(10):2528-2537.
作者姓名:贺志  田盛丰  黄厚宽
作者单位:北京交通大学,计算机与信息技术学院,人工智能实验室,北京,100044
摘    要:优化关联规则允许在规则中包含未初始化的属性.优化过程就是确定对这些属性进行初始化,使得某些度量最大化.最大化兴趣度因子用来发现更加有趣的规则;另一方面,允许优化规则在前提和结果中各包含一个未初始化的数值属性.对那些处理一个数值属性的算法进行直接的扩展,可以得到一个发现这种优化规则的简单算法.然而这种方法的性能很差,因此,为了改善性能,提出一种启发式方法,它发现的是近似最优的规则.在人造数据集上的实验结果表明,当优化规则包含两个数值属性时,优化兴趣度因子得到的规则比优化可信度得到的规则更有趣.在真实数据集上的实验结果表明,该算法具有近似线性的可扩展性和较好的精度.

关 键 词:优化规则  关联规则  兴趣度  启发式方法  近似
收稿时间:2005-07-24
修稿时间:6/6/2006 12:00:00 AM

An Approach to Mining Two-Dimensional Optimized Association Rules for Numeric Attributes
HE Zhi,TIAN Sheng-Feng and HUANG Hou-Kuan.An Approach to Mining Two-Dimensional Optimized Association Rules for Numeric Attributes[J].Journal of Software,2007,18(10):2528-2537.
Authors:HE Zhi  TIAN Sheng-Feng and HUANG Hou-Kuan
Affiliation:School of Computer and Information Technology, Beijing Jiaotong University, Beijing 100044, China
Abstract:Optimized association rules are permitted to contain uninstantiated attributes.The optimization procedure is to determine the instantiations such that some measures of the roles are maximized.This paper tries to maximize interest to find more interesting rules.On the other hand,the approach permits the optimized association rule to contain uninstantiated numeric attributes in both the antecedence and the consequence.A naive algorithm of finding such optimized rules can be got by a straightforward extension of the algorithm for only one numeric attribute.Unfortunately,that results in a poor performance.A heuristic algorithm that finds the approximate optimal rules is proposed to improve the performance.The experiments with the synthetic data sets show the advantages of interest over confidence on finding interesting rules with two attributes.The experiments with real data set show the approximate linear scalability and good accuracy of the algorithm.
Keywords:optimized rule  association rule  interest  heuristic  approximation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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