Informed Split Gradient Non-negative Matrix factorization using Huber cost function for source apportionment

Robert Chreiky, G. Delmaire, M. Puigt, G. Roussel, A. Abche
{"title":"Informed Split Gradient Non-negative Matrix factorization using Huber cost function for source apportionment","authors":"Robert Chreiky, G. Delmaire, M. Puigt, G. Roussel, A. Abche","doi":"10.1109/ISSPIT.2016.7886011","DOIUrl":null,"url":null,"abstract":"Source apportionment is usually tackled with blind Positive/Non-negative Matrix factorization (PMF/NMF) methods. However, the obtained results may be poor due to the dependence between some rows of the second factor. We recently proposed to inform the estimation of this factor using some prior knowledge provided by chemists—some entries are set to some fixed values—and the sum-to-one property of each row. These constraints were recently taken into account by using a parameterization which gathers all of them. In this paper, a novel robust NMF approach able to cope with outliers is proposed. For that purpose, we consider the Huber loss function—a ℓ2-ℓ1 cost function—which is robust to outliers, contrary to the Frobenius norm classically met in NMF. We thus propose new update rules for the informed Huber NMF in the framework of the split gradient techniques. The choice of the adaptive cutoff parameter—which links both single cost functions—is discussed along this paper. The proposed approach is shown to outperform state-of-the-art methods on several source apportionment simulations involving various input SNRs and outliers.","PeriodicalId":371691,"journal":{"name":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT.2016.7886011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Source apportionment is usually tackled with blind Positive/Non-negative Matrix factorization (PMF/NMF) methods. However, the obtained results may be poor due to the dependence between some rows of the second factor. We recently proposed to inform the estimation of this factor using some prior knowledge provided by chemists—some entries are set to some fixed values—and the sum-to-one property of each row. These constraints were recently taken into account by using a parameterization which gathers all of them. In this paper, a novel robust NMF approach able to cope with outliers is proposed. For that purpose, we consider the Huber loss function—a ℓ2-ℓ1 cost function—which is robust to outliers, contrary to the Frobenius norm classically met in NMF. We thus propose new update rules for the informed Huber NMF in the framework of the split gradient techniques. The choice of the adaptive cutoff parameter—which links both single cost functions—is discussed along this paper. The proposed approach is shown to outperform state-of-the-art methods on several source apportionment simulations involving various input SNRs and outliers.
基于Huber代价函数的非负矩阵分解
源分配通常采用盲正/非负矩阵分解(PMF/NMF)方法。然而,由于第二因素的某些行之间的依赖性,所得结果可能较差。我们最近建议使用化学家提供的一些先验知识(某些条目被设置为某些固定值)和每行的和为一的性质来通知该因子的估计。最近,通过使用一个参数化来考虑这些约束,该参数化将所有约束集合在一起。本文提出了一种新的鲁棒NMF方法,能够处理异常值。为此,我们考虑Huber损失函数(一个2- 1代价函数),它对异常值具有鲁棒性,与NMF中经典的Frobenius范数相反。因此,我们在分裂梯度技术的框架下提出了新的通知Huber NMF的更新规则。本文讨论了连接两个单代价函数的自适应截止参数的选择。在涉及各种输入信噪比和异常值的几种源分配模拟中,所提出的方法被证明优于最先进的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信