An EM algorithm for learning sparse and overcomplete representations
Zhong, MJ; Tang, HW; Chen, HJ; Tang, YY
2004-03-01
发表期刊NEUROCOMPUTING
ISSN0925-2312
文章类型Article
卷号57页码:469-476
摘要An expectation-maximization (EM) algorithm for learning sparse and overcomplete representations is presented in this paper. We show that the estimation of the conditional moments of the posterior distribution can be accomplished by maximum a posteriori estimation. The approximate conditional moments,enable the development of an EM algorithm for learning the overcomplete basis vectors and inferring the most probable basis coefficients. (C) 2003 Elsevier B.V. All rights reserved.
关键词overcomplete representations EM algorithm maximum a posteriori
收录类别SCI
语种英语
WOS记录号WOS:000220670700027
引用统计
文献类型期刊论文
条目标识符http://ir.psych.ac.cn/handle/311026/14017
专题中国科学院心理研究所回溯数据库(1956-2010)
作者单位1.Dalian Univ Technol, Inst Neuroinformat, Dept Foreign Languages, Dalian 116023, Peoples R China
2.Dalian Univ Technol, Inst Computat Biol & Bioinformat, Dalian 116023, Peoples R China
3.Chinese Acad Sci, Lab Visual Informat Proc, Beijing 100101, Peoples R China
4.Chinese Acad Sci, Key Lab Mental Hlth, Beijing 100101, Peoples R China
推荐引用方式
GB/T 7714
Zhong, MJ,Tang, HW,Chen, HJ,et al. An EM algorithm for learning sparse and overcomplete representations[J]. NEUROCOMPUTING,2004,57:469-476.
APA Zhong, MJ,Tang, HW,Chen, HJ,&Tang, YY.(2004).An EM algorithm for learning sparse and overcomplete representations.NEUROCOMPUTING,57,469-476.
MLA Zhong, MJ,et al."An EM algorithm for learning sparse and overcomplete representations".NEUROCOMPUTING 57(2004):469-476.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Zhong, MJ]的文章
[Tang, HW]的文章
[Chen, HJ]的文章
百度学术
百度学术中相似的文章
[Zhong, MJ]的文章
[Tang, HW]的文章
[Chen, HJ]的文章
必应学术
必应学术中相似的文章
[Zhong, MJ]的文章
[Tang, HW]的文章
[Chen, HJ]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。