基于Roughset的有序信息表的排序问题研究  

Ordering objects in ordered information table based on rough set theory

作　　者：李明[1] 张保威[1] 

机构地区：[1]兰州理工大学计算机与通信学院,甘肃兰州730050

出　　处：《计算机应用》2005年第11期2645-2646,2664,共3页journal of Computer Applications

基　　金：甘肃省教育厅科技基金项目(0416B_04)

摘　　要：针对有序信息表的排序问题,提出了总体排序的过程框架。将有序信息表转化为二进制信息表,运用粗糙集理论对信息表进行简化,在对属性值标准化的基础上构造有序信息表中实体的排序度量函数,根据度量函数值的大小进行排序。实例表明该过程框架在误差允许范围内是有效可行的。Aiming at ordering objects in ordered information table, a framework based on rough set theory was proposed. An information system was firstly transformed into a binary one which would be simplified by rough set theory. According to the values of the weight function, the objects in the original information tables could be sorted. Experiments illustrate that the framework is feasible and effective.

关 键 词：粗糙集 有序信息表 属性约简 排序 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论]