Constructing L-fuzzy concept lattices without fuzzy Galois closure operation

DOI10.1016/j.fss.2017.05.002zbMath1380.68349OpenAlexW2613991066MaRDI QIDQ1697983

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

zbMATH Keywords

algorithmfuzzy setequivalence classset operationL-fuzzy concept lattice

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Knowledge representation (68T30)

Related Items (1)

Describing hierarchy of concept lattice by using matrix

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Bases of closure systems over residuated lattices
• Concept lattices defined from implication operators
• A partition-based approach towards constructing Galois (concept) lattices
• Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
• Knowledge Reduction in Crisply Generated Fuzzy Concept Lattices
• Formal concept analysis and linguistic hedges
• Attribute dependencies for data with grades I^,
• Algorithms for Computation of Concept Trilattice of Triadic Fuzzy Context
• A Linear Delay Algorithm for Building Concept Lattices
• FAST FACTORIZATION BY SIMILARITY OF FUZZY CONCEPT LATTICES WITH HEDGES
• Comparing performance of algorithms for generating concept lattices
• Fuzzy Galois Connections
• Direct Factorization by Similarity of Fuzzy Concept Lattices by Factorization of Input Data
• Formal Concept Analysis
• A Generalized Concept Lattice
• Fuzzy closure operators

This page was built for publication: Constructing L-fuzzy concept lattices without fuzzy Galois closure operation