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”

Toward quality assessment of Boolean matrix factorizations

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F18%3A73588407" target="_blank" >RIV/61989592:15310/18:73588407 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0020025518303694" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0020025518303694</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.ins.2018.05.016" target="_blank" >10.1016/j.ins.2018.05.016</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Toward quality assessment of Boolean matrix factorizations

  • Original language description

    Boolean matrix factorization has become an important direction in data analysis. In this paper, we examine the question of how to assess the quality of Boolean matrix factorization algorithms. We critically examine the current approaches, and argue that little attention has been paid to this problem so far and that a systematic approach to it is missing. We regard quality assessment of factorization algorithms as a multifaceted problem, identify major views with respect to which quality needs to be assessed, and present various observations on the available algorithms in this regard. Due to its primary importance, we concentrate on the quality of collections of factors computed from data, present a method to assess this quality, and evaluate this method by experiments.

  • 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

    <a href="/en/project/GA15-17899S" target="_blank" >GA15-17899S: Decompositions of Matrices with Boolean and Ordinal Data: Theory and Algorithms</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2018

  • 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

    INFORMATION SCIENCES

  • ISSN

    0020-0255

  • e-ISSN

  • Volume of the periodical

    459

  • Issue of the periodical within the volume

    AUG

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    16

  • Pages from-to

    71-85

  • UT code for WoS article

    000441118300005

  • EID of the result in the Scopus database

    2-s2.0-85047321234