A new algorithm for Boolean matrix factorization which admits overcovering

DOI10.1016/j.dam.2017.12.044zbMath1398.68509OpenAlexW2886339163WikidataQ129367834 ScholiaQ129367834MaRDI QIDQ1800383

Martin Trnecka, Radim Bělohlávek

Publication date: 23 October 2018

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

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

zbMATH Keywords

algorithmsformal concept analysisBoolean matrix factorization

Mathematics Subject Classification ID

Factorization of matrices (15A23) Knowledge representation (68T30) Boolean and Hadamard matrices (15B34)

Related Items

Unnamed Item, An incremental recomputation of from-below Boolean matrix factorization

Uses Software

• UCI-ml
• BMDP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Summarizing transactional databases with overlapped hyperrectangles
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• A mathematical analysis of human leukocyte antigen serology
• Attribute dependencies for data with grades I^,
• Comparing performance of algorithms for generating concept lattices
• Optimal decompositions of matrices with entries from residuated lattices
• Discovery Science