计算机科学 ›› 2015, Vol. 42 ›› Issue (7): 254-257.doi: 10.11896/j.issn.1002-137X.2015.07.054

• 人工智能 • 上一篇    下一篇

基于加权核范数最小化的矩阵填充模型

张玮奇,张宏志,左旺孟,崔梦天   

  1. 哈尔滨工业大学计算机科学与技术学院 哈尔滨150001,哈尔滨工业大学计算机科学与技术学院 哈尔滨150001,哈尔滨工业大学计算机科学与技术学院 哈尔滨150001,西南民族大学计算机科学与技术学院 成都610041;电子科技大学计算机科学与工程学院 成都610054
  • 出版日期:2018-11-14 发布日期:2018-11-14
  • 基金资助:
    本文受国家自然科学基金面上项目(61271093,61379019),四川省学术和技术带头人培养资金资助

Weighted Nuclear Norm Minimization Model for Matrix Completion

ZHANG Wei-qi, ZHANG Hong-zhi, ZUO Wang-meng and CUI Meng-tian   

  • Online:2018-11-14 Published:2018-11-14

摘要: 协同过滤是目前推荐系统最常用的技术之一,相比于传统的推荐技术具有一定优势,但其缺点是受用户对商品评价的稀疏性制约,现阶段一般利用矩阵填充技术来解决这一问题。主要研究了基于低秩的矩阵填充模型,针对原有模型解对所有奇异值用同一值收缩的问题,提出了一种加权核范数最小化模型以提高核范数灵活度,给出了该模型用收缩算子可得到全局最优解的相关定理及证明,同时对模型的另一种形式在求解过程中的迭代收敛性进行了证明。用凸优化主流算法在两种真实数据集上进行的实验表明,改进后的模型一定程度上提高了计算速度与准确性。

关键词: 协同过滤,矩阵填充,低秩,凸优化算法

Abstract: Collaborative filtering is one of the popular techniques used in recommendation system.It has some advantages over traditional recommendation technologies.But the limitation is that it is constrained by the data sparsity.Matrix completion technology can be used to solve this problem.This paper proposed an weighted nuclear norm minimization (WNNM) model for matrix completion to improve the flexibility of nuclear norm.Under certain condition,it can be proved to get global optimal solution.Meanwhile,convergence for another form of the proposed model was confirmed.With two real data sets,convex optimization algorithm of nuclear norm minimization was achieved to verify the proposed model.The result proves that to some extent it improves the computational speed and accuracy.

Key words: Collaborative filtering,Matrix completion,Low rank,Convex optimization algorithm

[1] 马宏伟,张光卫,李鹏.协同过滤推荐算法综述[J].小型微型计算机系统,2009,30(7):1282-1288 Ma Hong-wei,Zhang Guang-wei,Li Peng.Survey of Collaborative Filtering Algorithms[J].Journal of Chinese Computer Systems,2009,30(7):1282-1288
[2] 陈敏铭.矩阵恢复与重建[D].北京:中国科学院计算技术研究所,2010 Chen Min-ming.Algorithms and Implementation of Matrix Reconstruction[D].Beijing:Chinese Academy of Sciences,2010
[3] Zhang F,Chang H.A collaborative filtering algorithm embedded BP network to ameliorate sparsity issue[C]∥Proceedings of 2005 International Conference on Machine Learning and Cybernetics,2005.IEEE,2005:1839-1844
[4] Jung K Y,Hwang H J,Kang U G.Constructing full matrixthrough naive Bayesian for collaborative filtering[M]∥Computational Intelligence.Springer Berlin Heidelberg,2006:1210-1215
[5] Candès E J,Recht B.Exact matrix completion via convex optimization[J].Foundations of Computational mathematics,2009,9(6):717-772
[6] Toh K C,Yun S.An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems[J].Paci-fic Journal of Optimization,2010,6(15):615-640
[7] Lin Zhou-chen,Chen Min-ming,Ma Yi.The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices[J].arXiv preprint arXiv:1009.5055,2010
[8] Tao M,Yuan X.Recovering low-rank and sparse components of matrices from incomplete and noisy observations[J].SIAM Journal on Optimization,2011,21(1):57-81
[9] Yuan X,Yang J.Sparse and low-rank matrix decomposition via alternating direction methods[J].Preprint,2009,9(1):1-16
[10] Yang J,Yuan X.Linearized augmented Lagrangian and alternating direction methods for nuclear norm minimization[J].Mathe-matics of Computation,2013,82(281):301-329
[11] Lin Z,Liu R,Su Z.Linearized Alternating Direction Methodwith Adaptive Penalty for Low-Rank Representation[J]∥arXiv:1109.0367,1
[12] Cai J F,Candès E J,Shen Z.A singular value thresholding algorithm for matrix completion[J].SIAM Journal on Optimization,2010,20(4):1956-1982
[13] Gu S,Zhang L,Zuo W,et al.Weighted Nuclear Norm Minimization with Application to Image Denoising[C]∥2014 IEEE Comference on Computer Vision and Pattern Recognition.2014:2862-2869
[14] Xie Q,Meng D,Gu S,et al.On the Optimal Solution of Weighted Nuclear Norm Minimization[J].arXiv preprint arXiv:1405.6012,2014

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!