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

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73595299" target="_blank" >RIV/61989592:15310/19:73595299 - isvavai.cz</a>
Result on the web
<a href="https://www.sciencedirect.com/science/article/pii/S0020025519301902" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025519301902</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.ins.2019.03.001" target="_blank" >10.1016/j.ins.2019.03.001</a>

Result language
angličtina
Original language name
Factorizing Boolean matrices using formal concepts and iterative usage of essential entries
Original language description
We present a new algorithm for factorization of Boolean matrices (binary relations), i.e. for extraction of factors from relational data, which is based on a new insight into the geometry of factorizations. The algorithm exploits in an iterative manner so-called essential entries in relational data and outperforms, sometimes significantly, the available algorithms for exact and almost exact factorizations of relational data. We describe the rationale for the new approach, present our algorithm, provide its experimental evaluation, and present open problems.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)