序信息系统中优势类的快速算法

Quick Algorithm for Dominance Classes in Ordered Information Systems

基于粗糙集理论,序信息系统主要通过引入优势关系来处理现实中标准属性存在偏好信息的问题。为此,如何高效地计算优势类对提高各相关算法的性能至关重要。针对序信息系统中求解优势类计算耗时过大的缺陷,提出了一种求解优势类的快速计算方法。

In rough set theory,the ordered information system was introduced to deal with the task of attributes with preference information in applications.It is desirable to compute the dominant class in a more efficient way.In this paper,aiming at long time-consuming in computing dominant class in ordered information system,a quick algorithm for the computation of dominant class was proposed.