scholarly journals Knowledge structure preserving fuzzy attribute reduction in fuzzy formal context

2019 ◽  
Vol 115 ◽  
pp. 209-220 ◽  
Author(s):  
Yanhui Zhai ◽  
Deyu Li
Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 689
Author(s):  
Won Keun Min

We introduce the notion of the reduct of soft contexts, which is a special notion of a consistent set for soft contexts. Then, we study its properties and show that this notion is well explained by the two classes, 1 0 and 2 0 , of independent attributes. In particular, we describe in detail how to extract a reduct from a given consistent set. Then, based on this extraction process, we propose a six-step method for constructing a reduct from a given consistent set. Additionally, to apply this method to formal contexts, we examine the relationship between the reducts of a given formal context and the reducts of the associated soft context. We finally illustrate the process of obtaining reducts in a formal context using this relationship and the six-step method using an example.


2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Qing Wan ◽  
Ling Wei

This paper mainly studies attribute reduction which keeps the lattice structure in formal contexts based on the property pictorial diagram. Firstly, the property pictorial diagram of a formal context is defined. Based on such diagram, an attribute reduction approach of concept lattice is achieved. Then, through the relation between an original formal context and its complementary context, an attribute reduct of complementary context concept lattice is obtained, which is also based on the property pictorial diagram of the original formal context. Finally, attribute reducts in property oriented concept lattice and object oriented concept lattice can be acquired by the relations of attribute reduction between these two lattices and concept lattice of complementary context. In addition, a detailed illustrative example is presented.


Author(s):  
Masahiro Inuiguchi ◽  

In this paper, structure-enhancing approaches to attribute reduction are proposed. Ten kinds of meaningful reducts are defined. The relations among them are clarified. Moreover their relations to reducts by structure-preserving approaches are also investigated. A few computational approaches to the proposed reducts are briefly described.


Entropy ◽  
2019 ◽  
Vol 21 (3) ◽  
pp. 262
Author(s):  
Binbin Sang ◽  
Binghan Long ◽  
Jinzhong Pang ◽  
Weihua Xu

Concept lattice has been successfully applied to various fields as an effective tool for data analysis and knowledge discovery, with attribute reduction being the key problem. This paper combines the intuitionistic fuzzy theory with the concept lattice theory and proposes one kind of concept lattice in intuitionistic fuzzy generalized consistent decision formal context. Furthermore, an approach to attribute a reduction in the discernibility matrix is proposed and investigated, making the discovery of implicit knowledge easier and the representation simpler in the data system and perfecting the theory of concept lattice. Moreover, this paper studies, in detail, the algorithms and case study of data analysis in the intuitionistic fuzzy generalized consistent decision formal context. The potential value of the method to deal with information discussed in this paper, especially the value of forecasting and decision-making, is expected in future.


Author(s):  
TONG-JUN LI ◽  
MING-ZHI LI ◽  
YU GAO

Attribute reduction of formal context is a crucial reseach issue in formal concept analysis. In this paper, based on the meet-irreducible elements and join-irreducible elements of concept lattice, two kinds of attribute reductions of formal context are proposed, which are called MI-attribute reduction and JI-attribute reduction. Subsequently, we discuss the relationships among them and two existing attribute reductions of formal context, lattice-based attribute reduction and granular reduction. Consequently, we find that the MI-attribute reduction and lattice-based attribute reduction are identical. For JI-attribute reduction, the judgement theorems of JI-consistent attribute sets are obtained. Finally, by using the discernibility attribute sets, a method of computing all JI-attribute reducts of a formal context is presented.


Sign in / Sign up

Export Citation Format

Share Document