| 注册
首页|期刊导航|计算机与现代化|覆盖粗糙集上下近似的对偶性分析

覆盖粗糙集上下近似的对偶性分析

陈文 刘绍清 郑若鹢 黄河清

计算机与现代化Issue(7):1-5,5.
计算机与现代化Issue(7):1-5,5.DOI:10.3969/j.issn.1006-2475.2012.07.001

覆盖粗糙集上下近似的对偶性分析

Duality Analysis of Approximation Operations in Covering-based Rough Sets

陈文 1刘绍清 1郑若鹢 1黄河清1

作者信息

  • 1. 福州职业技术学院计算机系,福建福州350108
  • 折叠

摘要

Abstract

Covering-based rough set theory is an extension of the classical rough set theory. In a variety of definitions of approximations operations, duality is always the focus of debate. This paper analyses duality of approximation operations through the definable properties of positive region, negative region and boundary region. With duality, this paper shows how to choose approximation operations for different applications. This paper also investigates the duality of approximation operations in reduct covering. Finally, the paper analyzes two pairs of approximation operations satisfying the duality in covering-based rough sets.

关键词

粗糙集/覆盖/对偶性/约简/上近似

Key words

rough sets/ covering/ duality/ reduct/ upper approximation

分类

信息技术与安全科学

引用本文复制引用

陈文,刘绍清,郑若鹢,黄河清..覆盖粗糙集上下近似的对偶性分析[J].计算机与现代化,2012,(7):1-5,5.

基金项目

福建省教育厅资助项目(JB11320) (JB11320)

计算机与现代化

OACSTPCD

1006-2475

访问量1
|
下载量0
段落导航相关论文