Fuzzy and rough formal concept analysis: a survey

DOI10.1080/03081079.2013.862377zbMath1286.93110OpenAlexW2046030110MaRDI QIDQ5411880

Jonas Poelmans, Sergei O. Kuznetsov, Guido Dedene, Dmitry I. Ignatov

Publication date: 25 April 2014

Published in: International Journal of General Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/03081079.2013.862377

zbMATH Keywords

rough setsinformation retrievaltext miningknowledge discovery in databasesexploratory data analysisfuzzy attributesformal concept analysis (FCA)systematic literature overview

Mathematics Subject Classification ID

Fuzzy control/observation systems (93C42) General systems (93A10) Applications of graph theory to circuits and networks (94C15)

Related Items (18)

Formal Concept Analysis and Extensions for Complex Data Analytics ⋮ A comprehensive survey on formal concept analysis, its research trends and applications ⋮ Triadic concept approximation ⋮ Mining for Unknown Unknowns ⋮ Graph-FCA meets pattern structures ⋮ A triadic generalisation of the Boolean concept lattice ⋮ On attribute reduction in concept lattices: experimental evaluation shows discernibility matrix based methods inefficient ⋮ L-concept lattices with positive and negative attributes: modeling uncertainty and reduction of size ⋮ Lattice logic as a fragment of (2-sorted) residuated modal logic ⋮ The joy of implications, aka pure Horn formulas: mainly a survey ⋮ Rough-set concept analysis: interpreting RS-definable concepts based on ideas from formal concept analysis ⋮ General framework for consistencies in decision contexts ⋮ L-concept analysis with positive and negative attributes ⋮ Contribution to attributive and object subcontexts in inferring good maximally redundant tests ⋮ On efficient factorization of standard fuzzy concept lattices and attribute-oriented fuzzy concept lattices ⋮ A theoretical study on the object (property) oriented concept lattices based on three-way decisions ⋮ Data meaning and knowledge discovery: semantical aspects of information systems ⋮ On attribute reduction in concept lattices: methods based on discernibility matrix are outperformed by basic clarification and reduction

Cites Work

• Unnamed Item
• Relating generalized concept lattices and concept lattices for non-commutative conjunctors
• Fuzzy inference based on fuzzy concept lattice
• Concept analysis via rough set and AFS algebra
• Concept lattices of fuzzy contexts: formal concept analysis vs. rough set theory
• Formal concept analysis via multi-adjoint concept lattices
• On very true
• The fuzzy theory based on AFS algebras and AFS structure
• Non-dual fuzzy connections
• A multi-level conceptual data reduction approach based on the Lukasiewicz implication
• Concept lattices and order in fuzzy logic
• Monotone concepts for formal concept analysis
• A note on variable threshold concept lattices: threshold-based operators are reducible to classical concept-forming operators
• Reduction method for concept lattices based on rough set theory and its application
• Set approximations in fuzzy formal concept analysis
• A framework for incremental generation of closed itemsets
• Fast factorization by similarity in formal concept analysis of data with fuzzy attributes
• Formal concept analysis and linguistic hedges
• Fuzzy attribute logic over complete residuated lattices
• CHARACTERIZING TREES IN CONCEPT LATTICES
• FAST FACTORIZATION BY SIMILARITY OF FUZZY CONCEPT LATTICES WITH HEDGES
• Approximations in Concept Lattices
• Rough sets
• Logical Precision in Concept Lattices
• Comparing performance of algorithms for generating concept lattices
• Similarity relations in concept lattices
• Fuzzy Galois Connections
• Fuzzy sets
• Fuzzy Closure Operators with Truth Stressers
• A Generalized Concept Lattice
• A Formal Concept Analysis Approach to Rough Data Tables
• Formal Concept Analysis
• Fuzzy closure operators

This page was built for publication: Fuzzy and rough formal concept analysis: a survey