单向变异S-粗集的信度特征

提出单向变异S-粗集属性迁移的信度及信度函数的概念;给出了单向变异S-粗集的依信度生成;讨论了单向变异S-粗集依信度生成的特性.

双向变异S-粗集的信度特征

提出双向变异S-粗集的属性迁移的信度及信度函数的概念,给出了双向变异S-粗集的依信度生成,讨论了双向变异S-粗集依信度生成的特性.

变精度双向变异S–粗集及其结构

将双向变异S–粗集模型推广为变精度双向变异S–粗集,给出了变精度双向变异S–粗集与变精度双向S–粗集的等价性定理和变精度变异–对偶原理.

单向变异S-知识的过滤特征及数据挖掘

提出了单向变异S-知识、单向变异S-知识粒度、过滤度的概念。利用这些概念讨论了单向变异S-知识的颗粒特征、过滤特征。最后给出了单向变异S-知识的最先挖掘原理,变异S-知识的最先过滤原理。

变精度单向变异S-粗集及其结构

提出变精度单向变异S-粗集,给出变精度单向变异S-粗集的数学结构,提出变精度单向变异S-粗集与变精度单向S-粗集的等价性定理与变精度变异-对偶原理。

广义双向变异S-粗集与变异结构

基于变异S-粗集和相容关系,提出了广义双向变异S-粗集,给出了它的变异结构,并对广义双向变异S-粗集的有关性质进行了讨论。广义双向变异S-粗集为研究具有相容关系的动态系统提供了新的途径和方法。

变精度变异函数S-粗集与F-结构

动态系统规律知识是规律对象(规律外延)与规律属性(规律内涵)的统一体,利用变异单向函数S-粗集与变精度粗集提出变精度变异单向函数S-粗集的概念和它的F-结构,给出变精度变异单向函数S-粗集的有关性质定理和推论,对此进行了讨论。应用变精度变异函数单向S-粗集对动态系统的内涵规律的精度进行数据挖掘。容易挖掘-发现出动态系统中规律的相关性和规律的近似决策规则。变精度变异单向函数S-粗集为研究动态系统规律提供了一种新的途径。

双向变异S-概率粗集和它的属性概率性质

利用双向变异S-粗集的属性动态迁移特性,结合知识库中的统计信息,提出了双向变异S-概率粗集.讨论了双向变异S-概率粗集的属性概率性质,为获得动态的决策规则奠定了基础.利用上述讨论,给出了一个具体的应用实例.

变异函数S-粗集

利用函数S-粗集(function singular rough sets),提出了变异函数S-粗集,给出了变异函数S-粗集的数学结构和特性。变异函数S-粗集具有两类形式:单向变异函数S-粗集,双向变异函数S-粗集。

一种基于单向变异S-概率粗集的动态决策方法

针对因决策因素个数的减少而导致的决策精度降低的情况,提出了一种基于单向变异S-概率粗集的动态决策方法。利用单向变异S-概率粗集的属性动态迁移特性,结合知识库中的统计信息,讨论了单向变异S-概率粗集模型的属性概率性质。利用上述性质的讨论,给出了一个具体的军事动态决策实例,从而证明该方法可以有效地提高决策精度。

f-heredity knowledge and f-heredity mining

Using S-rough sets, this paper gives the concepts off-heredity knowledge and its heredity coefficient, and f-variation coefficient of knowledge; presents the theorem of f-attribute dependence of variation coefficient and the relation theorem of heredity-variation. The attribute dependence of f-variation coefficient and the relation of heredity-variation are important characteristics of S-rough sets. From such discussion, this paper puts forward the heredity mining off-knowledge and the algorithm of heredity mining, also gives its relative application.

F-rough law and the discovery of rough law

By using function one direction S-rough sets （function one direction singular rough sets）, this article presents the concepts of F-law, F-rough law, and the relation metric of rough law; by using these concepts, this article puts forward the theorem of F-law relation metric, two orders theorem of F-rough law relation metric, the attribute theorem of F-rough law band, the extremum theorem of F-rough law relation metric, the discovery principle of F-rough law and the application of F-rough law.

F-Law collision and system state recognition

Using function one direction S-rough sets （function one direction singular rough sets）, f-law and F- law and the concept of law distance and the concept of system law collided by F-law are given. Using these concepts, state characteristic presented by system law collided by F-law and recognition of these states characteristic and recognition criterion and applications are given. Function one direction S-rough sets is one of basic forms of function S-rough sets （function singular rough sets）. Function one direction S-rough sets is importance theory and is a method in studying system law collision.

F-generation law and recognition of system law

If a system is not disturbed （or invaded） by some law, there is no doubt that each system will move according to the expected law and keep stable. Although such a fact often appears, some unknown law breaks into the system and leads it into turbulence. Using function one direction S-rough sets, this article gives the concept of the F-generation law in the system, the generation model of the F-generation law and the recognition method of the system law. Function one direction singular rough sets is a new theory and method in recognizing the disturbance law existing in the system and recognizing the system law.

Hiding dependence-discovery of F-hiding laws and system laws

Function one direction S-rough sets have dynamic characteristics and law characteristics. By using the function one direction S-rough sets, this article presents the concepts of the f-hiding law, F-hiding law, f-hiding law dependence and F-hiding law dependence. Based on the concepts above, this article proposes the hidingdependence theorem of f-hiding laws, the hiding-dependence theorem of F-hiding laws, the hiding-dependence separation theorem, the hiding dependence-discovery principle of unknown laws. Finally, the application of the hiding dependence of hiding laws in the discovery of system laws is given.

■-law collision and system state recognition

Using dual function one direction S-rough sets, this article gives the f-law, the F-law, law distance and the concept of system law collided by the F-law. The characteristics presented by the system law collided by the F-law, the recognition of these characteristics and recognition criterion are also proposed. The dual function one direction S-rough sets is one of the basic forms of function S-rough sets. Its basic theory and application in the study of system law collision are reviewed.

基于一个水平集函数的多相图像分割方法

利用多个特征函数标记不同区域的方法进行图像分割时,需要对多个函数求极值,导致计算量增大。针对该问题,设计一个函数在多层水平集标记的方法,通过求解一个标记函数的极值问题实现对图像不同区域的分割。总结区域标记函数规律,得到多项图像分割模型表达式,将其与变分水平集方法相结合,运用交替方向乘子法加速求解能量泛函极值问题。实验结果表明,该方法能够实现图像多个区域的分割,并且保证分割结果的鲁棒性和计算高效性。

单向变异S-粗模糊集

从动态系统中对象集所对应的属性集出发，结合模糊集理论和变异S-粗集理论提出单向变异S-粗模糊集的概念、结构及其性质，并对此进行了讨论．

基于全变分最小化和快速一阶方法的低剂量CT有序子集图像重建

低剂量计算机断层成像(computed tomography,CT)具有减少X射线对患者的伤害的优势.本文主要针对从不完备投影数据重建出高质量低剂量CT图像的问题.通常,这个问题可以通过统计图像重建方法来实现,而统计重建算法需要非常多的迭代次数,导致了巨大的计算时间压力,以至于很难应用在实践中.为解决此问题,本文提出一种有序子集重建算法,该算法结合了全变分最小化和快速一阶方法以减少重建的迭代次数,采用Split Bregman交替方向法求解上述优化问题,利用投影到凸集合的方法加快迭代的收敛速率.实验结果表明,在同样的迭代次数下,本文提出的方法与基于有序子集的一阶方法相比较,相对重建误差的下降速度更快.