Supervised Collaborative Filtering Based on Ridge Alternating Least Squares and Iterative Projection Pursuit

被引:7
作者
Chen, Bo-Wei [1 ]
Ji, Wen [2 ]
Rho, Seungmin [3 ]
Gu, Yu [4 ]
机构
[1] Monash Univ, Sch Informat Technol, Melbourne, Vic 3800, Australia
[2] Chinese Acad Sci, Beijing Key Lab Mobile Comp & Pervas Device, Inst Comp Technol, Beijing 100190, Peoples R China
[3] Sungkyul Univ, Dept Media Software, Anyang 430742, South Korea
[4] Univ Sci & Technol Beijing, Sch Automat & Elect Engn, Beijing 100083, Peoples R China
基金
北京市自然科学基金; 中国国家自然科学基金;
关键词
Incomplete data analysis; privacy preservation; supervised collaborative filtering; collaborative filtering (CF); alternating least squares (ALS); supervised data imputation; data imputation; singular value decomposition (SVD); supervised nonnegative matrix factorization (NMF); recommendation system; low-rank matrix approximation; matrix completion; matrix factorization; iterative projection pursuit;
D O I
10.1109/ACCESS.2017.2688449
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents a supervised data imputation based on the class-dependent matrix factors, which are generated during matrix factorization. The proposed ridge alternating least squares imputation uses class information to create substituted values, which approximate the characteristics of their corresponding classes, for missing entries. In the training phase, the incomplete data with label information are divided into different classes based on their labels, such that basis matrices become class-dependent. Subsequently, iterative projection pursuit is proposed to perform imputation for testing data by computing the linear combination of these class-dependent basis matrices and their corresponding reconstruction weights. The class-dependent basis matrix with the minimum loss during reconstruction is regarded as the correct imputation for a testing sample, of which the substituted values are derived from the matrix factors of its class. Experiments on open data sets showed that the proposed method successfully decreased the imputation error by 40.52% on average, better than typical unsupervised collaborative filtering, while maintaining classification accuracy.
引用
收藏
页码:6600 / 6607
页数:8
相关论文
共 19 条
[1]   Scaling Out Big Data Missing Value Imputations [J].
Anagnostopoulos, Christos ;
Triantafillou, Peter .
PROCEEDINGS OF THE 20TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'14), 2014, :651-660
[2]  
[Anonymous], 2014, COMPUTER
[3]  
[Anonymous], 2014, Kernel Methods and Machine Learning
[4]   Learning multi-label scene classification [J].
Boutell, MR ;
Luo, JB ;
Shen, XP ;
Brown, CM .
PATTERN RECOGNITION, 2004, 37 (09) :1757-1771
[5]  
Chu M., 2004, OPTIMALITY COMPUTATI
[6]  
Ding C, 2006, P 12 ACM SIGKDD INT, P126, DOI 10.1145/1150402.1150420
[7]   MATRIX FACTORIZATION TECHNIQUES FOR RECOMMENDER SYSTEMS [J].
Koren, Yehuda ;
Bell, Robert ;
Volinsky, Chris .
COMPUTER, 2009, 42 (08) :30-37
[8]   Learning the parts of objects by non-negative matrix factorization [J].
Lee, DD ;
Seung, HS .
NATURE, 1999, 401 (6755) :788-791
[9]  
Lee DD, 2001, ADV NEUR IN, V13, P556
[10]   Projected gradient methods for nonnegative matrix factorization [J].
Lin, Chih-Jen .
NEURAL COMPUTATION, 2007, 19 (10) :2756-2779