Abstract
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, log in via an institution to check access.
Similar content being viewed by others
References
Ganter B, Wille R (1999) Formal concept analysis—mathematical foundations. Springer, Berlin
Mao H (2017) Representing attribute reduction and concepts in concept lattice using graphs. Soft Comput 21(24):7293–7311. https://doi.org/10.1007/s00500-016-2441-2
Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 11(5):341–356
Zhang W, Wei L, Qi J (2005) Attribute reduction theory and approach to concept lattice. Sci China Ser F-Inf Sci 48(6):713. https://doi.org/10.1360/122004-104
Acknowledgements
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
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
Communicated by A. Di Nola.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Konecny, J. Note on representing attribute reduction and concepts in concept lattice using graphs. Soft Comput 23, 10617–10621 (2019). https://doi.org/10.1007/s00500-019-03904-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-019-03904-9