Updating attribute reduction in incomplete decision systems with the variation of attribute set

In rough set theory, attribute reduction is a challenging problem in the applications in which data with numbers of attributes available. Moreover, due to dynamic characteristics of data collection in decision systems, attribute reduction will change dynamically as attribute set in decision systems varies over time. How to carry out updating attribute reduction by utilizing previous information is an important task that can help to improve the efficiency of knowledge discovery. In view of that attribute reduction algorithms in incomplete decision systems with the variation of attribute set have not yet been discussed so far. This paper focuses on positive region-based attribute reduction algorithm to solve the attribute reduction problem efficiently in the incomplete decision systems with dynamically varying attribute set. We first introduce an incremental manner to calculate the new positive region and tolerance classes. Consequently, based on the calculated positive region and tolerance classes, the corresponding attribute reduction algorithms on how to compute new attribute reduct are put forward respectively when an attribute set is added into and deleted from the incomplete decision systems. Finally, numerical experiments conducted on different data sets from UCI validate the effectiveness and efficiency of the proposed algorithms in incomplete decision systems with the variation of attribute set.     

属性数学-属性测度和属性统计

本文研究了属性集和属性测度,它们是属性数学的基础.本文提出了属性统计方法,并指出,概率统计、模糊统计、集值统计是它的特殊情况.     

集值映射的函数单调性和余强制性

本文介绍几个新的集值映射的函数单调性和余强制性概念，并讨论它们与已有概念间各种可能的蕴含关系．     

Lattice Im plication Homom orphism inIm plication Filter Spaces

ＩｍｐｌｉｃａｔｉｏｎｆｉｌｔｅｒｓｄｅｒｉｖｅｆｒｏｍＭｏｄｕｓＰｏｅｎｅｓＲｕｌｅｉｎｌｏｇｉｃ．Ｉｔｉｓｖｅｒｙｉｍｐｏｒｔａｎｔｔｏｓｔｕｄｙｌａｔｔｉｃｅｉｍｐｌｉｃａｔｉｏｎａｌｇｅｂｒａｓａｎｄｔｈｅｃｏｒｒｅｓｐｏｎｄｉｎｇｌａｔｔｉｃｅ－ｖａｌｕｅｄｌｏｇｉｃｓｙｓｔｅｍ．Ｉｎｏｒｄｅｒｔｏｉｎ－ｖｅｓｔｉｎｇａｔｅｌａｔｔｉｃｅｉｍｐｌｉｃａｔｉｏｎａｌｇｅｂｒａｓｆｒｏｍｔｈｅｖｉｅｗｏｆａｎａｌｙｓｉｓ，ｉｍｐｌｉｃａｔｉｏｎｆｉｌｔｅｒｓｐａｃｅｈａｓｂｅｅｎｅｓｔａｂ…     

关于格上蕴涵代数及其对偶代数

给出了格蕴涵代数、MV代数、R₀代数等一些格上蕴涵代数之间的关系,并建立了它们的对偶代数.其结果描述了这些代数内部结构的特征,同时也为从语义的角度进一步研究格值逻辑系统提供了一个新的途径.     

Simple Axioms for Orthomodular Implication Algebras

Simple, independent axioms for orthomodular implication algebras are presented.     

格蕴涵代数的直觉模糊LI-理想

本文深入研究了格蕴涵代数的直觉模糊\textit{LI}-理想理论.给出了直觉模糊\textit{LI}-理想的若干新的性质和等价刻画. 建立了由一个直觉模糊集生成的直觉模糊\textit{LI}-理想的表示定理.证明了一个格蕴涵代数的全体之集模糊\textit{LI}-理想之集在直觉模糊包含序下构成一个完备的分配格.     

基于神经网络的结构损伤诊断的探讨

利用神经网络技术对框架结构的损伤位置和损伤程度进行了研究,用振动模态分析技术对组合结构、框架结构的动力参数进行计算,得出组合结构的各种单损伤情况和双损伤情况的各种组合的频率、竖向位移、水平位移变化数据,将这些数据和损伤位置、损伤程度之间的映射关系作为网络训练样本,用神经网络技术进行数值模拟,提出了修正隐含层节点数公式和优选振型向量的方法.说明了用低阶振型和经优选后的振型向量结合的方法进行组合结构、框架结构损伤诊断的可行性,并且用这个方法成功地解决对称结构难于判断对称损伤的难题.     

三I表达式取最小值时的最优解

在本文中，针对蕴涵算子$R_0$,我们给出了当$A\rightarrow B$与$A^*(B^*)$给定时,求使三I表达式$(A\rightarrow B)\rightarrow(A^*\rightarrow B^*)$取最小值的全体$B^*(A^*)$之集的上确界(下确界)算法.并将上确界算法推广到多维多重的模糊推理中.从三I表达式取最值时求最优的$B^*(A^*)$的角度来看,本文是三I算法思想的延伸和完善.     

格蕴涵代数的LI-理想空间

In this paper,a topological space based on LI-ideals of a lattice implication algebra is constructed,and its topological properties,such as separability,compactness and connectedness are discussed.