.png){kind=icon}
返回
Concept granular computing systems and their approximation operators
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-015-0457-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, three kinds of adjoint extent-intent and intent-extent operators between two complete lattices are constructed. Three new types of concept granular computing systems are then formulated via a quadruple including two complete lattices and the corresponding adjoint operators. It is showed that all the concepts in any of the concept granular computing systems form a complete lattice. Furthermore, based on the four types of concept granular computing systems, we present four types of rough set approximation operators in a formal context which can characterize different aspect of knowledge. Some important properties of the proposed approximation operators are also proved.
Keyword:
Concept lattices
Granular computing
Rough sets
Lower approximation
Upper approximation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.7
论文数:
3.2K
被引数:
5.6K
机构
引用论文
分享收藏
分享收藏Community-level exposomics: a population-centered approach to address public health concerns.png)
Exposome
OAAI
ExposomeIF0
OAAI分享收藏
查看更多内容