From-below Boolean matrix factorization algorithm based on MDL

DOI10.1007/S11634-019-00383-6MaRDI QIDQ2036139zbMATH OpenOpenAlexFDO

Authors Tatiana Makhalova, Martin Trnecka

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

formal concept analysisminimum description lengthBoolean matrix factorizationfactorization quality

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3779513 (Why is no real title available?)
• scientific article; zbMATH DE number 1249514 (Why is no real title available?)
• scientific article; zbMATH DE number 790476 (Why is no real title available?)
• A mathematical analysis of human leukocyte antigen serology
• Block clustering with Bernoulli mixture models: comparison of different approaches
• Boolean factors as a means of clustering of interestingness measures of association rules
• Co-clustering through latent block model: a review
• Discovery Science
• 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
• Summarizing transactional databases with overlapped hyperrectangles
• Toward quality assessment of Boolean matrix factorizations

Cited in

(3)

• Mint: MDL-based approach for mining interesting numerical pattern sets
• The minimum description length principle for pattern mining: a survey
• From-below approximations in Boolean matrix factorization: geometry and new algorithm

Describes a project that uses

Uses Software

• MDL4BMF
• blockcluster
• UCI

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

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