Closure-based constraints in formal concept analysis

DOI10.1016/j.dam.2013.02.029zbMath1312.68180OpenAlexW2059673957MaRDI QIDQ2446833

Vilem Vychodil, Radim Bělohlávek

Publication date: 22 April 2014

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

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

zbMATH Keywords

algorithmsbinary relationformal concept analysisbackground knowledgeattribute implicationclosure structure

Mathematics Subject Classification ID

Knowledge representation (68T30) Galois correspondences, closure operators (in relation to ordered sets) (06A15)

Related Items (7)

Formal Methods in FCA and Big Data ⋮ Rules acquisition of formal decision contexts based on three-way concept lattices ⋮ LinCbO: fast algorithm for computation of the Duquenne-Guigues basis ⋮ Pruning techniques in lincbo for the computation of the duquenne-guigues basis ⋮ Formal Concept Analysis with Constraints by EM Operators ⋮ On biconcepts in formal fuzzy concept analysis ⋮ A methodology for analysis of concept lattice reduction

Cites Work

• On generating all maximal independent sets
• Attribute exploration with background knowledge
• Association rule mining. Models and algorithms
• Pseudo-models and propositional Horn inference
• Comparing performance of algorithms for generating concept lattices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Closure-based constraints in formal concept analysis