Factorizing Boolean matrices using formal concepts and iterative usage of essential entries

DOI10.1016/j.ins.2019.03.001zbMath1448.68403OpenAlexW2921264971MaRDI QIDQ2212569

Martin Trnecka, Jan Outrata, Radim Bělohlávek

Publication date: 24 November 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2019.03.001

zbMATH Keywords

factorizationbinary relationfactor analysisconcept latticeBoolean matricesformal concept

Mathematics Subject Classification ID

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

Related Items (4)

Formal Methods in FCA and Big Data ⋮ Heterogeneous formal context and its decomposition by heterogeneous fuzzy subsets ⋮ Mixed Integer Programming for Searching Maximum Quasi-Bicliques ⋮ A comparative study of decision implication, concept rule and granular rule

Uses Software

• UCI-ml

Cites Work

• Discovery of optimal factors in binary data via a novel method of matrix decomposition
• Summarizing transactional databases with overlapped hyperrectangles
• From-below approximations in Boolean matrix factorization: geometry and new algorithm
• A mathematical analysis of human leukocyte antigen serology
• Comparing apples and oranges: measuring differences between exploratory data mining results
• Impact of Boolean factorization as preprocessing methods for classification of Boolean data
• Ordinal Factor Analysis
• Discovery Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Factorizing Boolean matrices using formal concepts and iterative usage of essential entries