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

11/15/2017
by   Jan Konecny, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/29/2021

Concept and Attribute Reduction Based on Rectangle Theory of Formal Concept

Based on rectangle theory of formal concept and set covering theory, the...
research
12/16/2013

Geometric lattice structure of covering and its application to attribute reduction through matroids

The reduction of covering decision systems is an important problem in da...
research
03/06/2019

Incremental Computation of Concept Diagrams

Suppose a formal context K=(G,M,I) is given, whose concept lattice B(K) ...
research
02/12/2018

Introducer Concepts in n-Dimensional Contexts

Concept lattices are well-known conceptual structures that organise inte...
research
07/04/2021

Attribute reduction and rule acquisition of formal decision context based on two new kinds of decision rules

This paper mainly studies the rule acquisition and attribute reduction f...
research
01/15/2012

Tacit knowledge mining algorithm based on linguistic truth-valued concept lattice

This paper is the continuation of our research work about linguistic tru...
research
12/20/2019

Next Priority Concept: A new and generic algorithm computing concepts from complex and heterogeneous data

In this article, we present a new data type agnostic algorithm calculati...

Please sign up or login with your details

Forgot password? Click here to reset