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

基于粗糙集理论与灰色理论的属性约简算法
引用本文:杜晓,刘维亭,杜茜,罗军生.基于粗糙集理论与灰色理论的属性约简算法[J].微机发展,2008(1):154-156.
作者姓名:杜晓  刘维亭  杜茜  罗军生
作者单位:江苏科技大学电子信息学院 江苏镇江212003(杜晓,刘维亭,罗军生),华中师范大学电子信息工程系 湖北武汉430079(杜茜)
基金项目:江苏省教育资助项目(2005DX006J)
摘    要:约简是粗集理论的重要概念,由定义计算约简是一个典型的NP问题且由于约简的不唯一,在面对大数据集或高维数据集问题时获得的属性集往往并非是最小的属性约简集。文中针对Rough sets理论的属性约简进行了研究。研究了通过可辨识矩阵求得属性约简集,利用Rough sets与灰色理论相结合,提出一种属性约简的启发式算法,拟合结果表明本约简算法合有效。

关 键 词:Rough  SETS理论  属性约简  分辨矩阵  灰色关联

Algorithm for Attributes Reduction Based on Rough Set Theory and Gray Theory
DU Xiao,LIU Wei-ting,DU Qian,LUO Jun-sheng.Algorithm for Attributes Reduction Based on Rough Set Theory and Gray Theory[J].Microcomputer Development,2008(1):154-156.
Authors:DU Xiao  LIU Wei-ting  DU Qian  LUO Jun-sheng
Affiliation:DU Xiao1,LIU Wei-ting1,DU Qian2,LUO Jun-sheng1
Abstract:Reduction is an important concept in rough set theory, while computing reduction according to the definitions directly is a typical NP problem.The attribute set get from the problem with large and high-dimension database is not usually the minimum attribute set.Discusses the approaches for attribute reduction based on rough set theory.Following,studies the approaches to achieve attribute reduction set by applying recognized matrix.Researched how to get attribute reductions through discernibility matrix,combined rough sets and gray theory,and put forward a new heuristics algorithm for attribute reduction.The effectiveness of the result obtained is demonstrated by an example.
Keywords:rough sets theory  attribute reductions  discernibility matrix  gray relation
本文献已被 CNKI 维普 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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