Parallelization of the GreConD algorithm for Boolean matrix factorization

DOI10.1007/978-3-030-21462-3_14MaRDI QIDQ2294558zbMATH OpenOpenAlexFDO

Authors Petr Krajca, Martin Trnecka

Publication date 11 February 2020

Full work available at URL https://doi.org/10.1007/978-3-030-21462-3_14

zbMATH Keywords

parallel algorithmformal concept analysisBoolean matrix factorizationGreConD

Mathematics Subject Classification ID

Knowledge representation (68T30)

Recommendations

• A new algorithm for Boolean matrix factorization which admits overcovering
• Toward quality assessment of Boolean matrix factorizations
• Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines

Cited in

(3)

• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• Independent set orderings for parallel matrix factorization by Gaussian elimination
• Boolean matrix factorization based on collaborative neurodynamic optimization with Boltzmann machines

This page was built for publication: Parallelization of the GreConD algorithm for Boolean matrix factorization

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