基于直觉模糊粗糙集的属性约简

针对Jensen下近似定义的局限性,提出一种新的等价类形式的近似算子表示,并将其推广到直觉模糊环境.在此基础上,将相对正域,相对约简,相对核等粗糙集的知识约简概念推广到直觉模糊环境,提出一种直觉模糊信息系统的启发式属性约简算法.实例计算表明,该方法比Jensen的属性约简方法更为合理有效.

     

一种改进的模糊粗糙集知识约简方法

针对模糊信息系统,通过分析R.Jensen所定义近似算子的松散性,构造了一种严格状态下的近似算子,该算子可以保证下近似随信息系统中属性个数的增加而单调递增;在此基础上,对模糊信息系统的相对约简概念进行了定义,应用所定义依赖度提出了一种模糊信息系统的启发式知识约简算法;将该方法应用于目标威胁等级评估信息系统的知识约简,计算结果验证了该方法的有效性。     

基于多粒度粗糙直觉犹豫模糊集的最优粒度选择方法

为了对含有多属性的直觉犹豫模糊决策信息系统进行约简,获取最优粒度,运用多粒度粗糙集处理直觉犹豫模糊决策信息系统中的不确定信息,并对多粒度粗糙直觉犹豫模糊集的最优粒度选择方法进行了研究.首先,在直觉犹豫模糊集的基础上引入属性信息,给出粗糙直觉犹豫模糊集的概念,提出乐观、悲观多粒度粗糙直觉犹豫模糊集的下、上近似这4种模型,且研讨了它们的性质.其次,主要定义了基于悲观多粒度粗糙直觉犹豫模糊集下近似的粒度质量相似度和内、外粒度重要度的计算公式,设计了其最优粒度选择算法.最后,通过葡萄酒测评的案例,分别基于乐观、悲观多粒度粗糙直觉犹豫模糊集的下、上近似这4种情况,计算出最优粒度并进行了分析,验证了该算法在直觉犹豫模糊决策信息系统中的约简是有效的.     

优势关系下直觉模糊目标信息系统的上近似约简

传统的粗糙集理论对决策属性值为直觉模糊数的直觉模糊目标信息系统不能直接属性约简.文中在直觉模糊目标信息系统中引入优势关系,基于优势关系定义条件属性集的上近似决策协调集,给出上近似约简的判定定理,建立该信息系统条件属性集的上近似约简模型,并给出上近似约简的算法步骤.在决策属性值为直觉模糊数的一些目标信息系统中,利用条件属性集的上近似约简,可得到更为简洁的决策规则.最后给出一个实例验证算法的有效性.     

基于变精度粗糙直觉模糊集的决策规则获取

以直觉模糊目标信息系统为研究对象,以粗糙集和直觉模糊集为工具,以知识发现为目的,给出了从直觉模糊决策表中获取决策规则的一种有效方法。即通过对Pawlak粗糙隶属函数的定义进行推广,给出粗糙直觉模糊隶属函数,利用新的粗糙隶属函数,建立了变精度粗糙直觉模糊集模型。在此模型基础上定义了变精度粗糙直觉模糊集的近似质量和近似约简,由近似约简导出概率决策规则集,从而给出了直觉模糊决策表的概率决策规则获取方法。最后,以实例说明了这一方法的有效性。关键词：     

基于覆盖的直觉模糊粗糙集

通过直觉模糊覆盖概念将覆盖粗糙集模型进行推广,提出一种基于直觉模糊覆盖的直觉模糊粗糙集模型.首先,介绍了直觉模糊集、直觉模糊覆盖和直觉模糊逻辑算子等概念;然后,利用直觉模糊三角模和直觉模糊蕴涵,构建两对基于直觉模糊覆盖的下直觉模糊粗糙近似算子和上直觉模糊粗糙近似算子;最后,给出了这些算子的基本性质并研究了它们之间的对偶性.     

基于粗糙集的直觉模糊TOPSIS多属性决策方法

针对属性值为直觉模糊信息且属性权重完全未知的多属性决策问题,提出了一种基于粗糙集的直觉模糊TOPSIS多属性决策方法.首先给出了直觉模糊信息的正、负理想点的求法,根据属性值与理想点的贴近度和给定的阈值求得判断矩阵,再根据判断矩阵对属性约简,确定各属性的权重,最后依据TOPSIS思想计算各方案与理想点的加权贴近度,得到方案的排序,并通过算例的分析比较验证了此方法的有效性.     

基于包含度的直觉模糊粗糙集模型

将直觉模糊包含度引入粗糙集与直觉模糊集的融合建模。首先,介绍直觉模糊集在特殊格L上的定义;其次,将模糊包含度拓展到直觉模糊环境下,提出取值于特殊格L的直觉模糊包含度定义和计算公式;在此基础上,分别利用直觉模糊包含度的隶属度与非隶属度定义了上下近似算子,建立了直觉模糊相似关系下的直觉模糊粗糙集模型,并对近似算子的重要性质进行了证明。     

一种直觉模糊粗糙集属性约简新算法

将信息熵理论与直觉模糊粗糙集结合起来,提出一种基于互信息的直觉模糊粗糙集属性约简新算法.给出了在直觉模糊环境下,基于互信息的属性重要度和属性依赖度的度量准则.本文所提出的算法以属性重要度和依赖度为双重度量标准,采取可增可删的双向回归算法,在保持分类精度不变的情况下,最后得到决策表的最小属性约简.实例表明在多属性的决策表约简中,在本文提出的算法得到的属性约简的基础上而得到的决策规则是较简捷、较完备的.     

可变直觉模糊多粒度粗糙集模型及其近似分布约简算法

为了在多粒度粗糙集模型中对目标概念达到更好的近似逼近效果,首先将直觉模糊粗糙集与多粒度粗糙集结合,提出直觉模糊多粒度粗糙集模型。由于该模型的目标近似存在过于宽松的缺陷,因此通过引入参数的方式对所提模型进行改进,提出一种可变直觉模糊多粒度粗糙集模型,并证明了该模型的有效性,同时基于该模型提出了相应的近似分布约简算法。在仿真实验结果中,所提出的下近似分布约简结果比已提出的模糊多粒度决策理论粗糙集约简和多粒度双量化决策理论粗糙集多了2~4个属性,所提出的上近似分布约简算法比这些算法少了1~5个属性,同时约简结果的近似精度拥有了更为合理且优越的表现。因此,理论和实验结果均验证了所提的可变直觉模糊多粒度粗糙集模型在近似逼近和数据降维方面均具有更高的优越性。     

Characterization of rough set approximations in Atanassov intuitionistic fuzzy set theory

The primitive notions in rough set theory are lower and upper approximation operators defined by a fixed binary relation and satisfying many interesting properties. Many types of generalized rough set models have been proposed in the literature. This paper discusses the rough approximations of Atanassov intuitionistic fuzzy sets in crisp and fuzzy approximation spaces in which both constructive and axiomatic approaches are used. In the constructive approach, concepts of rough intuitionistic fuzzy sets and intuitionistic fuzzy rough sets are defined, properties of rough intuitionistic fuzzy approximation operators and intuitionistic fuzzy rough approximation operators are examined. Different classes of rough intuitionistic fuzzy set algebras and intuitionistic fuzzy rough set algebras are obtained from different types of fuzzy relations. In the axiomatic approach, an operator-oriented characterization of rough sets is proposed, that is, rough intuitionistic fuzzy approximation operators and intuitionistic fuzzy rough approximation operators are defined by axioms. Different axiom sets of upper and lower intuitionistic fuzzy set-theoretic operators guarantee the existence of different types of crisp/fuzzy relations which produce the same operators.     

On generalized intuitionistic fuzzy rough approximation operators

In rough set theory, the lower and upper approximation operators defined by binary relations satisfy many interesting properties. Various generalizations of Pawlak’s rough approximations have been made in the literature over the years. This paper proposes a general framework for the study of relation-based intuitionistic fuzzy rough approximation operators within which both constructive and axiomatic approaches are used. In the constructive approach, a pair of lower and upper intuitionistic fuzzy rough approximation operators induced from an arbitrary intuitionistic fuzzy relation are defined. Basic properties of the intuitionistic fuzzy rough approximation operators are then examined. By introducing cut sets of intuitionistic fuzzy sets, classical representations of intuitionistic fuzzy rough approximation operators are presented. The connections between special intuitionistic fuzzy relations and intuitionistic fuzzy rough approximation operators are further established. Finally, an operator-oriented characterization of intuitionistic fuzzy rough sets is proposed, that is, intuitionistic fuzzy rough approximation operators are defined by axioms. Different axiom sets of lower and upper intuitionistic fuzzy set-theoretic operators guarantee the existence of different types of intuitionistic fuzzy relations which produce the same operators.     

On intuitionistic fuzzy rough sets and their topological structures

In this paper, lower and upper approximations of intuitionistic fuzzy sets with respect to an intuitionistic fuzzy approximation space are first defined. Properties of intuitionistic fuzzy approximation operators are examined. Relationships between intuitionistic fuzzy rough set approximations and intuitionistic fuzzy topologies are then discussed. It is proved that the set of all lower approximation sets based on an intuitionistic fuzzy reflexive and transitive approximation space forms an intuitionistic fuzzy topology; and conversely, for an intuitionistic fuzzy rough topological space, there exists an intuitionistic fuzzy reflexive and transitive approximation space such that the topology in the intuitionistic fuzzy rough topological space is just the set of all lower approximation sets in the intuitionistic fuzzy reflexive and transitive approximation space. That is to say, there exists an one-to-one correspondence between the set of all intuitionistic fuzzy reflexive and transitive approximation spaces and the set of all intuitionistic fuzzy rough topological spaces. Finally, intuitionistic fuzzy pseudo-closure operators in the framework of intuitionistic fuzzy rough approximations are investigated.     

On intuitionistic fuzzy topologies based on intuitionistic fuzzy reflexive and transitive relations

Topologies and rough set theory are widely used in the research field of machine learning and cybernetics. An intuitionistic fuzzy rough set, which is the result of approximation of an intuitionistic fuzzy set with respect to an intuitionistic fuzzy approximation space, is an extension of fuzzy rough sets. For further studying the theories and applications of intuitionistic fuzzy rough sets, in this paper, we investigate the topological structures of intuitionistic fuzzy rough sets. We show that an intuitionistic fuzzy rough approximation space can induce an intuitionistic fuzzy topological space in the sense of Lowen if and only if the intuitionistic fuzzy relation in the approximation space is reflexive and transitive. We also examine the sufficient and necessary conditions that an intuitionistic fuzzy topological space can be associated with an intuitionistic fuzzy reflexive and transitive relation such that the induced lower and upper intuitionistic fuzzy rough approximation operators are, respectively, the intuitionistic fuzzy interior and closure operators of the given topology.     

基于双论域粗糙集的快捷货物运输方案选择

针对多种不确定因素下的快捷货物运输方案决策问题,提出一种基于双论域直觉模糊粗糙集的快捷货物运输方案决策模型与决策规则。依据双论域直觉模糊粗糙集理论来确定快捷货物运输方案决策的双论域模糊近似空间。将固定成本、运输成本、转运成本、碳排放、转运时间等评价指标的消耗程度视为直觉模糊数,利用评价指标与运输方案之间的直觉模糊关系计算求得下近似集与上近似集,并引入最大直觉性指标及海明贴近度得出运输方案决策规则。以兰州至北京的一条快捷货物运输线路为例,依据决策规则从公路、普铁、航空组合出的9种运输方式中选择出最优运输方案。对运输成本、转运成本进行灵敏度分析以验证结果的准确性。最终选择出的两种最优运输方案表明了双论域直觉模糊粗糙集在此类问题上的适用性。     

Soft rough fuzzy sets and soft fuzzy rough sets

Fuzzy set theory, soft set theory and rough set theory are mathematical tools for dealing with uncertainties and are closely related. Feng et al. introduced the notions of rough soft set, soft rough set and soft rough fuzzy set by combining fuzzy set, rough set and soft set all together. This paper is devoted to the further discussion of the combinations of fuzzy set, rough set and soft set. A new soft rough set model is proposed and its properties are derived. Furthermore, fuzzy soft set is employed to granulate the universe of discourse and a more general model called soft fuzzy rough set is established. The lower and upper approximation operators are presented and their related properties are surveyed.     

基于θ算子的变精度直觉模糊粗糙集*

在模糊近似空间中,结合直觉模糊集的隶属度、非隶属度与模糊蕴涵算子,提出基于θ算子和θ^算子的直觉模糊集及其隶属度和非隶属度的概念,并证明它们一系列性质.然后,结合直觉模糊集与变精度粗糙集,定义基于θ算子的变精度直觉模糊粗糙集,提出求解变精度粗糙集阈值参数β的方法,使用算例分析该方法.