scholarly journals A Note on Computing the Crisp Order Context of a Fuzzy Formal Context for Knowledge Reduction

2014 ◽  
Vol 1014 ◽  
pp. 480-483
Author(s):  
Zhi Hao Peng ◽  
Wei Luo ◽  
An Sheng Deng

Knowledge reduction is one of the basic contents in rough set theory and the most challenging problem in knowledge acquisition. In this paper, an algorithm is proposed, which aims to get all the reducts based on the attributes of the formal context. Experiments show that the algorithm is sound and accurate. Finally, further work and future perspectives are discussed.


2011 ◽  
Vol 219-220 ◽  
pp. 604-607 ◽  
Author(s):  
Xu Yang Wang

Formal concept analysis and rough set theory provide two different methods for data analysis and knowledge processing. Knowledge reduct in this paper combines the two models. For an initial data sets described by formal context, look for absolute necessary attribute sets by applying rough set theory. The sets can image the concepts and hiberarchy structure completely. Then calculate the value cores of attributes values for all objects and delete redundant attributes. At last, delete repeated instances and get the minimum formal context. Construct the concept lattice of the minimum formal context can diminish the size of concept lattice of the initial table at a certain extent.


2020 ◽  
Vol 524 ◽  
pp. 165-183 ◽  
Author(s):  
Li Zou ◽  
Kuo Pang ◽  
Xiaoying Song ◽  
Ning Kang ◽  
Xin Liu

2021 ◽  
Vol 179 (3) ◽  
pp. 295-319
Author(s):  
Longchun Wang ◽  
Lankun Guo ◽  
Qingguo Li

Formal Concept Analysis (FCA) has been proven to be an effective method of restructuring complete lattices and various algebraic domains. In this paper, the notion of contractive mappings over formal contexts is proposed, which can be viewed as a generalization of interior operators on sets into the framework of FCA. Then, by considering subset-selections consistent with contractive mappings, the notions of attribute continuous formal contexts and continuous concepts are introduced. It is shown that the set of continuous concepts of an attribute continuous formal context forms a continuous domain, and every continuous domain can be restructured in this way. Moreover, the notion of F-morphisms is identified to produce a category equivalent to that of continuous domains with Scott continuous functions. The paper also investigates the representations of various subclasses of continuous domains including algebraic domains and stably continuous semilattices.


2005 ◽  
Vol 174 (3-4) ◽  
pp. 143-164 ◽  
Author(s):  
Wei-Zhi Wu ◽  
Mei Zhang ◽  
Huai-Zu Li ◽  
Ju-Sheng Mi

Sign in / Sign up

Export Citation Format

Share Document