All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Parallelization of the GreConD 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%2F19%3A73595309" target="_blank" >RIV/61989592:15310/19:73595309 - isvavai.cz</a>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Parallelization of the GreConD algorithm for boolean matrix factorization

  • Original language description

    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

  • 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

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2019

  • 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-21461-6

  • ISSN

    0302-9743

  • e-ISSN

    1611-3349

  • Number of pages

    15

  • Pages from-to

    208-222

  • Publisher name

    Springer International

  • Place of publication

    Cham

  • Event location

    Frankfurt am Main

  • Event date

    Jun 25, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000492749700014