粗糙Vague集(值)相似性度量的一种新方法

对粗糙集和Vague集的概念、知识表示方法进行了讨论,把粗糙集和Vague集进行了融合,描述了粗糙Vague集概念,给出粗糙Vague值的相关概念及其相似性度量的一种新方法,研究了粗糙Vague集的相关性质及其相似性度量的方法。     

粗糙集与Vague集

本文研究了粗糙集和Vague集及它们的关系，这两类集都是人工智能、知识挖掘和知识发现的重要工具。从集合基数表示的角度说，粗糙集也是Vague集的一种。通过分析这两种集的关系，提出了相关定理。同时，我们还提出了粗糙Vague集的概念，并初步研究了其性质。     

S-粗Vague集合及应用

在原始Vague集基础上提出动态的Vague集,即Ｓ-Vague集,由此提出了Ｓ-粗Vague集概念。接着给出了Ｓ-粗Vague集结构与性质,分析了Ｓ-粗Vague集与Z.Pawlak粗集、Dubois粗糙模糊集以及S-粗集之间的关系,给出了Ｓ-粗Vague集的应用。     

覆盖粗糙Value集的不确定性度量研究

在覆盖粗糙集理论研究的基础上,将粗糙集理论与Vague集理论相融合,研究基于覆盖的粗糙Vague集模型及其相关性质。为了更好地度量该模型的不确定性,首先定义了知识含量测度,用于度量覆盖对论域中对象分类能力产生的不确定性,此种度量方法体现了分类知识的本质特征;同时结合边界域大小的度量方法,定义了C-粗糙度的概念用于度量覆盖粗糙Vague集的不确定性。实例分析结果表明了这种度量方法的简洁高效性。     

基于关联熵系数的粗糙Vague集相似性度量方法

粗糙Vague集是将粗糙集和Vague集理论相互融合以处理不确定性信息的一种理论工具。本文在深入研究Vague集及粗糙模糊集的关联熵、关联熵系数及集合相似性度量方法基础上,将关联熵和关联熵系数的概念引入到粗糙Vague集,并详细讨论了它们的主要性质,同时证明了关联熵系数满足粗糙Vague集相似度的定义,可用于粗糙Vague集的相似性度量。最后通过实例验证了粗糙Vague集的关联熵系数用于度量粗糙Vague集之间相似性程度的有效性,该理论为粗糙Vague集相似性度量提供了一种新方法。     

覆盖Value集

覆盖粗糙集和Vague集都是处理不确定性问题的数学工具,它们分别是粗糙集和模糊集的扩展。已有的覆盖粗糙集模型在求上、下近似时,可能将一些实际上并非肯定属于给定集合的元素纳入到下近似中,而一些可能属于给定集合的元素却没有纳入到上近似中,这就会改变一些元素与给定集合的关系。通过深入分析论域中的元素与其相关覆盖元之间的关系,建立了覆盖Vague集。该覆盖Vague集能够从一种新的角度反映出论域中各元素与给定集合之间的从属程度。进一步研究了覆盖Vague集与覆盖粗糙集中一些重要概念之间的关系。最后讨论了当覆盖退化为划分时覆盖Vague集的特性。     

一种覆盖粗糙Vague集模型及其不确定性度量

针对文献[21]提出的覆盖粗糙Vague集模型中幂等性并不成立的问题,提出了一种新的基于近邻域的覆盖粗糙Vague集模型,并讨论了相关性质及与Ⅰ型覆盖粗糙Vague集模型的关系;最后通过引入覆盖粒度空间下知识熵的概念,定义了一种Ⅱ型覆盖粗糙Vague集模型的不确定性度量方法.算例分析表明,Ⅱ型覆盖粗糙Vague模型的不确定性程度随粒度减小而减小.     

Vague拓扑空间和Vague连续映射*

基于Vague集现有理论、经典集合和Fuzzy集的拓扑理论,运用分析的方法推广了经典集合和Fuzzy集的相关拓扑理论,初步给出了Vague拓扑空间和Vague连续映射的概念,并就它们的一些性质进行了讨论。所得结果扩展了Vague集理论的研究范围,并提出了该领域未来可研究的方向。     

含核Vague区域和Vague洞区域关系及蕴涵定理

模糊区域的空间信息表示和区域关系处理在空间数据库、地理信息系统和人工智能等领域具有重要的意义.引入Vague集的概念和理论对含核Vague区域和Vague洞区域关系进行了系统的研究.基于Vague集给出了含核Vague区域、Vague洞区域和区域划分等概念;详细分析了处于不同平面中的含核Vague区域和Vague洞区域关系;给出了基于Vague集的区域关系交集模型和子区域关系间的蕴涵定理和算法;进一步给出了实例分析.研究成果可较好地处理含核Vague区域和Vague洞区域内的模糊点不确定的隶属信息和确定含核Vague区域与Vague洞区域的关系等问题.     

基于Vague集的含洞不规则Vague区域关系

模糊区域的空间信息表示和区域关系处理在空间数据库、地理信息系统和人工智能等领域具有重要的意义.引入Vague集的概念和理论对含洞不规则Vague区域关系进行了系统的研究.基于Vague集给出了Vague区域、Vague洞和原子域等概念;将含洞不规则Vague区域分成原子域,研究了原子域间的空间关系;联合原子域关系,给出了含洞不规则Vague区域关系.研究成果可较好地处理含洞不规则Vague区域内的模糊点不确定的隶属信息和复杂的含洞不规则Vague区域的空间关系的表示和分析等问题.     

粗糙Vague集（值）间k步相似度量新方法

对粗糙集、Vague集及粗糙Vague集的概念、知识表示方法进行了讨论,描述了粗糙Vague集的相关概念,在研究了粗糙Vague集相似性度量方法的基础上,提出了一种对踌躇度п_v（x）k步细化的k步相似度量新方法,并且研究了该方法的相关性质。进一步对k步相似度量在k趋向无穷时求极限,得出粗糙Vague集退化为模糊集的特例情况。     

粗糙Vague集（值）间k步相似度量新方法

对粗糙集、Vague集及粗糙Vague集的概念、知识表示方法进行了讨论,描述了粗糙Vague集的相关概念,在研究了粗糙Vague集相似性度量方法的基础上,提出了一种对踌躇度п_v（x）k步细化的k步相似度量新方法,并且研究了该方法的相关性质。进一步对k步相似度量在k趋向无穷时求极限,得出粗糙Vague集退化为模糊集的特例情况。     

A new extension of fuzzy sets using rough sets: R-fuzzy sets

This paper presents a new extension of fuzzy sets: R-fuzzy sets. The membership of an element of a R-fuzzy set is represented as a rough set. This new extension facilitates the representation of an uncertain fuzzy membership with a rough approximation. Based on our definition of R-fuzzy sets and their operations, the relationships between R-fuzzy sets and other fuzzy sets are discussed and some examples are provided.     

覆盖粗糙集的公理化

粗糙集的公理系统是粗糙集理论与应用的基础.覆盖粗糙集是粗糙集理论的自然的有意义的推广.基于Xu等提出的新的覆盖粗糙集模型,研究了新模型的公理系统,用4条简洁且相互独立的公理刻画了覆盖粗糙集.这些研究有助于覆盖粗糙集理论研究的深入和完善.     

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.     

Approximations and reducts with covering generalized rough sets

The covering generalized rough sets are an improvement of traditional rough set model to deal with more complex practical problems which the traditional one cannot handle. It is well known that any generalization of traditional rough set theory should first have practical applied background and two important theoretical issues must be addressed. The first one is to present reasonable definitions of set approximations, and the second one is to develop reasonable algorithms for attributes reduct. The existing covering generalized rough sets, however, mainly pay attention to constructing approximation operators. The ideas of constructing lower approximations are similar but the ideas of constructing upper approximations are different and they all seem to be unreasonable. Furthermore, less effort has been put on the discussion of the applied background and the attributes reduct of covering generalized rough sets. In this paper we concentrate our discussion on the above two issues. We first discuss the applied background of covering generalized rough sets by proposing three kinds of datasets which the traditional rough sets cannot handle and improve the definition of upper approximation for covering generalized rough sets to make it more reasonable than the existing ones. Then we study the attributes reduct with covering generalized rough sets and present an algorithm by using discernibility matrix to compute all the attributes reducts with covering generalized rough sets. With these discussions we can set up a basic foundation of the covering generalized rough set theory and broaden its applications.     

Vague集及其相似度量

相似度量是Vague集研究中的一个重要内容,具有重要的理论和工程实际意义。本文首先讨论了Vague集的两种扩张原理,并结合Vague集自身的特点及其典型的背景知识,提出了两种Vague集的相似度量方法,同时分析了它们的性质。本文的结果对Vague的研究和工程应用有一定意义。     

Rough set theory for the interval-valued fuzzy information systems

The notion of a rough set was originally proposed by Pawlak [Z. Pawlak, Rough sets, International Journal of Computer and Information Sciences 11 (5) (1982) 341-356]. Later on, Dubois and Prade [D. Dubois, H. Prade, Rough fuzzy sets and fuzzy rough sets, International Journal of General System 17 (2-3) (1990) 191-209] introduced rough fuzzy sets and fuzzy rough sets as a generalization of rough sets. This paper deals with an interval-valued fuzzy information system by means of integrating the classical Pawlak rough set theory with the interval-valued fuzzy set theory and discusses the basic rough set theory for the interval-valued fuzzy information systems. In this paper we firstly define the rough approximation of an interval-valued fuzzy set on the universe U in the classical Pawlak approximation space and the generalized approximation space respectively, i.e., the space on which the interval-valued rough fuzzy set model is built. Secondly several interesting properties of the approximation operators are examined, and the interrelationships of the interval-valued rough fuzzy set models in the classical Pawlak approximation space and the generalized approximation space are investigated. Thirdly we discuss the attribute reduction of the interval-valued fuzzy information systems. Finally, the methods of the knowledge discovery for the interval-valued fuzzy information systems are presented with an example.     

Vague软集的新模糊熵及其应用

依据软集、Vague集、Vague软集现有理论,参考Vague集模糊熵度量方法,对Vague 软集模糊熵的公理化定义进行了补充,修正了原有公理化定义中不完整的地方;提出了一种新的计算Vague 软集模糊熵的公式,并给出了其在决策中的应用实例及分析。实例分析表明该Vague 软集模糊熵公式具有良好的应用效果。     

Vague软集的一些代数性质

基于Vague集和软集现有理论以及Vague集思想与软集思想之间的联系,初步提出了Vague软集的狭义交、狭义并、相对补运算的概念,并在此基础上分别研究了这些运算的若干代数性质。