摘要
结合图的顶点覆盖理论,探讨了悲观多粒度粗糙集粒度约简的新方法。首先提出悲观多粒度粗糙集诱导图的概念,并给出其粒度约简的图特征,在此基础上,以图的方法刻画粒度的重要度,进而设计基于图的悲观多粒度粗糙集粒度约简的算法;其次,定义悲观多粒度决策粗糙集诱导图的概念,类似地给出其粒度约简的图特征和粒度重要度,设计基于图的悲观多粒度决策粗糙集粒度约简的算法;最后,利用实例说明悲观下近似多粒度粗糙集粒度约简算法的合理性。
This paper combines the theory of the vertex cover of graph,and a new method of the granularity reduction of pessimistic multi-granulation rough set is discussed.Firstly,the concept of the graph induced from pessimistic multi-granulation rough set is presented,and the graph characteristic of its granularity reduction is given.On this basis,the significance of granularity is depicted by the method of graph,and then a algorithm about granularity reduction of pessimistic multi-granulation rough set based on graph is designed.Secondly,the concept of the graph induced from multi-granulation decision-theoretic rough set is defined,the graph characteristic of its granularity reduction and the significance of granularity are proposed at the same way,then a algorithm of granularity reduction of pessimistic multi-granulation decision-theoretic rough set based on graph is designed.Finally,it is rational to give an example to illustrate the pessimistic lower approximate multi-granulation rough set algorithm.
作者
张文娟
李进金
林艺东
ZHANG Wen-juan;LI Jin-jin;LIN Yi-dong(School of Mathematics and Statistics,Minnan Normal University,Zhangzhou 363000,Fujian,China;School of Mathematical Sciences,Xiamen University,Xiamen 361000,Fujian,China)
出处
《山东大学学报（理学版）》
CAS
CSCD
北大核心
2021年第1期60-67,共8页
Journal of Shandong University(Natural Science)
基金
国家自然科学基金资助项目(11871259,11701258)
福建省自然科学基金重点项目(2019J01748,2017J01507,2020J02043)。
关键词
粒度约简
图论
多粒度粗糙集
顶点覆盖
granularity reduction
graph theory
multi-granulation rough set
vertex cover
