From-below Boolean matrix factorization algorithm based on MDL

DOI10.1007/s11634-019-00383-6OpenAlexW3000187205MaRDI QIDQ2036139

Martin Trnecka, Tatiana Makhalova

Publication date: 28 June 2021

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.09567

zbMATH Keywords

minimum description lengthformal concept analysisBoolean matrix factorizationfactorization quality

Mathematics Subject Classification ID

Total orders (06A05) Boolean algebras with additional operations (diagonalizable algebras, etc.) (06E25)

Related Items (2)

Mint: MDL-based approach for mining interesting numerical pattern sets ⋮ The minimum description length principle for pattern mining: a survey

Uses Software

• UCI-ml
• blockcluster
• MDL4BMF

Cites Work

• 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
• Block clustering with Bernoulli mixture models: comparison of different approaches
• A mathematical analysis of human leukocyte antigen serology
• Toward quality assessment of Boolean matrix factorizations
• Boolean factors as a means of clustering of interestingness measures of association rules
• Discovery Science

This page was built for publication: From-below Boolean matrix factorization algorithm based on MDL