Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
From MaRDI portal
Publication:1697983
Recommendations
- Construction of the \(L\)-fuzzy concept lattice
- Representation of fuzzy concept lattices in the framework of classical FCA
- The construction of fuzzy concept lattices based on \((\theta , \sigma )\)-fuzzy rough approximation operators
- Fuzzy Concept Lattices with Incomplete Knowledge
- scientific article; zbMATH DE number 803801
Cites work
- scientific article; zbMATH DE number 1249514 (Why is no real title available?)
- scientific article; zbMATH DE number 1827093 (Why is no real title available?)
- scientific article; zbMATH DE number 2199279 (Why is no real title available?)
- A Generalized Concept Lattice
- A Linear Delay Algorithm for Building Concept Lattices
- A partition-based approach towards constructing Galois (concept) lattices
- Algorithms for computation of concept trilattice of triadic fuzzy context
- Attribute dependencies for data with grades I,
- Bases of closure systems over residuated lattices
- Comparing performance of algorithms for generating concept lattices
- Concept lattices defined from implication operators
- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
- FAST FACTORIZATION BY SIMILARITY OF FUZZY CONCEPT LATTICES WITH HEDGES
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
- Formal Concept Analysis
- Formal concept analysis and linguistic hedges
- Fuzzy Galois Connections
- Fuzzy closure operators
- Knowledge reduction in crisply generated fuzzy concept lattices
- Knowledge reduction in real decision formal contexts
- Reduction and a simple proof of characterization of fuzzy concept lattices
- Rough sets, fuzzy sets, data mining and granular computing. 13th international conference, RSFDGrC 2011, Moscow, Russia, June 25--27, 2011. Proceedings
Cited in
(4)- Describing hierarchy of concept lattice by using matrix
- An efficient method of renewing object-induced three-way concept lattices involving decreasing attribute-granularity levels
- Pruning based on batch construction of concept lattice whose intersection is null
- Construction of the \(L\)-fuzzy concept lattice
This page was built for publication: Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1697983)