覆盖粗糙直觉模糊集模型的研究

粗糙集和直觉模糊集的融合是一个研究热点。在粗糙集、直觉模糊集和覆盖理论基础上,给出了模糊覆盖粗糙隶属度和非隶属度的定义。考虑到元素自身与最小描述元素的隶属度和非隶属度之间的关系,构建了两种新的模型——覆盖粗糙直觉模糊集和覆盖粗糙区间值直觉模糊集,证明了这两种模型的一些重要性质,与此同时定义了一种新的直觉模糊集的相似性度量公式,并用实例说明其应用。     

基于一种新的核函数的模糊粗糙集

模糊粗糙集作为模糊集与粗糙集的结合体,能够有效处理数据的复杂性和不确定性。由模糊相似关系产生的模糊粒结构可以对模糊粗糙集中不确定性的概念进行近似。核函数和模糊相似关系分别是机器学习和模糊粗糙集的核心因素,因此借助模糊相似关系和核函数之间的关系,构造了一种新的核函数,并定义了相应的核模糊粗糙集。最后通过实例说明新构造的核函数具有一定的推广性。     

On generalized fuzzy rough sets

In this paper, a class of generalized fuzzy rough sets based on two universes are studied. Some new set-valued mappings and fuzzy set-valued mappings are introduced to discuss properties of the known model, and a new model for fuzzy rough sets is proposed which provides a new selection of interval structure for uncertainty reasoning using rough set theory. Some properties of the new model are revealed. The new model seems to be more natural in the sense that fuzzy sets are approximated by fuzzy sets on the same universe.     

Parameterized attribute reduction with Gaussian kernel based fuzzy rough sets

Fuzzy rough sets are considered as an effective tool to deal with uncertainty in data analysis, and fuzzy similarity relations are used in fuzzy rough sets to calculate similarity between objects. On the other hand in kernel tricks, a kernel maps data into a higher dimensional feature space where the resulting structure of the learning task is linearly separable, while the kernel is the inner product of this feature space and can also be viewed as a similarity function. It has been reported there is an overlap between family of kernels and collection of fuzzy similarity relations. This fact motivates the idea in this paper to use some kernels as fuzzy similarity relations and develop kernel based fuzzy rough sets. First, we consider Gaussian kernel and propose Gaussian kernel based fuzzy rough sets. Second we introduce parameterized attribute reduction with the derived model of fuzzy rough sets. Structures of attribute reduction are investigated and an algorithm with discernibility matrix to find all reducts is developed. Finally, a heuristic algorithm is designed to compute reducts with Gaussian kernel fuzzy rough sets. Several experiments are provided to demonstrate the effectiveness of the idea.     

Generalized interval-valued fuzzy variable precision rough sets determined by fuzzy logical operators

The fuzzy rough set model and interval-valued fuzzy rough set model have been introduced to handle databases with real values and interval values, respectively. Variable precision rough set was advanced by Ziarko to overcome the shortcomings of misclassification and/or perturbation in Pawlak rough sets. By combining fuzzy rough set and variable precision rough set, a variety of fuzzy variable precision rough sets were studied, which cannot only handle numerical data, but are also less sensitive to misclassification. However, fuzzy variable precision rough sets cannot effectively handle interval-valued data-sets. Research into interval-valued fuzzy rough sets for interval-valued fuzzy data-sets has commenced; however, variable precision problems have not been considered in interval-valued fuzzy rough sets and generalized interval-valued fuzzy rough sets based on fuzzy logical operators nor have interval-valued fuzzy sets been considered in variable precision rough sets and fuzzy variable precision rough sets. These current models are incapable of wide application, especially on misclassification and/or perturbation and on interval-valued fuzzy data-sets. In this paper, these models are generalized to a more integrative approach that not only considers interval-valued fuzzy sets, but also variable precision. First, we review generalized interval-valued fuzzy rough sets based on two fuzzy logical operators: interval-valued fuzzy triangular norms and interval-valued fuzzy residual implicators. Second, we propose generalized interval-valued fuzzy variable precision rough sets based on the above two fuzzy logical operators. Finally, we confirm that some existing models, including rough sets, fuzzy variable precision rough sets, interval-valued fuzzy rough sets, generalized fuzzy rough sets and generalized interval-valued fuzzy variable precision rough sets based on fuzzy logical operators, are special cases of the proposed models.     

A novel approach to fuzzy rough sets based on a fuzzy covering

This paper proposes an approach to fuzzy rough sets in the framework of lattice theory. The new model for fuzzy rough sets is based on the concepts of both fuzzy covering and binary fuzzy logical operators (fuzzy conjunction and fuzzy implication). The conjunction and implication are connected by using the complete lattice-based adjunction theory. With this theory, fuzzy rough approximation operators are generalized and fundamental properties of these operators are investigated. Particularly, comparative studies of the generalized fuzzy rough sets to the classical fuzzy rough sets and Pawlak rough set are carried out. It is shown that the generalized fuzzy rough sets are an extension of the classical fuzzy rough sets as well as a fuzzification of the Pawlak rough set within the framework of complete lattices. A link between the generalized fuzzy rough approximation operators and fundamental morphological operators is presented in a translation-invariant additive group.     

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

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

模糊相似关系下变精度模糊粗糙集

经典变精度模糊粗糙集模型是基于模糊等价关系建立的.在实际应用中,模糊等价关系很难直接构造,需要通过求模糊相似关系的传递闭包生成.对模糊关系的这种改造会丢失较多有价值的信息,而且还增大了模糊粗糙集应用的计算复杂度.基于模糊逻辑算子构造2个模糊集的相对错误包含度,构造性地提出基于模糊相似关系的变精度模糊粗糙集模型,研究了该模型的性质.该模型一方面具有变精度粗糙集的优点,对噪声数据具有很好的容错能力,另一方面是基于模糊相似关系建立的,其应用范围更为广泛.     

基于包含度的变精度模糊粗糙集

利用模糊集的一个强包含度,在弱模糊划分的基础上建立了基于该包含度的变精度模糊粗糙集模型,对其重要性质进行了深入研究,并给出了对应形式粗糙度的计算方法,进一步利用海明距离和欧几里得距离定义了该模型下模糊粗糙集的两个粗糙性度量。给出的变精度模糊粗糙集模型能够使模糊粗糙集的运算按照模糊集的运算实现,为变精度模糊粗糙集理论的研究和应用莫定了一定的理论基础。     

基于HCM聚类的连续域模糊关联算法

针对粗糙集对于连续域属性决策表的处理能力差以及不容易获得模糊集之间关系等问题,提出一种基于连续型属性模糊关联规则约简算法。该算法引入三角隶属度函数将连续属性值转化为模糊值,并使用硬C均值聚类方法获得数据集之间关系,采用遗传算法优化该模型。仿真结果验证了该模型的有效性。     

Decision‐theoretic rough sets under Pythagorean fuzzy information

Decision‐theoretic rough sets (DTRSs), which provide a classical model of three‐way decisions (3WDs), play an important role in risk decision‐making problems. The risk is associated with the loss function of DTRSs, which is evaluated by the decision makers. As a new extension of fuzzy sets, Pythagorean fuzzy sets can handle uncertain information more flexibly than intuitionistic fuzzy sets in the process of decision making and it gives a new measure for the determination of loss functions of DTRSs. More specifically, we take into account the loss functions of DTRSs with Pythagorean fuzzy numbers and propose a Pythagorean fuzzy decision‐theoretic rough set (PFDTRS) model. Some properties of the expected losses are carefully investigated. Then we further design three approaches for deriving 3WDs with the PFDTRS model. The group decision making (GDM) based on the PFDTRS model is also discussed. It provides a novel interpretation for the determination of loss functions. With the aid of the Pythagorean fuzz weighted averaging operator, we aggregate the loss functions, as suggested by the all experts, which support a coherent way of designing information granules in the presence of numerics. An algorithm for 3WDs in GDM based on the PFDTRS model is designed. Then, an example is presented to elaborate on 3WDs with the PFDTRS model.     

Intuitionistic fuzzy rough set model based on conflict distance and applications

Due to the complexity and uncertainty of the objective world, as well as the limitation of human ability to understand, it is difficult for one to employ only a single type of uncertainty method to deal with the real-life problem of decision-making, especially problems involving conflicts. On the other hand, by incorporating the advantages of various theories of uncertainty, one is expected to develop a more powerful hybrid method for soft decision making and to solve such problems more effectively. In view of this, in this paper the thought and method of intuitionistic fuzzy set and rough set are used to construct a novel intuitionistic fuzzy rough set model. Corresponding to the fact that the decision-making information system of rough sets is of intuitionistic fuzzy information system, our method defines the conflict distance by using the idea of measuring intuitionistic fuzzy similarity so that it is introduced into the models of rough sets, leading to the development of our intuitionistic fuzzy rough set model. After that, we investigate the properties of the model, introduce a novel tool for conflict analysis based on our hybrid model, and employ this new tool to describe and resolve a real-life conflict problem.     

Membership evaluation and feature selection for fuzzy support vector machine based on fuzzy rough sets

A fuzzy support vector machine (FSVM) is an improvement in SVMs for dealing with data sets with outliers. In FSVM, a key step is to compute the membership for every training sample. Existing approaches of computing the membership of a sample are motivated by the existence of outliers in data sets and do not take account of the inconsistency between conditional attributes and decision classes. However, this kind of inconsistency can affect membership for every sample and has been considered in fuzzy rough set theory. In this paper, we develop a new method to compute membership for FSVMs by using a Gaussian kernel-based fuzzy rough set. Furthermore, we employ a technique of attribute reduction using Gaussian kernel-based fuzzy rough sets to perform feature selection for FSVMs. Based on these discussions we combine the FSVMs and fuzzy rough sets methods together. The experimental results show that the proposed approaches are feasible and effective.     

Fuzzy rough set on probabilistic approximation space over two universes and its application to emergency decision‐making

Probabilistic approaches to rough sets are still an important issue in rough set theory. Although many studies have been written on this topic, they focus on approximating a crisp concept in the universe of discourse, with less effort on approximating a fuzzy concept in the universe of discourse. This article investigates the rough approximation of a fuzzy concept on a probabilistic approximation space over two universes. We first present the definition of a lower and upper approximation of a fuzzy set with respect to a probabilistic approximation space over two universes by defining the conditional probability of a fuzzy event. That is, we define the rough fuzzy set on a probabilistic approximation space over two universes. We then define the fuzzy probabilistic approximation over two universes by introducing a probability measure to the approximation space over two universes. Then, we establish the fuzzy rough set model on the probabilistic approximation space over two universes. Meanwhile, we study some properties of both rough fuzzy sets and fuzzy rough sets on the probabilistic approximation space over two universes. Also, we compare the proposed model with the existing models to show the superiority of the model given in this paper. Furthermore, we apply the fuzzy rough set on the probabilistic approximation over two universes to emergency decision‐making in unconventional emergency management. We establish an approach to online emergency decision‐making by using the fuzzy rough set model on the probabilistic approximation over two universes. Finally, we apply our approach to a numerical example of emergency decision‐making in order to illustrate the validity of the proposed method.     

基于软粗糙集的犹豫模糊三支决策方法

三支决策理论采取“三分而治”的处理思路,为复杂问题求解提供了一种简洁高效的解决方案.对此,借助软集理论研究犹豫模糊集和三支决策方法,通过定义犹豫模糊集的值空间和值陪集,引入犹豫模糊集的典范软集、单位区间参数化软集和导出犹豫模糊集等概念,解决犹豫模糊集和软集的相互表示问题.此外,利用软粗糙集理论建立一种基于犹豫模糊集的广义粗糙模型,借助给定的预决策集,计算软上近似集并确定评价函数,进而提出一种基于软粗糙集的犹豫模糊三支决策方法.最后,通过两个数值实例和相关对比分析,验证所提出三支决策方法的合理性和有效性.     

基于FCM与模糊粗糙集理论的交通事件检测模型

为准确及时地发现高速公路上的事故隐患,有效地减少交通延误,保障道路安全,提出了一种新的基于模糊C均值（FCM）聚类和模糊粗糙集的交通事件自动检测模型。模型分为离散化、推理规则建立和模糊推理三个步骤。在属性离散化时,提出用常用的隶属度函数来拟合FCM聚类后的结果,并用此函数和参数来实现属性数据的离散化,避免了每次输入数据都必须通过聚类操作来进行离散化;采用了粗糙集理论建立推理规则,选择和交通事件密切相关属性并进行规则的约简,加速了模糊推理的速度;最后采用Max-Min模糊推理方法对交通事件进行检测。通过多种检测方法对比测试,结果表明了此模型在总体性能上优于传统的检测方法,验证了此模型的有效性,为交通事件的检测提供了一种新的思路。     

Measures of general fuzzy rough sets on a probabilistic space

Fuzzy rough set is a generalization of crisp rough set, which deals with both fuzziness and vagueness in data. The measures of fuzzy rough sets aim to dig its numeral characters in order to analyze data effectively. In this paper we first develop a method to compute the cardinality of fuzzy set on a probabilistic space, and then propose a real number valued function for each approximation operator of the general fuzzy rough sets on a probabilistic space to measure its approximate accuracy. The functions of lower and upper approximation operators are natural generalizations of the belief function and plausibility function in Dempster-Shafer theory of evidence, respectively. By using these functions, accuracy measure, roughness degree, dependency function, entropy and conditional entropy of general fuzzy rough set are proposed, and the relative reduction of fuzzy decision system is also developed by using the dependency function and characterized by the conditional entropy. At last, these measure functions for approximation operators are characterized by axiomatic approaches.     

覆盖概率粗糙集的模糊性

在经典覆盖近似空间中定义了论域上任意元素x的最小子覆盖,基于任意元素的最小子覆盖给出了覆盖粗糙集上、下近似新的描述,进而给出了已有覆盖概率粗糙集模型在最小子覆盖意义下的描述。同时,以覆盖概率粗糙集的粗糙隶属函数为基础,应用经典模糊集熵的概念讨论了覆盖概率粗糙集模糊性的度量。     

Rough set based generalized fuzzy c-means algorithm and quantitative indices.

A generalized hybrid unsupervised learning algorithm, which is termed as rough-fuzzy possibilistic c-means (RFPCM), is proposed in this paper. It comprises a judicious integration of the principles of rough and fuzzy sets. While the concept of lower and upper approximations of rough sets deals with uncertainty, vagueness, and incompleteness in class definition, the membership function of fuzzy sets enables efficient handling of overlapping partitions. It incorporates both probabilistic and possibilistic memberships simultaneously to avoid the problems of noise sensitivity of fuzzy c-means and the coincident clusters of PCM. The concept of crisp lower bound and fuzzy boundary of a class, which is introduced in the RFPCM, enables efficient selection of cluster prototypes. The algorithm is generalized in the sense that all existing variants of c-means algorithms can be derived from the proposed algorithm as a special case. Several quantitative indices are introduced based on rough sets for the evaluation of performance of the proposed c-means algorithm. The effectiveness of the algorithm, along with a comparison with other algorithms, has been demonstrated both qualitatively and quantitatively on a set of real-life data sets.     

Fuzzy reasoning based on a new fuzzy rough set and its application to scheduling problems

In this paper, we study the fuzzy reasoning based on a new fuzzy rough set. First, we define a broad family of new lower and upper approximation operators of fuzzy sets between different universes using a set of axioms. Then, based on the approximation operators above, we propose the fuzzy reasoning based on the new fuzzy rough set. By means of the above fuzzy reasoning based on the new fuzzy rough set, for a given premise, we can obtain the fuzzy reasoning consequence expressed by the fuzzy interval constructed by the above two approximations of fuzzy sets. Furthermore, through the defuzzification of the lower and upper approximations, we can get the corresponding two values constructing the interval used as the fuzzy reasoning consequence after defuzzification. Then, from the above interval, a suitable value can be selected as the final reasoning consequence so that some special constraints are satisfied as possibly. At last, we apply the fuzzy reasoning based on the new fuzzy rough set to the scheduling problems, and numerical computational results show that the fuzzy reasoning based on the new fuzzy rough set is more suitable for the scheduling problems compared with the fuzzy reasoning based on the CRI method and the III method.