Reinventing known results in FCA: notes on two recently published algorithms for computation of formal concepts

DOI10.1016/j.dam.2019.01.017zbMath1430.68333OpenAlexW2912078068WikidataQ128418478 ScholiaQ128418478MaRDI QIDQ2286395

Jan Konecny

Publication date: 22 January 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.017

zbMATH Keywords

algorithmformal concept analysisGalois connectionsenumeration of concepts

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data
• A `best-of-breed' approach for designing a fast algorithm for computing fixpoints of Galois connections
• Concept learning via granular computing: a cognitive viewpoint
• The use of two relations in \( L\)-fuzzy contexts
• Triangle algebras: A formal logic approach to interval-valued residuated lattices
• Fuzzy graph representation of a fuzzy concept lattice
• Metamathematics of fuzzy logic
• A fast algorithm for building lattices
• L-concept analysis with positive and negative attributes
• Three-way cognitive concept learning via multi-granularity
• Incomplete decision contexts: approximate concept construction, rule acquisition and knowledge reduction
• A constructive method for the definition of interval-valued fuzzy implication operators
• Interval-Valued Fuzzy Galois Connections: Algebraic Requirements and Concept Lattice Construction
• Lindig’s Algorithm for Concept Lattices over Graded Attributes
• Interval-Valued Fuzzy Formal Concept Analysis
• Comparing performance of algorithms for generating concept lattices
• Formal Concept Analysis from the Standpoint of Possibility Theory
• Residuated Lattices
• Galois Connexions
• Formal Concept Analysis
• The study of the interval-valued contexts