将决策表进行属性约简，值约简。
并提出改进的值约简算法，时间复杂度在原有基础上大大减少。
And putting forwarded the improved algorithm of value attribute reduction that decreases the complexity of time greatly.
将属性值约简和数据挖掘相结合，给出支持度、置信度、覆盖度的定义。
This paper associates attributive value reduction with data mining and proposed three concepts: support, confidence and coverage.
改进了一种粗糙集决策表的值约简算法，并将其应用到文本分类规则的提取中。
A reduction algorithm based on rough set is improved and then applicated to extract the rules of text categorization.
然后在属性值约简中进一步去除与用户无关的属性，从而抽取个性化决策规则。
Secondly, during reduction of attribute values, some irrelevant attributes are further eliminated, then abstractation of personalized decision rules is accomplished.
通过算法复杂度分析说明，该算法在一定程度上解决了属性值约简的NP难问题。
The algorithm complexity analysis shows that, to a certain extent, the algorithm could resolve the NP hard problems of attributive value reduction.
然后采用粗糙集的值约简算法来进行文本分类规则的抽取，从而得到最终的文本分类规则。
Using rough set of the final value reduction algorithm for text classification rules extraction, thus gained the final text classification rules.
粗糙集理论的主要思想是在保持分类能力的前提下通过属性约简和值约简提取的决策规则。
The main idea of rough set theory is to extract decision rules by attribute reduction and value reduction in the premises of keeping the ability of classification.
该文分析属性值约简，针对协调决策表提出一种通过构造决策矩阵直接获取最简规则的方法。
This paper analyses attribute value reduction, and presents a method to acquire briefest rules directly by constructing decision matrix in consistent decision table.
在定义的基础上，给出了基于二进制区分矩阵的求核算法、相对属性约简算法及值约简算法。
Based on the definitions, the core finding algorithm, the relative attribute reduction algorithm and value reduction of information decision system are presented based on binary discernibility matrix.
通过属性约简和值约简，找出影响成型质量的关键因素，从而得到判断成型结果的决策规则。
The key factors affecting the quality of molding were detected through attribute reduction and value reduction, and the decision rules important to control the molding results were thus obtained.
粗糙集理论中的值约简和数据挖掘领域中的决策树都是有效的分类方法，但二者都有其局限性。
Value reduction in rough set theory and decision tree in data mining are effectively used in the classification, but each of them has shortcomings.
然而，知识约简离不开一系列的算法作支撑，包括判断属性的重要性、求核、属性约简和值约简等。
However, knowledge reduction is dependent on a series of supporting algorithms such as the calculation of attribute significance, finding core, attribute reduction and value reduction.
同时，借助决策矩阵进行值约简，提出了一种新的规则提取算法，使最终得到的决策规则更加简洁。
Furthermore, a new algorithm for rule extraction based on decision matrices was presented. And much more concise decision rules could be got with this method.
并给出了粗糙集理论中属性约简以及值约简的常规算法，在此基础上给出了基于信息量的属性约简算法。
The general algorithm of attribute reduction and value reduction is presented, from which the attribute reduction algorithm based on information is proposed.
并将单一决策属性下的属性值约简方法推广，讨论了更适于编队作战分析的多决策属性下的属性值约简问题。
Then, considering the practical requirements of team combat, a method for reduction of attribute-values under single decision attribute is extended to the reduction under multi-decision attributes.
最后，建立了一个利用约简决策表的距离图求决策规则的核值及最小决策算法的算法框架。
At last, applying the distance graph of the reduced decision table, we propose a way to get the core of each decision rule.
该方法将CHI值特征选取和粗糙集理论充分结合，避免了用粗糙集对大规模决策表进行特征约简，同时避免了决策表的离散化。
The method combined CHI value feature selection and rough set theory fully so as to avoid both feature reduction on a large scale decision table and the discretization of the decision table.
此外，通过对不相容决策表的正区域的决策值和边界域对原决策表进行分解，得到了一种分布式增量属性约简模型。
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.
提出了基于约简纹理谱特征值的分割方法。
A new segmentation of image based on the feature of reduced texture spectrum is proposed.
粗糙集中决策表约简也就是以基于最少的条件属性和最小冗余的属性值导出最少的决策规则或分类规则。
Simplification of Decision tables in Roouh set is order to lead decision rule or categorised rule at the least on the basis of the least condition attribute and minimum redundant attribute value.
通过加权关键路径算法，可以计算工作流完成时间的期望值及记录约简过程中的中间结果，从而确定工作流模型的关键路径。
A weighted critical path algorithm was provided to calculate the expectation value of the workflow's duration, record the process of reduction, and identify the time-oriented critical path.
对此，对拥有6个属性（4个条件和两个决策属性）以及10 2个个体的一致决策表或邻域值决策表进行处理并生成了约简的决策规则。
Thus, reduction of the tables is handled to possess 6 attributes (4 conditional attributes and 2 decision attributes) and 102 objects to use two methods respectively, and to obtain the same results.
结果表明，该算法能够正确地对实值属性信息系统进行规则约简。
The experimental results show that the algorithm can correctly reduce rules for real value attribute information system.
本文从属性值缺失的填补、属性约简和决策树分支属性选择三方面进行研究。
The attribute missing values filling, attribute reduction and the choice of decision tree branch attributes are researched in this paper.
本文研究应用粗集理论对实值信息系统属性进行约简的方法。
In this paper, we study the problem of rules reduction for real value information systems by using of rough set theory.
特别的，得到了决策属性只取两个决策值的决策表，其广义决策约简同相对约简是等价的。
In particular, a decision table in which the decision attribute has only two values is obtained, and its generalized reduction and relative reduction are equivalent.
特别的，得到了决策属性只取两个决策值的决策表，其广义决策约简同相对约简是等价的。
In particular, a decision table in which the decision attribute has only two values is obtained, and its generalized reduction and relative reduction are equivalent.
应用推荐