arrow
返回

Learning sparse features for classification by mixture models

delete2004-01-01
delete18
PRE
AI
刘
刘维湘 (Weixiang Liu)
N
Nanning Zheng
DOI:10.1016/j.patrec.2003.09.007delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Non-negative matrix factorization (NMF) can discover sparse features for classification via mixture models and the sparseness of features controls the learning rate of the basis function parameters. But the original NMF in which the basis vectors are unit ones in L-1 norm, does not increase the sparseness of learned features. This paper generalizes NMF to L-p-NMF where the basis vectors are unit ones in L-p norm. Experiments demonstrate how p affects the sparseness of learned features and the final classification accuracy. And the results show that L-2-NMF is superior one for practical implementation. (C) 2003 Elsevier B.V. All rights reserved.
Keyword:
non-negative matrix factorization
classification
mixture models
sparse features
Lp norm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Pattern Recognition Letters 封面图
Pattern Recognition Letters
IF:
3.3
论文数:
8.0K
被引数:
1.6W

机构

暂无机构信息
引用论文

引用论文

Power Walker Helps a Child with Cerebral Palsy
err2016-05-01
err0
errOAAI
errAnna McCormick; Hana Alazem; Aliasgar Morbi; Richard Beranek; Roselle Adler; Genevieve Tibi; Elizabeth Vilé
err分享
err收藏
err分享
err收藏
没有更多内容