Effective greedy Boolean matrix factorization via the Rice-Siff algorithm

DOI10.1016/J.IJAR.2026.109747MaRDI QIDQ7308927zbMATH OpenFDO

Authors Lubomir Antoni, Dominika Kotlárová, Ondrej Krídlo, Domingo López-Rodríguez, Manuel Ojeda-Aciego

Publication date 4 August 2026

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

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

Mathematics Subject Classification ID

Factorization of matrices (15A23) Boolean and Hadamard matrices (15B34) Reasoning under uncertainty in the context of artificial intelligence (68T37) Approximation algorithms (68W25)

Cites work

• A Greedy Heuristic for the Set-Covering Problem
• A PTAS for ℓ_p-Low Rank Approximation
• Clusters, concepts, and pseudometrics
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• scientific article; zbMATH DE number 3779513 (Why is no real title available?)
• scientific article; zbMATH DE number 3781471 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• Parallelization of the GreConD algorithm for Boolean matrix factorization
• Parameterized low-rank binary matrix approximation
• Size-optimal Boolean matrix factorization
• Summarizing transactional databases with overlapped hyperrectangles

Cited in

(1)

• Selected papers from the third international joint conference on conceptual knowledge structures

This page was built for publication: Effective greedy Boolean matrix factorization via the Rice-Siff algorithm

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