Number of the records: 1  

Boolean Factor Analysis by the Expectation-Maximization Algorithm

  1. SYS0347803
    LBL
      
    01057^^^^^2200253^^^450
    005
      
    20240111140744.7
    100
      
    $a 20100910d m y slo 03 ba
    101
    0-
    $a eng
    102
      
    $a DE
    200
    1-
    $a Boolean Factor Analysis by the Expectation-Maximization Algorithm
    215
      
    $a 8 s. $c flash disk
    463
    -1
    $1 001 cav_un_epca*0346935 $1 010 $a 978-3-7908-2603-6 $1 200 1 $a Proceedings of COMPSTAT 2010 $v S. 1039-1046 $1 210 $a Heidelberg $c Physica Verlag $d 2010 $1 702 1 $a Lechevallier $b Y $4 340 $1 702 1 $a Saporta $b G. $4 340
    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*0100750 $a Frolov $b A. A. $4 070 $y RU
    701
    -1
    $3 cav_un_auth*0214859 $a Polyakov $b P.Y. $y RU
    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.
    856
      
    $s 586 kB
Number of the records: 1  

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