Parallelization of the GreConD algorithm for boolean matrix factorization

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F19%3A73595309" target="_blank" >RIV/61989592:15310/19:73595309 - isvavai.cz</a>
Výsledek na webu
<a href="https://link.springer.com/chapter/10.1007%2F978-3-030-21462-3_14" target="_blank" >https://link.springer.com/chapter/10.1007%2F978-3-030-21462-3_14</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-030-21462-3_14" target="_blank" >10.1007/978-3-030-21462-3_14</a>

Jazyk výsledku
angličtina
Název v původním jazyce
Parallelization of the GreConD algorithm for boolean matrix factorization
Popis výsledku v původním jazyce
Boolean matrix factorization (BMF) is a well established and widely used tool for data analysis. Vast majority of existing algorithms for BMF is based on some greedy strategy which makes them highly sequential, thus unsuited for parallel execution. We propose a parallel variant of well-known BMF algorithm—GreConD, which is able to distribute workload among multiple parallel threads, hence can benefit from modern multicore CPUs. The proposed algorithm is based on formal concept analysis, intended for shared memory computers, and significantly reducing computation time of BMF via parallel execution
Název v anglickém jazyce
Parallelization of the GreConD algorithm for boolean matrix factorization
Popis výsledku anglicky
Boolean matrix factorization (BMF) is a well established and widely used tool for data analysis. Vast majority of existing algorithms for BMF is based on some greedy strategy which makes them highly sequential, thus unsuited for parallel execution. We propose a parallel variant of well-known BMF algorithm—GreConD, which is able to distribute workload among multiple parallel threads, hence can benefit from modern multicore CPUs. The proposed algorithm is based on formal concept analysis, intended for shared memory computers, and significantly reducing computation time of BMF via parallel execution

Druh
D - Stať ve sborníku
CEP obor
—
OECD FORD obor
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt
—
Návaznosti
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění
2019
Kód důvěrnosti údajů
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Podobné výsledky(10)