首页 | 官方网站   微博 | 高级检索  
     

一种否定高信度规则的属性查找算法
引用本文:李莉,邹海. 一种否定高信度规则的属性查找算法[J]. 计算机工程, 2008, 34(6): 65-66
作者姓名:李莉  邹海
作者单位:安徽大学计算机科学与技术学院,合肥,230039;安徽大学计算机科学与技术学院,合肥,230039
摘    要:粗糙集理论中可辨识矩阵是在整个论域U上构造的。该文扩展了可辨识矩阵的应用,提出一种否定高信度决策规则的属性查找算法,求出条件属性和决策属性的不可分辨二元关系在等价类上进行运算。在论域U的子集上构造可辨识矩阵,根据分辨函数求解问题。将算法应用于医学数据。实验结果表明,该算法局部采用可辨识矩阵可以有效地减少存储空间,提高查找效率。

关 键 词:粗糙集  可辨识矩阵  可信度  高信度决策规则
文章编号:1000-3428(2008)06-0065-02
收稿时间:2007-03-30
修稿时间:2007-03-30

Algorithm to Find Attributes Negated High Reliability Decision Rules
LI Li,ZOU Hai. Algorithm to Find Attributes Negated High Reliability Decision Rules[J]. Computer Engineering, 2008, 34(6): 65-66
Authors:LI Li  ZOU Hai
Affiliation:(School of Computer Science and Technology, Anhui University, Hefei 230039)
Abstract:In rough set theory, the discernibility matrix is used on the whole data set. In this paper, the application of extended discernibility matrix is presented. The discernibility matrix can be used to not only the whole data set but also the partial data. An algorithm is introduced, which is used to find the attributes that negate the high reliability decision rules on some condition attributes. It selects anyone among all the condition attributes and decision attributes to calculate its indiscernibility binary relation. The algorithm is based on equivalence classes and uses a part of data of the whole data set to construct the discernibility matrix. The question can be solved by the discernibility function. An experiment with medical data is presented. Experimental results show that the algorithm is more efficient and has less space complexity and time complexity.
Keywords:rough set   discernibility matrix   reliability   high reliability decision rules
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号