From-below approximations in Boolean matrix factorization: geometry and new algorithm
From MaRDI portal
Abstract: We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously proposed algorithms do not consider the possibly different significance of different matrix entries, our results help measure such significance and suggest where to focus when computing factors. An experimental evaluation of the new algorithm on both synthetic and real data demonstrates its good performance in terms of good coverage by the first k factors as well as a small number of factors needed for exact decomposition and indicates that the algorithm outperforms the available ones in these terms. We also propose future research topics.
Recommendations
- An incremental recomputation of from-below Boolean matrix factorization
- From-below Boolean matrix factorization algorithm based on MDL
- A new algorithm for Boolean matrix factorization which admits overcovering
- Toward quality assessment of Boolean matrix factorizations
- Lower bounds for matrix factorization
- Lower bounds for matrix factorization
- scientific article; zbMATH DE number 1979525
- Parallelization of the GreConD algorithm for Boolean matrix factorization
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 1748069 (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
- Combinatorial matrix theory
- Comparing performance of algorithms for generating concept lattices
- Discovery Science
- Discovery of optimal factors in binary data via a novel method of matrix decomposition
- Knowledge Discovery in Inductive Databases
- Optimal decompositions of matrices with entries from residuated lattices
- Optimal factorization of three-way binary data using triadic concepts
- Ordinal factor analysis
- Relational mathematics
- Summarizing transactional databases with overlapped hyperrectangles
Cited in
(18)- An incremental recomputation of from-below Boolean matrix factorization
- On stability of fuzzy formal concepts over randomized one-sided formal context
- A knowledge reduction approach for linguistic concept formal context
- From-below Boolean matrix factorization algorithm based on MDL
- Factorizing formal contexts from closures of necessity operators
- Binary matrix factorization and completion via integer programming
- Generalized inverses of Boolean tensors via the Einstein product
- A new algorithm for Boolean matrix factorization which admits overcovering
- Semantic explorations in factorizing Boolean data via formal concepts
- Impact of Boolean factorization as preprocessing methods for classification of Boolean data
- A clustering approach to constrained binary matrix factorization
- Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines
- Toward quality assessment of Boolean matrix factorizations
- Factorization of matrices with grades via essential entries
- \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality
- Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
- Handling noise in Boolean matrix factorization
- FCA2VEC: Embedding Techniques for Formal Concept Analysis
This page was built for publication: From-below approximations in Boolean matrix factorization: geometry and new algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494072)
