Constructing L-fuzzy concept lattices without fuzzy Galois closure operation
From MaRDI portal
Publication:1697983
DOI10.1016/J.FSS.2017.05.002zbMATH Open1380.68349OpenAlexW2613991066MaRDI QIDQ1697983FDOQ1697983
Authors: Zhuo Zhang 
Publication date: 21 February 2018
Published in: Fuzzy Sets and Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.fss.2017.05.002
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
- Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
- Title not available (Why is that?)
- Comparing performance of algorithms for generating concept lattices
- Fuzzy Galois Connections
- Title not available (Why is that?)
- Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
- A Generalized Concept Lattice
- Fuzzy closure operators
- Reduction and a simple proof of characterization of fuzzy concept lattices
- Formal concept analysis and linguistic hedges
- Knowledge reduction in real decision formal contexts
- Rough sets, fuzzy sets, data mining and granular computing. 13th international conference, RSFDGrC 2011, Moscow, Russia, June 25--27, 2011. Proceedings
- A partition-based approach towards constructing Galois (concept) lattices
- Concept lattices defined from implication operators
- FAST FACTORIZATION BY SIMILARITY OF FUZZY CONCEPT LATTICES WITH HEDGES
- Formal Concept Analysis
- Attribute dependencies for data with grades I,
- Bases of closure systems over residuated lattices
- Title not available (Why is that?)
- Knowledge reduction in crisply generated fuzzy concept lattices
- Algorithms for computation of concept trilattice of triadic fuzzy context
- A Linear Delay Algorithm for Building Concept Lattices
Cited In (4)
- An efficient method of renewing object-induced three-way concept lattices involving decreasing attribute-granularity levels
- Construction of the \(L\)-fuzzy concept lattice
- Describing hierarchy of concept lattice by using matrix
- Pruning based on batch construction of concept lattice whose intersection is null
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)
