Computing minimal sets of descriptive conditions for binary data

DOI10.1080/03081079.2014.885166zbMath1310.68059OpenAlexW2183422881MaRDI QIDQ5166463

Radim Bělohlávek, Vilem Vychodil

Publication date: 27 June 2014

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

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

zbMATH Keywords

closure operatormatrix decompositionbinary datatriangular product

Mathematics Subject Classification ID

Approximation algorithms (68W25) General topics in the theory of data (68P01)

Related Items (2)

Variety theorem for algebras with fuzzy orders ⋮ Monoidal functional dependencies

Cites Work

• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Isotone fuzzy Galois connections with hedges
• The role of bK-products of relations in soft computing
• Optimal triangular decompositions of matrices with entries from residuated lattices
• Formal concept analysis and linguistic hedges
• Triadic concept lattices of data with graded attributes
• Semantics of implication operators and fuzzy relational products
• Fuzzy relational equations in general framework
• Constraint Databases

This page was built for publication: Computing minimal sets of descriptive conditions for binary data