Note on representing attribute reduction and concepts in concept lattice using graphs

DOI10.1007/S00500-019-03904-9MaRDI QIDQ780093zbMATH OpenOpenAlexFDO

Authors Jan Konecny

Publication date 15 July 2020

Published in Soft Computing (Search for Journal in Brave)

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

zbMATH Keywords

formal contextformal concept enumerationrelevant graph

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37) Knowledge representation (68T30)

Abstract: Mao H. (2017, Representing attribute reduction and concepts in concept lattice using graphs. Soft Computing 21(24):7293--7311) claims to make contributions to the study of reduction of attributes in concept lattices by using graph theory. We show that her results are either trivial or already well-known and all three algorithms proposed in the paper are incorrect.

Recommendations

• Note on the characterization and reduction of concept lattices through matroid theory
• Representing attribute reduction and concepts in concept lattice using graphs
• On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction
• Reduction-Based Approaches Towards Constructing Galois (Concept) Lattices
• Attribute reduction theory and approach to concept lattice

Cites work

• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• Attribute reduction theory and approach to concept lattice
• Representing attribute reduction and concepts in concept lattice using graphs
• Rough sets

Cited in

(1)

• Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts

This page was built for publication: Note on representing attribute reduction and concepts in concept lattice using graphs

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