Type-irr Attribute Reduction in Decision Formal Concept
Mei-Zheng Li
Abstract
Mei-Zheng Li
Abstract
Attribute reduction in concept lattices is one of the key problems in the study of concept lattice theory. This paper defines a irr-consistent set and provides an approach to attribute reduction in concept lattices of a consistent decision formal context and an inconsistent decision formal context based on irreducible element. After the reduction of a formal context, the computation of concept lattices becomes more simple and convenient.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Attribute reduction in concept lattices is one of the key problems in the study of concept lattice theory. This paper defines a irr-consistent set and provides an approach to attribute reduction in concept lattices of a consistent decision formal context and an inconsistent decision formal context based on irreducible element. After the reduction of a formal context, the computation of concept lattices becomes more simple and convenient.
Key concepts: Lattice Miner, Computer science, Formal concept analysis, Reduction (mathematics), Attribute domain, Context (archaeology), Rough set, Computation