Multi-fuzzy sets: An extension of fuzzy sets

In this paper we propose a method to construct more general fuzzy sets using ordinary fuzzy sets as building blocks. We introduce the concept of multi-fuzzy sets in terms of ordered sequences of membership functions. The family of operations T, S, M of multi-fuzzy sets are introduced by coordinate wise t-norms, s-norms and aggregation operations. We define the notion of coordinate wise conjugation of multifuzzy sets, a method for obtaining Atanassov’s intuitionistic fuzzy operations from multi-fuzzy sets. We show that various binary operations in Atanassov’s intuitionistic fuzzy sets are equivalent to some operations in multi-fuzzy sets like M operations, 2-conjugates of the T and S operations. It is concluded that multi-fuzzy set theory is an extension of Zadeh’s fuzzy set theory, Atanassov’s intuitionsitic fuzzy set theory and L-fuzzy set theory.     

A rough set approach to the characterization of transversal matroids

Rough sets are efficient for data pre-processing during data mining. However, some important problems such as attribute reduction in rough sets are NP-hard and the algorithms required to solve them are mostly greedy ones. The transversal matroid is an important part of matroid theory, which provides well-established platforms for greedy algorithms. In this study, we investigate transversal matroids using the rough set approach. First, we construct a covering induced by a family of subsets and we propose the approximation operators and upper approximation number based on this covering. We present a sufficient condition under which a subset is a partial transversal, and also a necessary condition. Furthermore, we characterize the transversal matroid with the covering-based approximation operator and construct some types of circuits. Second, we explore the relationships between closure operators in transversal matroids and upper approximation operators based on the covering induced by a family of subsets. Finally, we study two types of axiomatic characterizations of the covering approximation operators based on the set theory and matroid theory, respectively. These results provide more methods for investigating the combination of transversal matroids with rough sets.     

Attribute reduction based on generalized fuzzy evidence theory in fuzzy decision systems

Attribute reduction is viewed as an important issue in data mining and knowledge representation. This paper studies attribute reduction in fuzzy decision systems based on generalized fuzzy evidence theory. The definitions of several kinds of attribute reducts are introduced. The relationships among these reducts are then investigated. In a fuzzy decision system, it is proved that the concepts of fuzzy positive region reduct, lower approximation reduct and generalized fuzzy belief reduct are all equivalent, the concepts of fuzzy upper approximation reduct and generalized fuzzy plausibility reduct are equivalent, and a generalized fuzzy plausibility consistent set must be a generalized fuzzy belief consistent set. In a consistent fuzzy decision system, an attribute set is a generalized fuzzy belief reduct if and only if it is a generalized fuzzy plausibility reduct. But in an inconsistent fuzzy decision system, a generalized fuzzy belief reduct is not a generalized fuzzy plausibility reduct in general.     

近似空间与信任结构之间的关系

回顾了由二元关系产生的粗糙近似空间及其导出的各种粗糙近似算子的构造性定义,介绍了经典和模糊环境下各种信任结构及其导出的信任函数与似然函数的概念,给出了粗糙集理论中近似空间及其导出的下近似算子与上近似算子和证据理论中的信任结构及其导出信任函数与似然函数之间的相互关系及其应用背景。     

Approximation by Shepard type pseudo-linear operators and applications to Image Processing

Recently, it has been shown that sum and product are not the only operations that can be used in order to define concrete approximation operators. Several other operations provided by fuzzy sets theory can be used. In the present paper, pseudo-linear approximation operators are investigated from the practical point of view in Image Processing. We study max–min, max–product Shepard type approximation operators together with Shepard operators based on pseudo-operations generated by an increasing continuous generator. It is shown that in several cases these outperform classical approximation operators based on sum and product operations.     

Rough approximations of vague sets in fuzzy approximation space

The combination of the rough set theory, vague set theory and fuzzy set theory is a novel research direction in dealing with incomplete and imprecise information. This paper mainly concerns the problem of how to construct rough approximations of a vague set in fuzzy approximation space. Firstly, the β-operator and its complement operator are introduced, and some new properties are examined. Secondly, the approximation operators are constructed based on β-(complement) operator. Meantime, λ-lower (upper) approximation is firstly proposed, and then some properties of two types of approximation operators are studied. Afterwards, for two different kinds of approximation operators, we introduce two roughness measure methods of the same vague set and discuss a property. Finally, an example is given to illustrate how to calculate the rough approximations and roughness measure of a vague set using the β-(complement) product between two fuzzy matrixes. The results show that the proposed rough approximations and roughness measure of a vague set in fuzzy environment are reasonable.     

On characterization of generalized interval-valued fuzzy rough sets on two universes of discourse

This paper proposes a general study of (I,T)-interval-valued fuzzy rough sets on two universes of discourse integrating the rough set theory with the interval-valued fuzzy set theory by constructive and axiomatic approaches. Some primary properties of interval-valued fuzzy logical operators and the construction approaches of interval-valued fuzzy T-similarity relations are first introduced. Determined by an interval-valued fuzzy triangular norm and an interval-valued fuzzy implicator, a pair of lower and upper generalized interval-valued fuzzy rough approximation operators with respect to an arbitrary interval-valued fuzzy relation on two universes of discourse is then defined. Properties of I-lower and T-upper interval-valued fuzzy rough approximation operators are examined based on the properties of interval-valued fuzzy logical operators discussed above. Connections between interval-valued fuzzy relations and interval-valued fuzzy rough approximation operators are also established. Finally, an operator-oriented characterization of interval-valued fuzzy rough sets is proposed, that is, interval-valued fuzzy rough approximation operators are characterized by axioms. Different axiom sets of I-lower and T-upper interval-valued fuzzy set-theoretic operators guarantee the existence of different types of interval-valued fuzzy relations which produce the same operators.     

基于双论域模糊粗糙集的应急决策模型与方法

以突发危机事件应急决策为应用背景,讨论了双论域上模糊粗糙集的基本理论,建立了基于模糊相容关系的双论域模糊粗糙集模型. 在此基础上,把突发危机事件应急决策转化为一个具有模糊决策对象的双论域决策近似空间上的粗糙近似问题,构建了基于双论域模糊粗糙集的应急决策模型.首先在双论域近似空间中计算模糊决策对象的上(下)近似,进而结合经典非确定型决策的思想给出了突发危机事件应急决策的规则.同时,给出了模型的算法.该模型给出了一种在不完全信息环境下应急决策的方法,给出了在充分考虑决策者个人偏好信息基础上的决策置信度以及最优决策规则.该方法能够比较充分地符合应急决策信息不充分、资源有限以及时间紧迫的基本特征, 进而对突发危机事件应急决策提供科学的理论基础和现实的决策方法.最后,通过应用算例说明了模型的应用过程,结果验证了本文给出模型的有效性。     

Evidence-theory-based numerical algorithms of attribute reduction with neighborhood-covering rough sets

Covering rough sets generalize traditional rough sets by considering coverings of the universe instead of partitions, and neighborhood-covering rough sets have been demonstrated to be a reasonable selection for attribute reduction with covering rough sets. In this paper, numerical algorithms of attribute reduction with neighborhood-covering rough sets are developed by using evidence theory. We firstly employ belief and plausibility functions to measure lower and upper approximations in neighborhood-covering rough sets, and then, the attribute reductions of covering information systems and decision systems are characterized by these respective functions. The concepts of the significance and the relative significance of coverings are also developed to design algorithms for finding reducts. Based on these discussions, connections between neighborhood-covering rough sets and evidence theory are set up to establish a basic framework of numerical characterizations of attribute reduction with these sets.     

具有函数的泛逼近性能的模糊控制器的设计

构造出9类具有函数的泛逼近性能的模糊控制器,这些模糊控制器均由模糊蕴涵算子构造而成.利用倒车仿真说明采用具有函数的泛逼近性能的模糊控制器可以用于实际的模糊控制系统中.     

模糊粗糙集的模糊邻域算子刻画

在模糊集合的公理化定义及其直积的基础上，提出基本模糊点的模糊邻域算子概念。用模糊邻域算子来定义模糊集的上近似和下近似。可以用模糊集的上、下近似来刻画模糊关系的自反性、对称性和传递性等性质。在模糊粗糙集的模糊邻域算子定义下，模糊粗糙集与粗糙模糊集可以统一起来。     

Gaussian kernel based fuzzy rough sets: Model, uncertainty measures and applications

Kernel methods and rough sets are two general pursuits in the domain of machine learning and intelligent systems. Kernel methods map data into a higher dimensional feature space, where the resulting structure of the classification task is linearly separable; while rough sets granulate the universe with the use of relations and employ the induced knowledge granules to approximate arbitrary concepts existing in the problem at hand. Although it seems there is no connection between these two methodologies, both kernel methods and rough sets explicitly or implicitly dwell on relation matrices to represent the structure of sample information. Based on this observation, we combine these methodologies by incorporating Gaussian kernel with fuzzy rough sets and propose a Gaussian kernel approximation based fuzzy rough set model. Fuzzy T-equivalence relations constitute the fundamentals of most fuzzy rough set models. It is proven that fuzzy relations with Gaussian kernel are reflexive, symmetric and transitive. Gaussian kernels are introduced to acquire fuzzy relations between samples described by fuzzy or numeric attributes in order to carry out fuzzy rough data analysis. Moreover, we discuss information entropy to evaluate the kernel matrix and calculate the uncertainty of the approximation. Several functions are constructed for evaluating the significance of features based on kernel approximation and fuzzy entropy. Algorithms for feature ranking and reduction based on the proposed functions are designed. Results of experimental analysis are included to quantify the effectiveness of the proposed methods.     

基于覆盖的模糊粗糙集模型

讨论基于覆盖理论的模糊粗糙集模型。给出了模糊集的粗糙上、下近似算子,讨论了算子的基本性质,证明了覆盖粗糙集模型下所有模糊集的下近似构成一个模糊拓扑,并得到了覆盖模糊粗糙集模型的公理化描述。     

Approximation by neural networks with sigmoidal functions

In this paper, we introduce a type of approximation operators of neural networks with sigmodal functions on compact intervals, and obtain the pointwise and uniform estimates of the ap- proximation. To improve the approximation rate, we further introduce a type of combinations of neurM networks. Moreover, we show that the derivatives of functions can also be simultaneously approximated by the derivatives of the combinations. We also apply our method to construct approximation operators of neural networks with sigmodal functions on infinite intervals.     

Covering rough sets based on neighborhoods: An approach without using neighborhoods

Rough set theory, a mathematical tool to deal with inexact or uncertain knowledge in information systems, has originally described the indiscernibility of elements by equivalence relations. Covering rough sets are a natural extension of classical rough sets by relaxing the partitions arising from equivalence relations to coverings. Recently, some topological concepts such as neighborhood have been applied to covering rough sets. In this paper, we further investigate the covering rough sets based on neighborhoods by approximation operations. We show that the upper approximation based on neighborhoods can be defined equivalently without using neighborhoods. To analyze the coverings themselves, we introduce unary and composition operations on coverings. A notion of homomorphism is provided to relate two covering approximation spaces. We also examine the properties of approximations preserved by the operations and homomorphisms, respectively.     

Logics for belief functions on MV-algebras

In this paper we present a generalization of belief functions over fuzzy events. In particular we focus on belief functions defined in the algebraic framework of finite MV-algebras of fuzzy sets. We introduce a fuzzy modal logic to formalize reasoning with belief functions on many-valued events. We prove, among other results, that several different notions of belief functions can be characterized in a quite uniform way, just by slightly modifying the complete axiomatization of one of the modal logics involved in the definition of our formalism.     

On (⊥,?)-generalized fuzzy rough sets

In the present paper, we mainly discuss the (??,?)-generalized fuzzy rough sets introduced by B.Q. Hu and Z.H. Huang with both constructive approach and axiomatic approach considered. In the former, we started from the investigation of the properties of the ??-upper and ?-lower approximation operators generated by binary fuzzy relations. In the latter, by defining a pair of fuzzy set-theoretic operators, we show (??,?)-fuzzy rough approximation operators can be characterized by different sets of axioms.     

基于k阶二元关系的直觉模糊粗糙集

利用k阶二元关系定义直觉模糊粗糙集,讨论了分别为串行、自反、对称、传递关系时所对应的上、下近似算子的性质。在有限论域U中,研究了任一自反二元关系所诱导的直觉模糊拓扑空间中直觉模糊闭包、内部算子与相对应的上、下近似算子的关系。     

A Fuzzy Logic Approach for Determining Expected Values: A Project Management Application

This paper presents a methodology rooted in the general concepts of fuzzy logic theory with specific emphasis on belief functions and extension principles, and fuzzy probability distributions with fuzzy expectation based on fuzzy probability measures. This approach offers a useful alternative to the traditional approach in the estimation of probabilities in the absence of information about relative frequencies. An algorithm called BIPFET is developed and its application is demonstrated by utilizing data from a real-life research and development project.     

基于交通流的多模糊时间窗车辆路径优化

研究了基于交通流的多模糊时间窗车辆路径问题,考虑了实际中不断变化的交通流以及客户具有多个模糊时间窗的情况,以最小化配送总成本和最大化客户满意度为目标,构建基于交通流的多模糊时间窗车辆路径模型。根据伊藤算法的基本原理,设计了求解该模型的改进伊藤算法,结合仿真算例进行了模拟计算,并与蚁群算法的计算结果进行了对比分析,结果表明,利用改进伊藤算法求解基于交通流的多模糊时间窗车辆路径问题,迭代次数小,效率更高,能够在较短的时间内收敛到全局最优解,可以有效的求解多模糊时间窗车辆路径问题。