Topological Approaches to the First Type of Covering-Based Rough Sets

Bin Chen, Jinjin Li
{"title":"Topological Approaches to the First Type of Covering-Based Rough Sets","authors":"Bin Chen, Jinjin Li","doi":"10.1109/ISME.2010.46","DOIUrl":null,"url":null,"abstract":"Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the relationship between the relative closure and the first type of covering upper approximation. The major contributions of this paper are that we use the definition of the relative closure and the relative interior to discuss the conditions under which the relative operators satisfy certain classical properties. The theorems we get generalize some of the results in Zhu's paper.","PeriodicalId":348878,"journal":{"name":"2010 International Conference of Information Science and Management Engineering","volume":"368 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference of Information Science and Management Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISME.2010.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Rough sets, a tool for data mining, deal with the vagueness and granularity in information systems. This paper studies covering-based rough sets from the topological view. We explore the relationship between the relative closure and the first type of covering upper approximation. The major contributions of this paper are that we use the definition of the relative closure and the relative interior to discuss the conditions under which the relative operators satisfy certain classical properties. The theorems we get generalize some of the results in Zhu's paper.
第一类基于覆盖的粗糙集的拓扑方法
粗糙集是一种数据挖掘工具,用于处理信息系统中的模糊性和粒度问题。本文从拓扑学的角度研究了基于覆盖的粗糙集。我们探讨了相对闭包与第一类覆盖上近似之间的关系。本文的主要贡献是利用相对闭包和相对内部的定义讨论了相对算子满足某些经典性质的条件。我们得到的定理推广了朱论文中的一些结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信