首页> 中文学位 >Research on Fuzzy Characterization of Rough Set and Characters of Knowledge Granule
【6h】

Research on Fuzzy Characterization of Rough Set and Characters of Knowledge Granule

代理获取

目录

Abstract

Abstract in Chinese

Notation

Chapter 1 Introduction

1.1 A Survey for the Advances of Rough Set Theory

1.1.1 Introduction of Rough Set Theory and Its Development

1.1.2 Main Problems Studied in Rough Set Theory

1.2 Basic Concepts of Rough Set

1.2.1 Definition of Rough Set and Some Important Concepts

1.2.2 Characterized Description of Rough Set

1.2.3 Rough Membership Function

1.2.4 Reduction and Core of Knowledge

1.2.5 Dependency of Knowledge

1.2.6 Representation Methods of Knowledge

1.3 Main Work in This Paper

Chapter 2 New Methods for Measuring Fuzziness in Rough Set

2.1 Fuzziness in Rough Set

2.1.1 Concepts of Fuzziness

2.1.2 Fuzziness in Rough Set Based on Equivalence Relation

2.1.3 Two New Calculating Formulae of the Fuzziness in Rough Set

2.1.4 Generalized Fuzziness in Rough Set Based on General Binary Relation

2.2 Measures of Similarity Between Rough Sets

2.2.1 Concepts of Similarity

2.2.2 Similarity Between Rough Sets Based on Equivalence Relation

2.2.3 Generalized Similarity Between Rough Sets Based on General Binary Relation

2.3 Fuzziness Induced by Similarity Based on Equivalence Relation

Chapter 3 Extensions of Rough Set Based on Rough Membership Function

3.1 Rough Membership Function Representation of Pawlak Rough Set and Its Limitations

3.2 λ-Rough Set Based on Rough Membership Function

3.2.1 λ-Rough Set Based on Equivalence Relation

3.2.2 Generalized λ-Rough Set Based on General Binary Relation

3.3 (α,β)-Rough Set Based on Rough Membership Function

3.3.1 (α,β)-Rough Set Based on Equivalence Relation

3.3.2 Generalized(α,β)-Rough Set Based on General Binary Relation

Chapter 4 Rough Set and Its Produced Knowledge and Knowledge Granule

4.1 Characters of Knowledge Granule and Calculation of Knowledge Granulation

4.1.1 Characters of Knowledge Granule

4.1.2 Calculation of Knowledge Granulation

4.1.3 Relations Between Knowledge Granulation, Discernibility Degree and Entropy

4.2 Knowledge Granulation Representation of the Concepts and Operations in Rough Set Theory

4.3 Attribute Reduction Based on Knowledge Granulation Under Information Systems

4.3.1 Attribute Reduction of Information Systems

4.3.2 Knowledge Granulation of Information Systems

4.3.3 Attribute Significance of Information Systems

4.3.4 A Knowledge Granulation-based Algorithm for Attribute Reduction under Information Systems

4.4 Attribute Reduction Based on Knowledge Granulation Under Incomplete Information Systems

4.4.1 Basic Concepts of Incomplete Information Systems

4.4.2 Attribute Reduction of Incomplete Information Systems

4.4.3 Knowledge Granulation of Incomplete Information Systems

4.4.4 Attribute Significance of Incomplete Information Systems

4.4.5 A Knowledge Granulation-based Algorithm for Attribute Reduction under Incomplete Information Systems

Chapter 5 Inducing Rough Region and Inducing Rough Correlation Region of Rough Set

5.1 Concepts and Properties of Inducing Rough Region and Inducing Rough Correlation Region

5.1.1 Basic Inducing Rough Factor and Basic Inducing Rough Correlation Factor

5.1.2 Concepts and Properties of Inducing Rough Region and Inducing Rough Correlation Region

5.2 Definitions and Properties of Some Particular Rough Sets

5.3 Approximately Exact of Rough Problems in Rough Set

5.3.1 An Impact of the Structure Feature of Inducing Rough Region and Inducing Rough Correlation Region on the Accuracy of Classification

5.3.2 Approximately Exact Methods of Rough Problems

Conclusions

Bibliography

Acknowledgements

Papers Published and Research Projects Undertaken During Studying for the Doctorate

学位论文评阅及答辩情况表

展开▼

摘要

本文对粗糙集的模糊刻画与知识颗粒特征进行了研究。全文的主要内容如下:
  Z.Pawlak于1982年提出的粗糙集理论(Rough Set Theory)是一种处理不完全和不精确信息的新型数学工具。近年来,该理论在计算机科学及多种领域获得了成功的应用。本文第一章对粗糙集理论的产生和发展,研究的主要问题和粗糙集的基本概念等进行了综述。
  在粗糙集理论中,一个不精确的概念往往具有一个模糊的不可被明确划分的边界,而边界的存在使得粗糙集中存在着模糊性。在粗糙集理论的实际应用中,有时需要了解一个粗糙集的模糊程度,有时需要在两个粗糙集中比较哪个模糊性更大些或者比较它们之间的相近程度等等。因此寻求一个合适的度量来刻画知识的模糊性是粗糙集理论研究的一个重要方向。
  Pawlak和Skowron提出用粗隶属函数来刻画知识的模糊性。事实上,通过对象的粗糙隶属度,可以将粗糙集中的模糊性用一个模糊集来表示,Chakra-barty提出了一种通过这个模糊集和与它最临近的清晰集间的距离来测量粗糙集模糊性程度的方法,并给出粗糙集模糊度的一般定义和线性模糊度、二次模糊度的具体形式,研究了模糊度的基本性质:He Yaqun借助这个模糊集给出粗糙集模糊性测量的熵方法,定义了粗糙集的一种模糊熵,研究了该模糊熵的基本性质:Wei Lili则研究了一般关系下粗糙集的模糊性和概率粗糙集的模糊性。
  针对粗糙集中的模糊性度量问题,本文第二章以粗隶属函数所导出的模糊集为工具,构造了粗糙集的线性模糊度和二次模糊度的一种新的等价形式,并将这两种形式拓展到一般二元关系的情形;研究了两个粗糙集之间的相近程度的度量,提出贴近度的概念,定义了粗糙集的Monkowski距离贴近度、Hamming贴

著录项

相似文献

  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号