Revisiting the GreCon algorithm for 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%2F22%3A73613690" target="_blank" >RIV/61989592:15310/22:73613690 - isvavai.cz</a>
Result on the web
<a href="https://obd.upol.cz/id_publ/333193577" target="_blank" >https://obd.upol.cz/id_publ/333193577</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.knosys.2022.108895" target="_blank" >10.1016/j.knosys.2022.108895</a>
Alternative languages
Result language
angličtina
Original language name
Revisiting the GreCon algorithm for Boolean matrix factorization
Original language description
Over the past decade, the most fundamental Boolean matrix factorization (BMF) algorithms GreCon and GreConD were proposed. Whereas GreConD has become a popular and widely used BMF algorithm, GreCon - the algorithm on which the GreConD is built - is somewhat forgotten in contemporary BMF research; however, GreCon may produce better results than GreConD. The main disadvantage of GreCon algorithm is a slow running time. In the paper, we argue that the search strategy of GreConD, notwithstanding it provides a good result, is limited. We show that the reasons for not using GreCon algorithm are no longer the truth. We revise the algorithm and propose a new approach to storing and updating data required for factor enumeration. By various experiments, we demonstrate that the revised version is competitive with contemporary BMF algorithms in terms of running time. Moreover, in some cases, the revised GreCon outperforms GreConD-one of the fastest BMF algorithms. Furthermore, we show that our novel approach to GreCon enables the utilization of novel approaches to BMF.
Czech name
—
Czech description
—
Classification
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)
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2022
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
Name of the periodical
KNOWLEDGE-BASED SYSTEMS
ISSN
0950-7051
e-ISSN
1872-7409
Volume of the periodical
249
Issue of the periodical within the volume
AUG
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
15
Pages from-to
"108895-1"-"108895-15"
UT code for WoS article
000806812900011
EID of the result in the Scopus database
2-s2.0-85130314264