Two Expectation-Maximization algorithms for Boolean Factor Analysis

Methods for the discovery of hidden structures of high-dimensional binary data are one of the most important challenges facing the community of machine learning researchers. There are many approaches in the literature that try to solve this hitherto rather ill-defined task. In the present study, we...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Neurocomputing (Amsterdam) Ročník 130; s. 83 - 97
Hlavní autori:	Frolov, Alexander A., Husek, Dusan, Polyakov, Pavel Y.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 23.04.2014
Predmet:	Algorithms Bars Bars problem Benchmarking Binary data Binary data model Binary Matrix Factorization Boolean algebra Boolean Factor Analysis Dimension reduction Factor analysis Mathematical models Neural networks Dimension reduction Binary Matrix Factorization Boolean Factor Analysis Binary data model Neural networks Bars problem
ISSN:	0925-2312, 1872-8286
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!