Covering-based rough sets,as a technique of granular computing,can be a useful tool for dealing with inexact,uncertain or vague knowledge in information systems.Matroids generalize linear independence in vector spaces...Covering-based rough sets,as a technique of granular computing,can be a useful tool for dealing with inexact,uncertain or vague knowledge in information systems.Matroids generalize linear independence in vector spaces,graph theory and provide well established platforms for greedy algorithm design.In this paper,we construct three types of matroidal structures of covering-based rough sets.Moreover,through these three types of matroids,we study the relationships among these matroids induced by six types of covering-based upper approximation operators.First,we construct three families of sets by indiscernible neighborhoods,neighborhoods and close friends,respectively.Moreover,we prove that they satisfy independent set axioms of matroids.In this way,three types of matroidal structures of covering-based rough sets are constructed.Secondly,we study some characteristics of the three types of matroid,such as dependent sets,circuits,rank function and closure.Finally,by comparing independent sets,we study relationships among these matroids induced by six types of covering-based upper approximation operators.展开更多
This paper proposes a novel pair of induced IF covering approximation operators in an IF covering approximation space,and discusses some basic properties about definable IFSs.A measure is defined to describe the uncer...This paper proposes a novel pair of induced IF covering approximation operators in an IF covering approximation space,and discusses some basic properties about definable IFSs.A measure is defined to describe the uncertainty of IFSs in IF covering approximation spaces.Finally,we study the properties of reductions of an IF covering respectively based on induced IF covering approximation operators and IF covering approximation operators.展开更多
基金Supported by the Research Foundation for Middle-aged and Young Scientist of Fujian Province(Grant No.JAT170731)
文摘Covering-based rough sets,as a technique of granular computing,can be a useful tool for dealing with inexact,uncertain or vague knowledge in information systems.Matroids generalize linear independence in vector spaces,graph theory and provide well established platforms for greedy algorithm design.In this paper,we construct three types of matroidal structures of covering-based rough sets.Moreover,through these three types of matroids,we study the relationships among these matroids induced by six types of covering-based upper approximation operators.First,we construct three families of sets by indiscernible neighborhoods,neighborhoods and close friends,respectively.Moreover,we prove that they satisfy independent set axioms of matroids.In this way,three types of matroidal structures of covering-based rough sets are constructed.Secondly,we study some characteristics of the three types of matroid,such as dependent sets,circuits,rank function and closure.Finally,by comparing independent sets,we study relationships among these matroids induced by six types of covering-based upper approximation operators.
基金supported by the National Natural Science Foundation of China(Nos.60773174 and 60963006)Hebei Province Science and Technology Research and Development Program(No.09276158).
文摘This paper proposes a novel pair of induced IF covering approximation operators in an IF covering approximation space,and discusses some basic properties about definable IFSs.A measure is defined to describe the uncertainty of IFSs in IF covering approximation spaces.Finally,we study the properties of reductions of an IF covering respectively based on induced IF covering approximation operators and IF covering approximation operators.
