Number of the records: 1
Two Expectation-Maximization Algorithms for Boolean Factor Analysis
- 1.
SYSNO ASEP 0369641 Document Type J - Journal Article R&D Document Type Journal Article Subsidiary J Článek ve WOS Title Two Expectation-Maximization Algorithms for Boolean Factor Analysis Title Dva EM algoritmy pro Booleovskou faktorovou analýzu Author(s) Frolov, A. A. (RU)
Húsek, Dušan (UIVT-O) RID, SAI, ORCID
Polyakov, P.Y. (RU)Source Title Neurocomputing. - : Elsevier - ISSN 0925-2312
Roč. 130, 23 April (2014), s. 83-97Number of pages 15 s. Language eng - English Country NL - Netherlands Keywords Boolean Factor analysis ; Binary Matrix factorization ; Neural networks ; Binary data model ; Dimension reduction ; Bars problem Subject RIV IN - Informatics, Computer Science R&D Projects GAP202/10/0262 GA ČR - Czech Science Foundation (CSF) CEZ AV0Z10300504 - UIVT-O (2005-2011) UT WOS 000333233200012 EID SCOPUS 84893735667 DOI 10.1016/j.neucom.2012.02.055 Annotation 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, we propose a general generative model of binary data for Boolean Factor Analysis and introduce two new Expectation-Maximization Boolean Factor Analysis algorithms which maximize the likelihood of a Boolean Factor Analysis solution. To show the maturity of our solutions we propose an informational measure of Boolean Factor Analysis efficiency. Using the so-called bars problem benchmark, we compare the efficiencies of the proposed algorithms to that of Dendritic Inhibition Neural Network, Maximal Causes Analysis, and Boolean Matrix Factorization. Last mentioned methods were taken as related methods as they are supposed to be the most efficient in bars problem benchmark. Then we discuss the peculiarities of the two methods we proposed and the three related methods in performing Boolean Factor Analysis. Workplace Institute of Computer Science Contact Tereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800 Year of Publishing 2015
Number of the records: 1