.png){kind=icon}
.png){kind=icon}
Return
0-1 linear integer programming method for granule knowledge reduction and attribute reduction in concept lattices
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-018-3352-1.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Knowledge reduction is one of the key issues in formal concept analysis, and there have been many studies on this topic. Granule knowledge reduction and attribute reduction are two of the most important knowledge reduction in formal concept analysis. Firstly, theorem to character granule knowledge reduction is given, and granule knowledge reduction method in concept lattices based on 0-1 linear integer programming is proposed in this paper. Then, characterization theorems of three types attributes are obtained in attribute reduction, and attribute reduction method in concept lattices based on 0-1 linear integer programming is proposed.
Keywords:
Concept lattice
Granule knowledge reduction
Attribute reduction
0-1 linear integer programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.