[1] BUSA-FEKETE R, SZÖRÉNYI B, WENG P, et al. Preference-based reinforcement learning:evolutionary direct policy search using a preference-based racing algorithm[J]. Machine Learning, 2014, 97(3):327-351. [2] BOBADILLA J, ORTEGA F, HERNANDO A. Recommender systems survey[J]. Knowledge-Based Systems, 2013, 46(1):109-132. [3] 吴金龙.Netflix Prize中的协同过滤算法[D].北京:北京大学,2010:7-10.(WU J L, Collaborative filtering algorithm in Prize Netflix[D]. Beijing:Peking University, 2010:7-10.) [4] GERBRANDS J J. On the relationships between SVD, KLT and PCA[J]. Pattern Recognition, 1981, 14(1/2/3/4/5/6):375-381. [5] SHNAYDERMAN A, GUSEV A, ESKICIOGLU A M. An SVD-based grayscale image quality measure for local and global assessment[J]. IEEE Transactions on Image Processing, 2006, 15(2):422-429. [6] KUMAR R, VERMA B K, RASTOGI S S. Social popularity based SVD++ recommender system[J]. International Journal of Computer Applications, 2014, 87(14):33-37. [7] JIA Y, ZHANG C, LU Q, et al. Users' brands preference based on SVD++ in recommender systems[C]//Proceedings of the 2014 IEEE Workshop on Advanced Research and Technology in Industry Applications. Piscataway, NJ:IEEE, 2014:1175-1178. [8] GAO C, ZHOU H H. Rate-optimal posterior contraction for sparse PCA[J]. The Annals of Statistics, 2015, 43(2):785-818. [9] BERTOLINI A C, SCHIOZER D J. Principal component analysis for reservoir uncertainty reduction[J]. Journal of the Brazilian Society of Mechanical Sciences and Engineering, 2016, 38(4):1345-1355. [10] XU F, GU G, KONG X, et al. Object tracking based on two-dimensional PCA[J]. Optical Review, 2016, 23(2):231-243. [11] WATKINS D S. Fundamentals of Matrix Computations[M]. New York:John Wiley & Sons, 1991:2-30. [12] ACHLIOPTAS D, MCSHERRY F. Fast computation of low-rank matrix approximations[C]//Proceedings of the 33rd Annual ACM Symposium on Theory of Computing. New York:ACM, 2001:611-618. [13] PFINGSTNER J, SCHULTE D, SNUVERINK J, et al. SVD-based filter design for the trajectory feedback of CLIC[EB/OL].[2016-03-10]. http://epaper.kek.jp/IPAC2011/papers/mopo014.pdf. [14] DRINEAS P, MAHONEY M W, MUTHUKRISHNAN S. Relative-error CUR matrix decompositions[J]. SIAM Journal on Matrix Analysis and Applications, 2008, 30(2):844-881. [15] BOUTSIDIS C, WOODRUFF D P. Optimal CUR matrix decompositions[C]//Proceedings of the 46th Annual ACM Symposium on Theory of Computing. New York:ACM, 2014:353-362. [16] BIEN J, XU Y, MAHONEY M W. CUR from a sparse optimization viewpoint[EB/OL].[2016-03-08]. http://www.stat.berkeley.edu/~mmahoney/pubs/cur-spca.pdf. [17] WANG L, REGE M, DONG M, et al. Low-rank kernel matrix factorization for large scale evolutionary clustering[J]. IEEE Transactions on Knowledge and Data Engineering, 2012, 24(6):1036-1050. [18] BELL R M, KOREN Y, VOLINSKY C. The BellKor 2008 solution to the Netflix Prize[EB/OL].[2016-02-21]. http://xueshu.baidu.com/s?wd=paperuri%3A%289ef8f488c3613e6a70daca0f02435bb8%29&filter=sc_long_sign&tn=SE_xueshusource_2kduw22v&sc_vurl=http%3A%2F%2Fciteseerx.ist.psu.edu%2Fviewdoc%2Fdownload%3Bjsessionid%3D3DFEC03FEB7FC3D400E97763E310721E%3Fdoi%3D10.1.1.448.222%26rep%3Drep1%26type%3Dpdf&ie=utf-8&sc_us=13947115770219594334. [19] 刘惊雷.CP-nets及其表达能力研究[J].自动化学报,2011,37(3):290-302.(LIU J L. CP-nets and study of expression ability[J]. Acta Automatica Sinica, 2011, 37(3):290-302.) [20] WANG S, ZHANG Z. Improving CUR matrix decomposition and the Nystr m approximation via adaptive sampling[J]. Journal of Machine Learning Research, 2013, 14(1):2729-2769. [21] WEIMER M, KARATZOGLOU A, SMOLA A. Improving maximum margin matrix factorization[J]. Machine Learning, 2008, 72(3):263-276. [22] GURUSWAMI V, SINOP A K. Optimal column-based low-rank matrix reconstruction[C]//Proceedings of the 23rd Annual ACM-SIAM Symposium on Discrete Algorithms. Philadelphia, PA:Society for Industrial and Applied Mathematics, 2012:1207-1214. [23] BOUTSIDIS C, DRINEAS P, MAGDON-ISMAIL M. Near-optimal column-based matrix reconstruction[C]//Proceedings of the 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. Washington, DC:IEEE Computer Society, 2011:305-314. |