This paper first puts forward the close-degree of information concept lattice, define the significance of attribute and design a heuristic algorithm for ...

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 ...

Attribute reduction in concept lattices seeks to discover minimal sets of attributes such that the input formal context restricted to these sets of attributes ...

Jun 14, 2021 · Reducing the size of formal context may result in removing uninterested and erroneous pairs, taking less time to extract the concept lattice.

Yuejin Lv, Hongmei Liu, Jinhai Li : Attribute Reduction of Formal Context Based on Concept Lattice. FSKD (1) 2009: 576-580. manage site settings.

Based on the discernibility matrix and Boolean function, a method to attribute reduction is proposed while preserving the extensions in concept lattices [19,20] ...

Sep 6, 2020 · We propose four kinds of attribute reduction of SE-ISI concept lattices based on different criteria. Then, we discuss the relationships among the four kinds of ...

Concept lattice theory is a powerful tool for analyzing and extracting information from data sets. Rule acquisition and attribute reduction are hot research ...

Attribute reduction in concept lattices seeks to discover minimal sets (called reducts) of attributes such that the input formal context restricted to these ...

Oct 29, 2021 · Based on rectangle theory of formal concept, a fast algorithm for reducing attributes while preserving the extensions for a set of formal concepts is proposed.