返回
Regularized matrix completion with partial side information
DOI:10.1016/j.neucom.2019.12.021.png)
摘要
En 中文
Side information has been shown useful for improving the performance of matrix completion applications. However, in most cases, only partial side information of either the column or row space is available. In this work, we propose a novel regularization based model to incorporate partial side information in matrix completion. We provide theoretical guarantees to ensure the success of the proposed model. It is proved that the proposed model achieves the state-of-the-art sample complexity when the given partial side information is exact, and an error bound for inexact partial side information is also provided. Moreover, we provide a deterministic rule for the selection of regularization parameter. We conduct extensive experiments on both synthetic and real-world data-sets. Experimental results show that our model succeeds to incorporate partial side information, and outperforms the state-of-the-art models on most data-sets. (C) 2019 Elsevier B.V. All rights reserved.
Keyword:
Matrix completion
Side information
Prior subspace information
Regularization
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
2.5W
被引数:
6.5W
机构
引用论文
ML-KNN: A lazy learning approach to multi-label leamingMl-knn: 一种多标签学习的懒惰学习方法
PATTERN RECOGNITION
IF7.6

