Computing minimal sets of descriptive conditions for binary data

DOI10.1080/03081079.2014.885166zbMATH Open1310.68059OpenAlexW2183422881MaRDI QIDQ5166463FDOQ5166463

Authors: Radim Belohlavek, 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

Recommendations

• Finding essential attributes from binary data
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Factorizing three-way binary data
• Optimal decompositions of matrices with grades into binary and graded matrices
• Optimal factorization of three-way binary data using triadic concepts

zbMATH Keywords

binary datamatrix decompositionclosure operatortriangular product

Mathematics Subject Classification ID

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

Cites Work

• Introduction to algorithms
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• 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
• Isotone fuzzy Galois connections with hedges
• Optimal triangular decompositions of matrices with entries from residuated lattices
• The role of bK-products of relations in soft computing
• Constraint Databases

Cited In (5)

• Title not available (Why is that?)
• Monoidal functional dependencies
• Discovering all associations in discrete data using frequent minimally infrequent attribute sets
• Variety theorem for algebras with fuzzy orders
• Finding essential attributes from binary data

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5166463)