摘要
对有序信息表的排序问题进行了研究,在将有序信息表进行转化的基础上,应用粗集理论对信息表进行简化,通过将属性值标准化并构造排序度量函数,提出了一种基于粗集的总体排序算法,与传统算法相比,该算法不需要领域专家的参与,而且有效地降低了时间复杂度.
Ordering objects in ordered information table is researched. The information table is simplified by rough set theory after transforming an ordered information system into a binary one. With the standardization of the attributes and the evaluation function a new algorithm based on rough sets theory is presented . Compared with the former methods this algorithm does not need the participation of the domain experts. In additon,the time eomplexcity is reduced greately.
出处
《河南师范大学学报（自然科学版）》
CAS
CSCD
北大核心
2009年第5期135-136,139,共3页
Journal of Henan Normal University(Natural Science Edition)
基金
河南省自然科学基金(0411010500)
关键词
粗糙集
有序信息表
排序
度量函数
rough set
ordered information table
sorting
evaluation function
