.png){kind=icon}
.png){kind=icon}
Return
Concept granular computing systems and their approximation operators
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-015-0457-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
Concept lattices
Granular computing
Rough sets
Lower approximation
Upper approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K