An incremental recomputation of from-below Boolean matrix factorization

DOI10.1007/978-3-030-77867-5_8OpenAlexW3175103050MaRDI QIDQ2117125

Marketa Trneckova, Martin Trnecka

Publication date: 21 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-77867-5_8

zbMATH Keywords

incremental algorithmBoolean matrix factorization

Mathematics Subject Classification ID

Knowledge representation (68T30)

Uses Software

• UCI-ml

Cites Work

• 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
• A new algorithm for Boolean matrix factorization which admits overcovering
• Boolean factors as a means of clustering of interestingness measures of association rules
• Discovery Science

This page was built for publication: An incremental recomputation of from-below Boolean matrix factorization