查询词典 in rough

In rough sets based on accessible relation, we merge rough set theory and accessible relation into one model. Compared with classical rough set models(including Pawlak rough set model and various precise rough set model), the new model is more general.

基于可达关系的粗糙集模型是将可达关系应用于粗糙集理论中，这种模型比传统的粗糙集模型(Pawlak模型和可变精度粗糙集模型)更一般，将粗糙集理论推广到一般的方法论。

In this paper, granularity in rough set theory is used to describe rules based on the concept of rough degree. A tool for knowledge dependent relation diagram is put forward. Then dimensional knowledge granularity decision space and the same construction mapping decision space based on multi-decision sorts is established, and decision algorithm based on KDRD and decision space is introduced. Finally, through combining with the technique of fault diagnosis, it is proved that the approach is very appropriate to the intelligent decision system.

本文利用粗糙集理论中的粗度概念，在对获取规则进行扩展性的粒度描述的基础上，提出了一种工具―知识依赖关系图，构造了n维知识粒度决策空间以及基于多决策类的同构映射决策空间，建立了基于KDRD和决策空间的决策算法，并结合机械故障诊断说明了本方法非常适于故障诊断等通过结论获取原因的智能决策系统。

After a brief summary on data mining and rough set theory, the research works in the thesis can be descript as follows: 1. To the problem that finding rules in enormous data is very timeconsumable and the expansibility of existed algorithms is not very good, the thesis proposes a new method to discompose large data table based on the concepts of positive region and the importance of attribute in rough set theory.

Rough集理论是一种新型的处理不确定性知识的数学工具，围绕着数据挖掘领域存在的问题，本文利用Rough集理论与Rough分析工具，提出若干解决方案，同时在具体处理问题过程中引入了信息理论、因子分析等方法，与Rough分析结合使用，讨论了Rough集技术在知识发现、关联规则挖掘、模式分类以及数据清洗等问题中的应用。

Secondly, the dissertation studies the technique of mining discriminant rule in rough set model of information system.

其次，本文研究了基于信息系统的Rough集模型挖掘概念区分规则的方法。

Advanced by Z.Pawlak in 1982,the rough set theory analyzes inadequate information efficiently such as inexactitude or dissonant information.The advantage of the rough set theory is no need of any initial or extra information such as the probability dispersal of statistics and so on.

Z.Pawlak于1982年提出的Rough集理论有效地分析了不确定、不精确、不一致等各种不完备信息，其优点是无需任何关于数据的初始的或附加的信息，如统计学中的概率分布。

In Chapter 5,some studies on rough set theory shows that rough set is equivalent to nonmeasurable set in some sense.

第五章对rough set理论作了一定的研究，指出了rough set与不可测集在一定意义下等价。并且借助于M。

The throughput forecasting of thin-film evaporator is quite difficult and the precision is quite low because of high complexity of the process.By the Rosetta data analysis saddlebag based on the Rough set theory,the total process of knowledge discovery in databases was accomplished including data preparing,data analysis and the interpreting of the results.

Rough集理论[1-3]自1982年由波兰数学家Pawlak Z教授提出以来，经过20多年的研究和发展，在系统理论、计算机模型的建立和应用系统的研制开发上，已经取得了许多成果，也建立了一套完整的Rough集理论体系，特别是由于上世纪80年代末和90年代初在知识发现等领域得到成功的应用而受到国际上广泛关注。

This dissertation proposes group reasoning and group AHP-based GDSS structure and its decision steps to solve the problems existing in research of theory and application of GDSS. Besides, the dissertation also studies the method of group reasoning on rough-set and qualitative reasoning method basis in GDSS. It also studies on constructing method of hierarchy structure of group AHP in GDSS and combinative method of judgment matrixes. Moreover, it studies on method regarding construction of judgment matrixes on rough set based and optimization theory of convex combination parameters of judgment matrixes as well. Finally, it develops an AHP based GDSS to demonstrate the efficiency of these methods.(1) This dissertation also summarizes the developing trend of GDSS and analyses problems as regards the research of GDSS.

本论文针对GDSS理论研究及应用中存在的若干问题，提出了基于群体推理及群体层次分析法的GDSS结构，并给出了基于该结构的GDSS的决策程序；研究了GDSS环境下的基于粗糙集理论及定性推理技术的群体推理方法，并举例说明了方法的有效性；研究了GDSS环境下群体AHP层次结构的建立、判断矩阵集结的理论与方法；研究了判断矩阵凸组合系数的优化原理；探讨了基于Rough Set的判断矩阵构造方法；开发了一个基于AHP的GDSS原型系统，旨在验证本文关于GDSS环境下群体AHP有关方法的有效性。

In this paper, based on the indiscernibility discipline in Rough Set theory, two new measurement definitions are defined: attribute Maximum Discernibility Value and Attribute Redundancy Rate.

基于Rough Set理论中的不可分辨性原理，给出两个新的定义：属性的最大区分值(Maximum Discernibility Value， MDV)和属性冗余度(Attribute Redundancy Rate， ARR)。

Rough in, rough, rough out roughish

a。 略粗糙的，略粗暴的，有点刺耳的

Do you know, i need you to come back

你知道吗，我需要你回来

Yang yinshu、Wang xiangsheng、Li decang,The first discovery of haemaphysalis conicinna.

1〕 杨银书，王祥生，李德昌。安徽省首次发现嗜群血蜱。