基于置信优势关系的粗糙集近似模型  

Confidential dominance relation based rough approximation model

作　　者：苟光磊[1,2,3] 王国胤[1,2] 利节[2] 吴迪[2] 

机构地区：[1]西南交通大学信息科学与技术学院,成都610031 [2]中国科学院重庆绿色智能技术研究院,重庆401122 [3]重庆理工大学计算机科学与工程学院,重庆400054

出　　处：《控制与决策》2014年第7期1325-1329,共5页Control and Decision

基　　金：国家自然科学基金项目(61073146);重庆市自然科学基金项目(cstc2012jjA40032)

摘　　要：不完备有序信息处理是现实生活中的常见问题.多种拓展优势关系及其粗糙集模型被提出并用于解决不完全的偏好决策问题,但均未考虑序关系特性,与现实语义存在矛盾.对此,提出一种置信优势关系及其粗糙集近似模型,讨论了基于置信优势关系的粗糙集模型与已有模型的关系.与现有的拓展关系相比,该置信优势关系满足序关系特性,避免了语义上的矛盾.定理证明和实例分析表明,置信优势关系粗糙集近似模型的近似精度和分类精度更优.Incomplete ordered information processing is a common problem in the real life. Various extended dominance relation rough set models are already proposed to solve the incomplete ordinal decision problem. But there exits some ambivalence over the real semantics because the characteristics of the order relation are not considered. Therefore, the confidence dominance relation and its rough set approximation model are presented. Relationships between the confidential dominance relation based rough set model and existing models are discussed. Compared with the current expansion relations, confidence dominance relation fits the characteristics of the order relation to avoid semantic contradiction. Theorem proving and example analysis show that the confidential dominance relation based rough approximation model has better approximate accuracy and classification accuracy.

关 键 词：不完备序信息系统 粗糙集 拓展优势关系 置信优势关系 

分 类 号：TP520.60[自动化与计算机技术]