期刊文献+

一种改进的基于区分矩阵的属性约简算法 被引量:2

A new algorithm of attribute reduction based on discernibly matrix
下载PDF
导出
摘要 以属性在区分矩阵中出现的频率作为启发,对HORAFA算法做了一些改进。引入二进制可辨识矩阵,对区分函数进行简化,求出相对核。以相对核为基础,加入属性重要性最大的属性,直到不能再加。在此基础上,加上反向消除的过程,保证了算法的完整性。 The paper learns something from the frequency of attributes appeared in the discernibly matrix, and makes progress on the HORAFA. Lead binary discernibly matrix in, and make the discernibly function more simplify, and then find the core. The algorithm adds the most important attribute into the core until can’t add anymore. Then add a process of backward elimination to make sure the completeness of algorithm.
作者 张永平 李娜
出处 《微计算机信息》 2009年第33期186-188,共3页 Control & Automation
关键词 粗糙集 属性约简 区分矩阵 二进制可辨识矩阵 Rough sets attribute reduction discernibly matrix binary discernibly matrix
  • 相关文献

参考文献5

二级参考文献9

  • 1曾黄麟.粗集理论及其应用[M].重庆:重庆大学出版社,1996..
  • 2Pawlak Z. Rough sets[J]. Computer and Information Sciences, 1982,11:341 -356.
  • 3Pawlak Z. Rough dassification[ J ]. Int J Man-Machine Studies, 1984, 20:469-483.
  • 4Pawlak Z. Rough sets,theoretical aspects of reasoning about data [ A]. Dorderecht: Kluwer Academic Pulishers,1991.
  • 5Skowron A , Rauszer C. The discernibility matrices and functions in information systems[A]. In : Slowinski I. Intelligent decision support- handbook of applications and advances of the Rough Sets theory[C]. Dordrecht: Kluwer Academic Publisher , 1991.331 - 362.
  • 6Agrawal.R, Imielinski.T, Swami.A. Mining association rules between sets of items in large databases[C]. Proceedings of the ACM SIGMOD Conference on Management of data, 1993. 207-216.
  • 7Lin.T.Y. Rough set theory in very large databases [C]. In Proceedings of CESA'96, volume 2, 1996.936-941.
  • 8支天云,苗夺谦.二进制可辨矩阵的变换及高效属性约简算法的构造[J].计算机科学,2002,29(2):140-142. 被引量:79
  • 9杜金莲,迟忠先,翟巍.基于属性重要性的逐步约简算法[J].小型微型计算机系统,2003,24(6):976-978. 被引量:25

共引文献437

同被引文献23

引证文献2

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部