Joint Schatten $$p$$ p -norm and $$\ell _p$$ ℓ p -norm robust matrix completion for missing value recovery


The low-rank matrix completion problem is a fundamental machine learning and data mining problem with many important applications. The standard low-rank matrix completion methods relax the rank minimization problem by the trace norm minimization. However, this relaxation may make the solution seriously deviate from the original solution. Meanwhile, most completion methods minimize the squared prediction errors on the observed entries, which is sensitive to outliers. In this paper, we propose a new robust matrix completion method to address these two problems. The joint Schatten $$p$$ p -norm and $$\ell _p$$ ℓ p -norm are used to better approximate the rank minimization problem and enhance the robustness to outliers. The extensive experiments are performed on both synthetic data and real-world applications in collaborative filtering prediction and social network link recovery. All empirical results show that our new method outperforms the standard matrix completion methods.

DOI: 10.1007/s10115-013-0713-z

Extracted Key Phrases

8 Figures and Tables

Cite this paper

@article{Nie2013JointS, title={Joint Schatten \$\$p\$\$ p -norm and \$\$\ell _p\$\$ ℓ p -norm robust matrix completion for missing value recovery}, author={Feiping Nie and Hua Wang and Heng Huang and Chris H. Q. Ding}, journal={Knowledge and Information Systems}, year={2013}, volume={42}, pages={525-544} }