Semantic explorations in factorizing Boolean data via formal concepts

DOI10.1016/J.IJAR.2024.109247MaRDI QIDQ6596701zbMATH OpenFDO

Authors Radim Belohlavek, Martin Trnecka

Publication date 2 September 2024

Published in International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.IJAR.2024.109247

zbMATH Keywords

Boolean matrix factorizationformal concepthuman concept

Mathematics Subject Classification ID

Factorization of matrices (15A23) Boolean and Hadamard matrices (15B34) Computational aspects of data analysis and big data (68T09) Knowledge representation (68T30)

Recommendations

• Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
• A Boolean computation approach of formal concepts
• Factorization with hierarchical classes analysis and with formal concept analysis
• Concept lattice factorization based 3D model retrieval of mechanical parts
• Applications of ordinal factor analysis

Cites work

• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Discovery Science
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• Handling noise in Boolean matrix factorization
• scientific article; zbMATH DE number 3771669 (Why is no real title available?)
• scientific article; zbMATH DE number 3779513 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• Toward quality assessment of Boolean matrix factorizations

Cited in

(2)

• Selected papers from the first international joint conference on conceptual knowledge structures
• Boolean matrix factorization in the framework of formal concept analysis with the help of biclustering

This page was built for publication: Semantic explorations in factorizing Boolean data via formal concepts

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