.png){kind=icon}
Return
Approximation via a double-matroid structure
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-03749-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Approximation is an important issue in rough set theory. In this study, we consider approximation by the matroidal approach. First, we study three lattices induced by an information system. Two of the three lattices are selected as the macrostructure and microstructure for approximation, respectively. Second, based on the two lattices, we define double-matroid lattices, where the upper and lower approximations with respect to an information system are depicted. Since the two lattices are geometric, we actually present approximation by the matroidal approach. Finally, we study the connection between our double-matroid lattices and granular partition lattices. Specifically, the comparison of these two structures is presented in both micro-level and macro-level.
Keywords:
Approximation
Granular computing
Information systems
Rough sets
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.5
Papers:
1.0W
Citations:
2.1W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
View more