.png){kind=icon}
返回
Two Expectation-Maximization algorithms for Boolean Factor Analysis
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2012.02.055.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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 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. (C) 2013 Elsevier B.V. All rights reserved.
Keyword:
Boolean Factor Analysis
Binary Matrix Factorization
Neural networks
Binary data model
Dimension reduction
Bars problem
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
分享收藏
Exploring the functional significance of dendritic inhibition in cortical pyramidal cells皮层锥体细胞树突抑制的功能意义探讨.png)
NEUROCOMPUTING
OAAI
NEUROCOMPUTINGIF6.5
OAAI分享收藏Contributing factors to the migration of antimicrobials in active packaging films主动包装薄膜中抗菌剂迁移的促成因素
PREAI
分享收藏What are the computations of the cerebellum, the basal ganglia and the cerebral cortex?小脑，基底神经节和大脑皮层的计算是什么？NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
分享收藏分享收藏
查看更多内容