基于相关族的偏覆盖粗糙集约简理论及方法

项目名称： 基于相关族的偏覆盖粗糙集约简理论及方法

项目编号： No.11201490

项目类型： 青年科学基金项目

立项/批准年度： 2013

项目学科： 数理科学和化学

项目作者： 杨田

作者单位： 中南林业科技大学

项目金额： 22万元

中文摘要： 偏覆盖（也称领域系统）粗糙集是覆盖粗糙集和二元关系粗糙集的共同推广，其属性约简是粗糙集理论中最重要的内容之一。而偏覆盖粗糙集属性约简算法的研究存在重复设计和缺失等问题。相关族，是由本项目负责人专门针对覆盖粗糙集约简特点而提出的一种新型约简工具。它可以解决区分矩阵无法解决的覆盖粗糙集属性约简问题，并能以之为基础设计出高性能的启发式算法。本项目将在相关族的基础上从两方面解决偏覆盖粗糙集约简问题：（1）以约简类型为依据将多种广义粗糙集模型进行分类，避免重复研究；（2）给出多种广义粗糙集属性约简和相对属性约简的充要条件，基于相关族方法设计属性约简和相对属性约简算法，并以此为基础设计高性能的启发式算法。本项目旨在建立起一个相对完善的偏覆盖粗糙集约简理论体系，为模糊粗糙集的约简提供新的理论铺垫，并促进粗糙集理论在数据约简和特征提取等领域的应用。

中文关键词： 粗糙集；粒计算；偏覆盖；属性约简；数据挖掘

英文摘要： Widely applied to natural sciences and social sciences, rough set theory ，a tool of data mining,enjoys its unique advantages in various areas. As important developments of Pawlak's rough sets, covering generalized rough sets and binary relation generalized rough sets are getting more attention recently. Current researches regarding rough sets mainly focus on two aspects: generalizations of rough sets, design of its reduction algorithm. Between them, the reduction of rough sets is no doubt the most important, special, and widely applied theory. Compared with various generalized approximate operators, the research on attribute reduction theory is far from being developed. Partial covering(which is also called neighberhood system) is a generalization shared by covering and binary relation. This program will study the reduction theory of partial covering rough sets which includes two respects. (1)To classify several generalized rough set models by the reduction algorithm to aviod repitition of study on one type.(2)To find necessary and sufficient conditions of attribute reduction and relative attribute reduction of several covering rough set models respectively. Moreover, attribute reduction algorithms and relative attribute reduction algorithms will be designed based on related family method. As a result, high pe

英文关键词： Rough Sets；Granular Computing；Partial Covering；Attribute Reduction；Data Mining