给出了最大分布约简、分配约简、分配序约简的一般算法。
The general algorithms for maximum distribution reduction, assignment reduction and ordered assignment reduction are examined and their time complexities are analyzed.
基于这一思想提出了分级粗糙集模型和分级最大分布约简、分级分布约简的概念。
From this view a partition of the boundary of a rough set is obtained and the concepts of band rough set and band distribution reduction and maximum distribution reduction are presented.
接着对分布约简的可辨识矩阵中等价类的区分关系进行改进，提出一种新的近似约简算法。
Secondly, it introduces an improved algorithm which revises the discernibility relation of similarity sets on the basis of the Discernibility Matrix of distribution reduction.
对于决策表，人们从不同的角度出发，提出了正域约简、熵约简、分布约简、分配约简、近似约简等约简理论与方法。
As to decision table, positive domain reduction, entropy reduction, distributive reduction, distribution reduction, approximate reduction and so on are introduced from different views.
此外，通过对不相容决策表的正区域的决策值和边界域对原决策表进行分解，得到了一种分布式增量属性约简模型。
A distributed model of incremental attribute reduction is also presented by decomposing values of decision attribute of positive region and boundary region in non-tolerant decision table.
为解决分布式本体融合过程导致的术语包含关系大量冗语的问题，文中提出一种关系约简算法，消除了传递可推导冗语关系，澄清了本体结构。
In order to reduce redundant relations inducted by ontology fusion, this paper proposes a method for eliminating those redundant inclusion relations and clarifying the structure of the fused ontology.
为解决分布式本体融合过程导致的术语包含关系大量冗语的问题，文中提出一种关系约简算法，消除了传递可推导冗语关系，澄清了本体结构。
In order to reduce redundant relations inducted by ontology fusion, this paper proposes a method for eliminating those redundant inclusion relations and clarifying the structure of the fused ontology.
应用推荐