共查询到18条相似文献,搜索用时 218 毫秒
1.
2.
现实生活中总存在大量复杂且庞大的数据库,运用同态函数的概念可以对一致覆盖决策系统进行数据压缩。首先介绍关于覆盖的一致函数的定义、覆盖映射的概念以及相关属性,然后提出一致覆盖决策系统中同态函数的定义,并证得一个一致覆盖决策系统可以被压缩成一个相对规模较小的决策系统。同时,在同态函数的条件下,两者的属性约简等价。 相似文献
3.
阐述邻域粗糙集和邻域信息熵的基本定义及性质,为避免数值属性信息系统属性约简过程中,属性离散化造成特征信息的丢失,提出一种新的基于邻域信息熵度量数值属性约简算法。扩展邻域信息系统核属性集生成约简属性集,邻域信息熵度量不仅关注约简属性集正域变化,而且考察负域样本空间约简属性邻域等价类在决策属性划分的分布,具备更好的邻域关系度量细粒度。实验表明,对比邻域粗糙集近似度量、邻域有效信息率度量、邻域软间隔度量的属性约简方法,该算法能有效进行邻域信息系统属性约简的同时,也保持了约简属性集更好的分类精度。 相似文献
4.
5.
6.
7.
8.
作为研究信息系统之间关系的一种有力工具,信息系统同态的概念首先由J.W.Grzyrnala-Busse引入。本文研究了信息系统同态的一些性质,揭示了构成信息系统同态的对象映射、属性映射与值域映射之间的相互依赖性。由给定的论域上的划分,导出了一个新的信息系统同态,该同态对论域的划分与给定划分相同。同时,讨论了信息系统在同态的意义下,上近似与下近似的不变性,为粗糙集理论的进一步研究奠定了理论基础。 相似文献
9.
10.
粗糙集和灰色理论在数据挖掘领域各有优点,它们最终目标都是为了发现知识.将粗糙集和灰色系统结合,研究了区间灰色信息系统在优势关系下的约简方法.在现实世界中,属性之间可能存在着一种属性序的关系,将这种属性序关系引入到基于优势关系的灰色信息系统中,给出了两种属性约简的算法:一种基于分辨矩阵的算法,另一种不基于分辨矩阵的算法.较好地适应了不完备信息系统和大数据集信息系统约简.最后通过实例对比,得出两种算法的约简结果是一致的,并分析了各自的适用范围. 相似文献
11.
Communication between information systems is a basic problem in granular computing. In current research, a homomorphism mapping between information systems is required. In this paper, the concept of the general relation mapping between two universes is proposed in order to construct the equivalence relation on one universe according to the given equivalence relation on the other universe based on the including degrees. The main properties of the mapping are studied, and it is proved that attribute reductions in the original system and image system are equivalent to each other under the given conditions. Finally, we also define the concept of fuzzy general relation mapping between two fuzzy information systems and give some properties. 相似文献
12.
Communication between information systems is a basic problem in granular computing. The concept of homomorphism is a useful mathematical tool to study the communication between two information systems. In this paper, some properties of information systems under homomorphisms are investigated. The concepts of consistent functions are first introduced and their properties are investigated. The concepts of relation mappings between two universes are then proposed in order to construct a binary relation on one universe according to the given binary relation on the other universe. The main properties of the mappings are studied. Finally, the notions of homomorphisms of information systems based on arbitrary binary relations are proposed, and it is proved that attribute reductions in the original system and image system are equivalent to each other under the condition of homomorphism. 相似文献
13.
增量式属性约简是一种针对动态数据集的新型属性约简方法。然而目前的增量式属性约简很少有对不完备混合型的信息系统进行研究。针对这类问题提出一种属性增加时的增量式属性约简算法。在不完备混合型信息系统下引入邻域容差关系。基于邻域容差关系的粒化单调性,提出信息系统属性增加时邻域容差条件熵的增量式更新方法,并提出了不完备混合型信息系统下的邻域容差条件熵增量式属性约简算法。实验分析表明了该算法的有效性。 相似文献
14.
针对原始的各向异性扩散模型在对带噪图像去噪时,只利用了邻域内东、南、西、北4个方向上的参考信息,使得去噪效果不够明显的问题,提出了米字型各向异性扩散模型的图像去噪算法。该算法在利用了原始算法中待修复点周围4个方向上参考信息的基础上,还引入了该点邻域内对角线方向上的新信息,给出了采用周围8个方向上的信息进行对图像去噪的新模型,同时证明了该模型的合理性。用新提出的算法与原算法以及一种改进的同类算法对4幅带噪图像进行去噪。实验结果表明,新提出算法去噪效果的峰值信噪比(PSNR)相比原算法和改进同类算法平均提高1.90dB和1.43dB,平均结构相似度(MSSIM)分别平均提高0.175和0.1,说明该算法更适合于图像去噪。 相似文献
15.
The notion of information system homomorphism as a powerful tool to study the relation between two information systems was
introduced by J.W. Grzymala-Busse. In this work, we will present some characteristics of information system homomorphism,
which reveal the interdependence of the three mappings, namely, object mapping, attribute mapping and value domain mapping.
Besides, given a partition on universe, we can derive a new information system homomorphism defining a partition on universe
identical with the partition given. In the mean time, some invariant characteristics of upper approximation and lower approximation
under information system homomorphism are investigated. At last, we establish a surjection between rough sets of information
systems under an information system homomorphism. 相似文献
16.
Y.Y. Yao 《Information Sciences》2006,176(23):3431-3452
An approximate retrieval model is proposed based on the notion of neighborhood systems. The knowledge used in the model consists of an information table, in which each object is represented by its values on a finite set of attributes, and neighborhood systems on attribute values, which provide semantic similarity or closeness of different values. An information table can be used for exact retrieval. With the introduction of neighborhood systems to information tables, one is able to perform approximate retrieval. Operations on neighborhood systems are introduced based on power algebras. An ordering relation representing the information of a neighborhood system is suggested and examined. Approximate retrieval is carried out by the relaxation of the original query using neighborhood systems, and the combination of intermediate results using neighborhood system operations. The final retrieval results are presented according to the proposed ordering relation. In contrast to many existing systems, a main advantage of the proposed model is that the retrieval results are a non-linear ordering of objects. 相似文献
17.
18.
属性约简是一种重要的数据挖掘方法。为了对混合型信息系统达到更好的属性约简性能,提出一种邻域组合度量的启发式属性约简算法。邻域依赖度是构造混合信息系统属性约简的常用方法,根据粒计算的视角,在混合信息系统中提出邻域知识粒度用于评估属性的粒化能力。将邻域依赖度与邻域知识粒度进行结合,提出混合信息系统下的邻域组合度量,并将该度量方法作为启发式函数,提出一种属性约简算法。实验分析表明,该算法比混合信息系统的其他相关属性约简算法具有更高的约简性能。 相似文献