.png){kind=icon}
返回
Variational Bayesian sparse additive matrix factorization
.png){kind=icon}
OA
AI
DOI：10.1007/s10994-013-5347-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Principal component analysis (PCA) approximates a data matrix with a low-rank one by imposing sparsity on its singular values. Its robust variant can cope with spiky noise by introducing an element-wise sparse term. In this paper, we extend such sparse matrix learning methods, and propose a novel framework called sparse additive matrix factorization (SAMF). SAMF systematically induces various types of sparsity by a Bayesian regularization effect, called model-induced regularization. Although group LASSO also allows us to design arbitrary types of sparsity on a matrix, SAMF, which is based on the Bayesian framework, provides inference without any requirement for manual parameter tuning. We propose an efficient iterative algorithm called the mean update (MU) for the variational Bayesian approximation to SAMF, which gives the global optimal solution for a large subset of parameters in each step. We demonstrate the usefulness of our method on benchmark datasets and a foreground/background video separation problem.
Keyword:
Variational Bayes
Robust PCA
Matrix factorization
Sparsity
Model-induced regularization
期刊
IF:
2.9
论文数:
2.7K
被引数:
3.4W
机构
引用论文
.png){kind=icon}
RANDOM SAMPLE CONSENSUS - A PARADIGM FOR MODEL-FITTING WITH APPLICATIONS TO IMAGE-ANALYSIS AND AUTOMATED CARTOGRAPHY随机样本共识-模型拟合的范例，可应用于图像分析和自动制图OAAI
OAAI分享收藏In-situ IR Spectroscopy to Study Anodic Oxidation of Si(111) in KOH Solution原位红外光谱研究Si(111) 在KOH溶液中的阳极氧化
OAAI
OAAI分享收藏
查看更多内容