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%2F20%3A73601632" target="_blank" >RIV/61989592:15310/20:73601632 - isvavai.cz</a>
Result on the web
<a href="http://ceur-ws.org/Vol-2668/paper4.pdf" target="_blank" >http://ceur-ws.org/Vol-2668/paper4.pdf</a>
DOI - Digital Object Identifier
—
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 two most fundamental Boolean matrix factorization (BMF) algorithms, GreCon and GreConD, were proposed. Whereas GreConD has become one of the most popular algorithms, GreCon-an algorithm on which the GreConD was build-is somewhat forgotten. Although GreCon may produce better results than GreConD, computing BMF via this algorithm is time consuming. We show that the reasons for not using GreCon algorithm are no longer truth. We revise the algorithm and on various experiments we demonstrate that the revised version is competitive to current BMF algorithms in term of running time. Moreover, in some cases GreCon outperforms GreConD-the fastest BMF algorithm. Additionally, we argue that a search strategy of GreConD, notwithstanding it provides a good result, is limited. Furthermore, we show that our novel approach to GreCon opens a new door to further BMF research.
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
Others
Publication year
2020
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
Proceedings of the 15th International Conference on Concept Lattices and Their Applications
ISBN
978-9949-83-557-7
ISSN
1613-0073
e-ISSN
—
Number of pages
12
Pages from-to
59-70
Publisher name
Tallinn University of Technology
Place of publication
Tallinn
Event location
Tallinn, Estonia
Event date
Jun 29, 2020
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—