基于粗糙集的不完备信息系统的模型扩展和属性约简-应用数学专业论文.docxVIP

中文摘要摘要 中文摘要 摘要 粗糙集理论是上世纪八十年代初由波兰数学家Pawlak首先提出的一种用于数 据分析的数学理论。其主要思想是利用已知的知识或信息来近似不精确的概念或 现象。自上世纪九十年代以来，粗糙集在理论上不断完善，在应用上广泛扩展， 己逐渐成为国际学术界的研究热点之一。 在经典粗糙集中，论域上的等价关系起着至关重要的作用。但在现实中，论 域上的二元关系经常不是等价的，此时经典粗糙集模型的应用受到限制，例如， 由于空值的存在，无法利用属性值来建立等价关系。在不完备信息系统中，建立 一种什么样的二元关系，是进一步研究不完备信息系统的粗计算、知识约简以及 规则提取的基础。 本文从经典粗糙集模型中的等价关系入手，引入多数包含关系对不完备信息 系统的粗集模型进行了扩充，提出四种扩展的、裉集模型，这几种扩展模型是原柬 模型的推广和改进，既保留了原来模型的优点又丢弃了原来模型的缺陷。 基于变精度粗糙集理论与包含度理论，引入了上、下分布约简的概念，并讨 论了它们之问的关系。通过对这两种知识约简的等价刻画，得到了上、下分白知 识约简的判定定理，从而提出了不完备信息系统属性约简的新方法。 关键字：变精度粗糙集：不完备信息系统；扩展模型；属性约简 英文摘要Extended 英文摘要 Extended model and attributes reduction of rough set to incomplete information systems Abstract Rough set theory,proposed by Pawlak in the early 1980s，is a mathematical theory for reasoning about data．The main idea of the theory is to approximate inexact, uncertain concepts by using of available knowledge or information．Since 1990s，it has attracted much attention of researchers around the world，and has been well developed and applied．Now,this theory has become a flash point in the research area of computer science and information science． In classical RouIgh Set，the equivalence relations play important roles．In fact，the equivalence relations are likely to inexistence in practice，so the classical rough set theory is limited in incomplete information systems．For example，because of null value， the equivalence relations area’t constructed via attributes value．The kind of binary relation is basis for rough compute，attributes reduction and extract rules in incomplete information systems． Started with the equivalence relations of classical rough set model，we put forward four kinds of extensions rough set model by introduceding majority inclusion relation． Not only does the extension reserve the advantages of the present model，but also these models discard the disadvantages of the present model． The paper introduces some new concepts of knowledge reduction based on variable precision rough set theory such as upper distribution reduction a