Number of the records: 1  

Two Expectation-Maximization Algorithms for Boolean Factor Analysis

  1. SYS0369641
    LBL
      
    00860^^^^^2200229^^^450
    005
      
    20240103200101.6
    014
      
    $a 84893735667 $2 SCOPUS
    014
      
    $a 000333233200012 $2 WOS
    017
    70
    $a 10.1016/j.neucom.2012.02.055 $2 DOI
    100
      
    $a 20111219d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a NL
    200
    1-
    $a Two Expectation-Maximization Algorithms for Boolean Factor Analysis
    215
      
    $a 15 s.
    463
    -1
    $1 001 cav_un_epca*0257314 $1 011 $a 0925-2312 $e 1872-8286 $1 200 1 $a Neurocomputing $v Roč. 130, 23 April (2014), s. 83-97 $1 210 $c Elsevier
    541
    1-
    $a Dva EM algoritmy pro Booleovskou faktorovou analýzu $z cze
    610
    0-
    $a Boolean Factor analysis
    610
    0-
    $a Binary Matrix factorization
    610
    0-
    $a Neural networks
    610
    0-
    $a Binary data model
    610
    0-
    $a Dimension reduction
    610
    0-
    $a Bars problem
    700
    -1
    $3 cav_un_auth*0100750 $4 070 $a Frolov $b A. A. $y RU
    701
    -1
    $3 cav_un_auth*0100766 $i Oddělení fundamentálních témat $j Department of Fundamental Topics $w Department of Machine Learning $4 070 $a Húsek $b Dušan $p UIVT-O $z K $T Ústav informatiky AV ČR, v. v. i.
    701
    -1
    $3 cav_un_auth*0214859 $4 070 $a Polyakov $b P.Y. $y RU
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.