首页> 外文期刊>Neural computing & applications >Robust non-negative matrix factorization via joint sparse and graph regularization for transfer learning
【24h】

Robust non-negative matrix factorization via joint sparse and graph regularization for transfer learning

机译:通过联合稀疏和图正则化对转移学习进行鲁棒的非负矩阵分解

获取原文
获取原文并翻译 | 示例
           

摘要

In real-world applications, we often have to deal with some high-dimensional, sparse, noisy, and non-independent identically distributed data. In this paper, we aim to handle this kind of complex data in a transfer learning framework, and propose a robust non-negative matrix factorization via joint sparse and graph regularization model for transfer learning. First, we employ robust non-negative matrix factorization via sparse regularization model (RSNMF) to handle source domain data and then learn a meaningful matrix, which contains much common information between source domain and target domain data. Second, we treat this learned matrix as a bridge and transfer it to target domain. Target domain data are reconstructed by our robust non-negative matrix factorization via joint sparse and graph regularization model (RSGNMF). Third, we employ feature selection technique on new sparse represented target data. Fourth, we provide novel efficient iterative algorithms for RSNMF model and RSGNMF model and also give rigorous convergence and correctness analysis separately. Finally, experimental results on both text and image data sets demonstrate that our REGTL model outperforms existing start-of-art methods.
机译:在实际应用中,我们经常必须处理一些高维,稀疏,嘈杂和非独立的均匀分布的数据。在本文中,我们旨在在转移学习框架中处理此类复杂数据,并通过联合稀疏和图正则化模型为转移学习提出一种鲁棒的非负矩阵分解。首先,我们通过稀疏正则化模型(RSNMF)采用鲁棒的非负矩阵分解来处理源域数据,然后学习有意义的矩阵,该矩阵包含源域和目标域数据之间的许多公共信息。其次,我们将此学习矩阵视为桥梁并将其转移到目标域。通过联合的稀疏和图正则化模型(RSGNMF),通过鲁棒的非负矩阵分解来重建目标域数据。第三,我们对新的稀疏表示目标数据采用特征选择技术。第四,我们为RSNMF模型和RSGNMF模型提供了新颖有效的迭代算法,并且分别给出了严格的收敛性和正确性分析。最后,关于文本和图像数据集的实验结果表明,我们的REGTL模型优于现有的最新方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号