基于子基的覆盖拓扑空间的序列紧致性

基于子基的覆盖拓扑空间主要将覆盖所成子基引入粗糙集框架来诱导变异拓扑,已经具有连通性、分离性、可数性与紧致性的性质研究,但尚未涉及序列紧致性讨论.本文主要探讨基于子基的覆盖拓扑空间的序列紧致性.针对基于子基的覆盖拓扑空间,在深化紧致性的基础上,定义了序列紧致性,并研究了相关性质,最后提供一个说明实例.所得结果对基于子基的覆盖拓扑空间进行了系统完善与深入刻画.     

拓扑空间关于子基的紧致性

覆盖方法的应用在粗糙集理论研究中越来越受到重视,其中拓扑空间的子集关于子基的内部和闭包两个概念尤为重要.在由它们导入的关于子基的开集,闭集的基础上,给出了拓扑空间关于子基的紧致性概念,并研究它的性质,得到一般拓扑空间中紧致性的一种推广.     

粗糙集的拓扑基础

为了进一步研究粗糙集及其应用,本文介绍了一种关于粗糙集的新理论,即粗糙集的基本拓扑理论.主要研究了粗糙集的拓扑空间及其性质等.给出了一些新的定义和定理.并对未来的研究给予展望.     

拓扑空间关于子基的分离性

在粗糙集理论研究中,覆盖方法的应用越来越受到重视,其中拓扑空间的子集关于子基的内部和闭包两个概念尤为重要.本文在由它们导人的关于子基的开集,闭集的基础上,给出了拓扑空间关于子基的分离性概念,并研究它们的性质,得到分离性公理定义的一般拓扑空间的进一步分类.     

关于子基的连通性的注记

在粗糙集理论研究中,覆盖方法的应用越来越受重视,其中最重要的概念是最近引进的拓扑空间的子集关于子基的内部和闭包以及由它们导入的关于子基的开集、闭集.对由它们导入的拓扑空间关于子基的隔离子集、连通性作进一步研究,所得性质是一般拓扑空间中隔离子集和连通性相应结果的推广.     

由子基生成的内部算子和闭包算子

本文研究粗糙集与拓扑空间的关系,统一地使用拓扑空间中的集合关于子基的内部和闭包来研究粗糙集理论和覆盖广义粗糙集理论中的下近似集和上近似集,以及由它们导出的关于子基的开集,导集,闭集,边界．研究这两个概念及由它们导出的相关概念的性质不仅对于粗糙集理论,而且对于拓扑学本身都有重要的理论和实际应用意义．     

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

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

近似空间的拓扑性质及其应用

近似空间(U,R)的全体可定义集构成X上的一个拓扑.本文在不要求论域U是有限的前提下探讨近似空间上这个拓扑的局部性质和可数性质,以及拓扑空间可近似化的充要条件及公理化体系,并寻找它们在粗糙集理论中的应用.     

关于子基的连通性

覆盖方法在粗糙集理论研究中的应用越来越受到重视,而其中最重要的两个概念是最近引入的拓扑空间的子集关于子基的内部和闭包.本文研究由它们导出的关于子基的连通性的概念,它比一般拓扑学中的连通性的概念弱,但具有许多类似的性质,这些性质事实上也是连通性相应结果的推广.     

覆盖族生成拓扑的约简

本文研究了在覆盖族产生的拓扑不变的条件下覆盖族的约简问题.利用拓扑学理论讨论覆盖广义粗糙集的约简理论,给出计算约简的方法,丰富了覆盖广义粗糙集理论.     

On some types of covering rough sets from topological points of view

The concept of coverings is one of the fundamental concepts in topological spaces and plays a big part in the study of topological problems. This motivates the research of covering rough sets from topological points of view. From topological points of view, we can get a good insight into the essence of covering rough sets and make our discussions concise and profound. In this paper, we first construct a type of topology called the topology induced by the covering on a covering approximation space. This notion is indeed in the core of this paper. Then we use it to define the concepts of neighborhoods, closures, connected spaces, and components. Drawing on these concepts, we define several pairs of approximation operators. We not only investigate the relationships among them, but also give clear explanations of the concepts discussed in this paper. For a given covering approximation space, we can use the topology induced by the covering to investigate the topological properties of the space such as separation, connectedness, etc. Finally, a diagram is presented to show that the collection of all the lower and upper approximations considered in this paper constructs a lattice in terms of the inclusion relation ⊆.     

有关拓扑学与覆盖粗糙集的一些结论

引入了拓扑覆盖的概念,并结合最小描述元对有限论域上的拓扑覆盖加于研究,得出了拓扑覆盖的最简覆盖和基与最小描述元之间的关系.介绍了在基于有限论域U上的覆盖,构造U上的一个拓扑的方法.并且在最小描述元的基础上将划分下的粗糙隶属函数推广至一般覆盖下的粗糙隶属函数,而后介绍了其相关运用.     

Reduction about approximation spaces of covering generalized rough sets

The introduction of covering generalized rough sets has made a substantial contribution to the traditional theory of rough sets. The notion of attribute reduction can be regarded as one of the strongest and most significant results in rough sets. However, the efforts made on attribute reduction of covering generalized rough sets are far from sufficient. In this work, covering reduction is examined and discussed. We initially construct a new reduction theory by redefining the approximation spaces and the reducts of covering generalized rough sets. This theory is applicable to all types of covering generalized rough sets, and generalizes some existing reduction theories. Moreover, the currently insufficient reducts of covering generalized rough sets are improved by the new reduction. We then investigate in detail the procedures to get reducts of a covering. The reduction of a covering also provides a technique for data reduction in data mining.     

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.     

Topology vs generalized rough sets

This paper investigates the relationship between topology and generalized rough sets induced by binary relations. Some known results regarding the relation based rough sets are reviewed, and some new results are given. Particularly, the relationship between different topologies corresponding to the same rough set model is examined. These generalized rough sets are induced by inverse serial relations, reflexive relations and pre-order relations, respectively. We point that inverse serial relations are weakest relations which can induce topological spaces, and that different relation based generalized rough set models will induce different topological spaces. We proved that two known topologies corresponding to reflexive relation based rough set model given recently are different, and gave a condition under which the both are the same topology.     

覆盖广义粗糙集的模糊性

在研究覆盖广义粗糙集的基础上,利用两个距离函数Hamming和Euclidean距离函数,结合模糊集的最近寻常集,引入了覆盖广义粗糙集模糊度的概念,给出了一种模糊度计算方法,并证明了该模糊度的一些重要性质。这些结果在覆盖广义粗糙集的理论研究和应用都发挥着一定作用。