Size-optimal Boolean matrix factorization
From MaRDI portal
Cites work
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
- A mathematical analysis of human leukocyte antigen serology
- Approaches to the selection of relevant concepts in the case of noisy data
- Covering concept lattices with concept chains
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Discovery Science
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- Formal context coverage based on isolated labels: an efficient solution for text feature extraction
- From-below approximations in Boolean matrix factorization: geometry and new algorithm
- From-below Boolean matrix factorization algorithm based on MDL
- scientific article; zbMATH DE number 3771669 (Why is no real title available?)
- scientific article; zbMATH DE number 1416629 (Why is no real title available?)
- On interestingness measures of formal concepts
- On stability of a formal concept
- Parameterized low-rank binary matrix approximation
- Relations binaires, fermetures, correspondances de Galois
- Summarizing transactional databases with overlapped hyperrectangles
- Towards Concise Representation for Taxonomies of Epistemic Communities
This page was built for publication: Size-optimal Boolean matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6927992)