Handling noise in Boolean matrix factorization

DOI10.1016/j.ijar.2018.03.006zbMath1444.68166OpenAlexW2741031216MaRDI QIDQ1644808

Martin Trnecka, Radim Bělohlávek

Publication date: 22 June 2018

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

Full work available at URL: https://doi.org/10.1016/j.ijar.2018.03.006

zbMATH Keywords

algorithmsBoolean matrix factorizationnoise in Boolean data

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Factorization of matrices (15A23) Boolean and Hadamard matrices (15B34) Computational aspects of data analysis and big data (68T09)

Uses Software

• BMDP
• MDL4BMF

Cites Work

• 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
• Comparing apples and oranges: measuring differences between exploratory data mining results
• Discovery Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Handling noise in Boolean matrix factorization