An Incremental Recomputation of From-Below Boolean Matrix Factorization
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F21%3A73607835" target="_blank" >RIV/61989592:15310/21:73607835 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-77867-5_8" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-77867-5_8</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-77867-5_8" target="_blank" >10.1007/978-3-030-77867-5_8</a>
Alternative languages
Result language
angličtina
Original language name
An Incremental Recomputation of From-Below Boolean Matrix Factorization
Original language description
The Boolean matrix factorization (BMF) is a well-established and widely used tool for preprocessing and analyzing Boolean (binary, yes-no) data. In many situations, the set of factors is already computed, but some changes in the data occur after the computation, e.g., new entries to the input data are added. Recompute the factors from scratch after each small change in the data is inefficient. In the paper, we propose an incremental algorithm for (from-below) BMF which adjusts the already computed factorization according to the changes in the data. Moreover, we provide a comparison of the incremental and non-incremental algorithm on real-world data.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Formal Concept Analysis
ISBN
978-3-030-77866-8
ISSN
0302-9743
e-ISSN
—
Number of pages
13
Pages from-to
125-137
Publisher name
Springer
Place of publication
Cham
Event location
Strasbourg, Francie
Event date
Jun 29, 2021
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—