Concept and attribute reduction based on rectangle theory of formal concept

DOI10.3934/MFC.2022016MaRDI QIDQ6167852zbMATH OpenOpenAlexFDO

Authors Jianqin Zhou, Sichun Yang, Xifeng Wang

Publication date 7 August 2023

Published in Mathematical Foundations of Computing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.00005

zbMATH Keywords

attribute reductionconcept latticeconcept reductionformal concept analysis

Mathematics Subject Classification ID

Knowledge representation (68T30)

Abstract: Based on rectangle theory of formal concept and set covering theory, the concept reduction preserving binary relations is investigated in this paper. It is known that there are three types of formal concepts: core concepts, relative necessary concepts and unnecessary concepts. First, we present the new judgment results for relative necessary concepts and unnecessary concepts. Second, we derive the bounds for both the maximum number of relative necessary concepts and the maximum number of unnecessary concepts and it is a difficult problem as either in concept reduction preserving binary relations or attribute reduction of decision formal contexts, the computation of formal contexts from formal concepts is a challenging problem. Third, based on rectangle theory of formal concept, a fast algorithm for reducing attributes while preserving the extensions for a set of formal concepts is proposed using the extension bit-array technique, which allows multiple context cells to be processed by a single 32-bit or 64-bit operator. Technically, the new algorithm could store both formal context and extent of a concept as bit-arrays, and we can use bit-operations to process set operations "or" as well as "and". One more merit is that the new algorithm does not need to consider other concepts in the concept lattice, thus the algorithm is explicit to understand and fast. Experiments demonstrate that the new algorithm is effective in the computation of attribute reductions.

Recommendations

• Attribute reduction theory of concept lattice based on decision formal contexts
• Formal concept attribute reduction model based on attribute classification relation
• Attribute reduction theory and approach to concept lattice
• Attribute reduction in rough set theory and formal concept analysis
• Attribute reduction theory of concept lattices based on strong decision formal contexts
• Attribute reduction of concept lattice based on irreducible elements
• The structure of an attribute reduction set of concept lattices
• Relating attribute reduction in formal, object-oriented and property-oriented concept lattices

Cites work

• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• Attribute reduction theory and approach to concept lattice
• Fuzzy sets
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• On computing the size of a lattice and related decision problems
• Rough sets
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• Three-way dual concept analysis
• Toward a theory of fuzzy information granulation and its centrality in human reasoning and fuzzy logic

Cited in

(1)

• Unified fast algorithms for building concept lattices

This page was built for publication: Concept and attribute reduction based on rectangle theory of formal concept

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6167852)