From-below approximations in Boolean matrix factorization: geometry and new algorithm

DOI10.1016/j.jcss.2015.06.002zbMath1328.68295arXiv1306.4905OpenAlexW1497640967WikidataQ113643210 ScholiaQ113643210MaRDI QIDQ494072

Martin Trnecka, Radim Bělohlávek

Publication date: 31 August 2015

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmconcept latticematrix decompositionBoolean matrixclosure structures

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Knowledge representation (68T30) Approximation algorithms (68W25) Boolean and Hadamard matrices (15B34)

Related Items (13)

FCA2VEC: Embedding Techniques for Formal Concept Analysis ⋮ Handling noise in Boolean matrix factorization ⋮ A knowledge reduction approach for linguistic concept formal context ⋮ Toward quality assessment of Boolean matrix factorizations ⋮ On stability of fuzzy formal concepts over randomized one-sided formal context ⋮ Factorizing Boolean matrices using formal concepts and iterative usage of essential entries ⋮ Impact of Boolean factorization as preprocessing methods for classification of Boolean data ⋮ \textsc{QualityCover}: efficient binary relation coverage guided by induced knowledge quality ⋮ From-below Boolean matrix factorization algorithm based on MDL ⋮ A new algorithm for Boolean matrix factorization which admits overcovering ⋮ Factorization of matrices with grades via essential entries ⋮ Generalized inverses of Boolean tensors via the Einstein product ⋮ An incremental recomputation of from-below Boolean matrix factorization

Uses Software

• UCI-ml

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• A mathematical analysis of human leukocyte antigen serology
• Optimal factorization of three-way binary data using triadic concepts
• Ordinal Factor Analysis
• Comparing performance of algorithms for generating concept lattices
• Optimal decompositions of matrices with entries from residuated lattices
• Discovery Science
• Knowledge Discovery in Inductive Databases

This page was built for publication: From-below approximations in Boolean matrix factorization: geometry and new algorithm