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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Neurocomputing (Amsterdam) Jg. 130; S. 83 - 97
Hauptverfasser:	Frolov, Alexander A., Husek, Dusan, Polyakov, Pavel Y.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 23.04.2014
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!