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”

How to assess quality of BMF algorithms?

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989592%3A15310%2F16%3A33160378" target="_blank" >RIV/61989592:15310/16:33160378 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1109/IS.2016.7737426" target="_blank" >http://dx.doi.org/10.1109/IS.2016.7737426</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/IS.2016.7737426" target="_blank" >10.1109/IS.2016.7737426</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    How to assess quality of BMF algorithms?

  • Original language description

    We critically examine the problem of quality assessment of algorithms for Boolean matrix factorization. We argue that little attention is paid to this problem in the literature. We view this problem as a multifaceted one and identify key aspects with respect to which the quality of algorithms should be assessed. Because of its utmost importance, we focus on assessment of quality of sets of factors extracted from Boolean data, propose ways to assess such quality and provide experimental evaluation involving selected factorization algorithms. We argue that the views involved in our proposal, represent reasonable basic standpoints for further systematic approaches to quality assessment.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

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

    2016

  • 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

    2016 IEEE 8th International Conference on Intelligent Systems, IS 2016 - Proceedings

  • ISBN

    978-1-5090-1353-1

  • ISSN

  • e-ISSN

  • Number of pages

    7

  • Pages from-to

    227-233

  • Publisher name

    Institute of Electrical and Electronics Engineers Inc.

  • Place of publication

    Sofia

  • Event location

    Sofia

  • Event date

    Sep 4, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article