Skip to main content

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


Mao (Soft Computing 21(24):7293–7311, 2017) claims to make contributions to the study of reduction in attributes in concept lattices by using graph theory. Some of her results could affect development of formal concept analysis; in particular, her three new algorithms for formal concept enumeration promise a lesser time complexity. Unfortunately, as we show, all the three algorithms are incorrect.

This is a preview of subscription content, access via your institution.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5


Download references


The work was supported by Grant No. 15-17899S, “Decompositions of Matrices with Boolean and Ordinal Data: Theory and Algorithms”, of the Czech Science Foundation.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Jan Konecny.

Ethics declarations

Conflict of interest

The author declares that he has no conflict of interest.

Ethical approval

This article does not contain any studies with human participants or animals performed by the author.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Communicated by A. Di Nola.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Konecny, J. Note on representing attribute reduction and concepts in concept lattice using graphs. Soft Comput 23, 10617–10621 (2019).

Download citation

  • Published:

  • Issue Date:

  • DOI:


  • Clarification
  • Reduction
  • Formal context
  • Graph
  • Formal concept enumeration