Number of the records: 1  

Boolean Factor Analysis by the Expectation-Maximization Algorithm

  1. SYS0347801
    LBL
      
    00826^^^^^2200217^^^450
    005
      
    20240103193924.2
    100
      
    $a 20101004d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a FR
    200
    1-
    $a Boolean Factor Analysis by the Expectation-Maximization Algorithm
    463
    -1
    $1 001 cav_un_epca*0347780 $1 200 1 $a COMPSTAT’2010. Book of Abstracts $v S. 19-19 $1 210 $a Paris $d 2010
    610
    0-
    $a Boolean factor analysis
    610
    0-
    $a generative model
    610
    0-
    $a information gain
    610
    0-
    $a efficiency measure
    700
    -1
    $3 cav_un_auth*0207300 $a Frolov $b A. $y RU
    701
    -1
    $3 cav_un_auth*0214859 $a Polyakov $b P.Y. $y RU $4 070
    701
    -1
    $3 cav_un_auth*0100766 $a Húsek $b Dušan $i Oddělení nelineárního modelování $j Department of Nonlinear Modelling $p UIVT-O $w Department of Machine Learning $T Ústav informatiky AV ČR, v. v. i.
Number of the records: 1  

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