reduct

Range reduct based on variable precision rough set model ;

变精度粗集模型是一种有参数的粗集扩充模型。

Incremental update of attribute reduct : two algorithms are proposed .

3属性约简的增量更新：提出了两种算法。

Thus a relatively perfect theory and technique scheme of dynamic reduct of the decision table is formed .

形成了较为完善的决策表动态约简理论和技术方案。

Combining the max rate sampling strategy and the discernibility matrix together creates the dynamic reduct algorithm .

结合概率抽样策略和差别矩阵构造出一个动态约简算法。

A statistical definition of the reduct is propose and a RS feature selection algorithm upon the definition is developed .

针对粗集“简化”在实际应用中存在的问题提出了“统计简化”的定义和相应属性搜索算法。

An information entropy based Reduct searching algorithm is proposed to benefit the applications of rough sets theory when it is used to small data set .

提出了基于粗集动态建立规则模型的方法，克服了小数据库建模的困难和粗集约简的缺点。

Secondly , ARS is used to reduct the neurons in input layer and hidden layer for optimizing BP Neural Network structure .

其次，在属性约简策略ARS基础上优化BP网络结构，约简BP网络结构输入层和隐层单元。

We study the semirings whose additive reduct are semilattices and multiplicative reduct are rectangular groups .

研究了加法半群为半格、乘法半群为矩形群的半环。

Moreover , dynamic reduct and the method on establishing the decision rules resulted from it can offer more efficient and precise data for the two fields mentioned above .

而动态约简及其由约简结果制定决策规则的方法更能为以上两个领域提供高效、精确的数据保证。

Finding the minimal reduct is a NP-hard problem , so we present a fast hybrid genetic algorithm for the reduct computation of rough set to get the approximate result .

由于计算最小约简是个NP难问题，所以我们使用了基于遗传算法的启发式算法来缩短计算时间，以便得到一个近似的最优解。

Central to this technique is the problem of searching for a reduct which is a minimal subset of information that has the same ability to classify data as when the full set of information is used .

而这种技术的核心问题是寻找一种最小缩减，即与原信息集合有相同的区分数据能力的最小的信息子集。