Note on Representing attribute reduction and concepts in concepts lattice using graphs
Jan Konecny

TL;DR
This paper critically examines Mao's 2017 work on representing attribute reduction in concept lattices with graphs, finding that her results are trivial or known and her algorithms are incorrect.
Contribution
The paper provides a critical analysis showing Mao's results are trivial or previously known and her algorithms are flawed.
Findings
Mao's results are trivial or well-known.
All three algorithms proposed are incorrect.
The paper clarifies misconceptions in the field.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRough Sets and Fuzzy Logic · Advanced Algebra and Logic · Fuzzy Logic and Control Systems
