{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:33:05Z","timestamp":1777703585809,"version":"3.51.4"},"reference-count":25,"publisher":"SAGE Publications","issue":"3","license":[{"start":{"date-parts":[[2017,2,24]],"date-time":"2017-02-24T00:00:00Z","timestamp":1487894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"published-print":{"date-parts":[[2017,2,24]]},"abstract":"<jats:p>Collaborative filtering recommendation algorithms based on traditional matrix factorization model have poor robustness and low recommendation accuracy when facing shilling attacks. To address this issue, we propose a novel robust recommendation method based on kernel matrix factorization. We first construct a robust kernel matrix factorization model for collaborative recommendation by using kernel mapping of the rating matrix and kernel distance, and regulate residual error with the scale factor, which can enhance the power of the model\u2019s anti-attack and realize the robust estimation of user feature matrix and item feature matrix. Then we introduce kernel distance to compute the similarity between users in order to improve the credibility of user similarity and reduce the influence of attack profiles on the recommendation results. Finally, we devise a robust collaborative recommendation algorithm based on the kernel matrix factorization model. Experimental results show that our algorithm can improve the robustness and accuracy compared with the existing algorithms.<\/jats:p>","DOI":"10.3233\/jifs-161705","type":"journal-article","created":{"date-parts":[[2017,2,28]],"date-time":"2017-02-28T11:28:04Z","timestamp":1488281284000},"page":"2101-2109","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":13,"title":["A novel robust recommendation method based on kernel matrix factorization"],"prefix":"10.1177","volume":"32","author":[{"given":"Hongtao","family":"Yu","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruibo","family":"Gao","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao, China"},{"name":"School of Science, Yanshan University, Qinhuangdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Science, Yanshan University, Qinhuangdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fuzhi","family":"Zhang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University, Qinhuangdao, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2017,2,24]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10462-012-9364-9"},{"key":"e_1_3_2_3_2","doi-asserted-by":"crossref","unstructured":"BurkeR. O\u2019MahonyM.P. and HurleyN.J. Robust collaborative recommendation. Recommender Systems Handbook. Springer US 2011 pp. 805\u2013835.","DOI":"10.1007\/978-0-387-85820-3_25"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.90"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/1644873.1644874"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297240"},{"key":"e_1_3_2_9_2","first-page":"105","article-title":"Robust collaborative recommendation by least trimmed squares matrix factorization","volume":"2","author":"Cheng Z.","year":"2010","unstructured":"ChengZ. and HurleyN., Robust collaborative recommendation by least trimmed squares matrix factorization, Tools with Artificial Intelligence (ICTAJ) 2010 22nd IEEE International Conference on IEEE, 2, 2010, pp. 105\u2013112.","journal-title":"Tools with Artificial Intelligence (ICTAJ) 2010 22nd IEEE International Conference on IEEE"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/1390334.1390350"},{"issue":"9","key":"e_1_3_2_11_2","first-page":"1067","article-title":"A metadata-enhanced variational bayesian matrix factorization model for robust collaborative recommendation (in Chinese)","volume":"37","author":"Li C.","year":"2011","unstructured":"LiC. and LuoZ.G., A metadata-enhanced variational bayesian matrix factorization model for robust collaborative recommendation (in Chinese), Journal of Automatica Sinica 37(9) (2011), 1067\u20131076.","journal-title":"Journal of Automatica Sinica"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1049\/iet-ifs.2014.0488"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.12.011"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2015.10.060"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2012.04.012"},{"key":"e_1_3_2_16_2","first-page":"378","article-title":"Kernelized matrix factorization for collaborative filtering","author":"Liu X.","year":"2016","unstructured":"LiuX., AggarwalC., LiY., et al., Kernelized matrix factorization for collaborative filtering. In SIAM Conference on Data Mining, 2016, pp. 378\u2013386.","journal-title":"SIAM Conference on Data Mining"},{"key":"e_1_3_2_17_2","first-page":"201","article-title":"Robust nonnegative matrix factorization via half-quadratic minimization","author":"Du L.","year":"2012","unstructured":"DuL., LiX. and ShenY.D., Robust nonnegative matrix factorization via half-quadratic minimization. IEEE 12th International Conference on Data Mining, 2012, pp. 201\u2013210.","journal-title":"IEEE 12th International Conference on Data Mining"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1974.10482962"},{"key":"e_1_3_2_19_2","first-page":"176","volume-title":"Proc 2005 IEEE Computer Society Conf on Computer Vision and Pattern Recognition (CVPR\u201905) Washington","author":"Yang C.","year":"2005","unstructured":"YangC., DuraiswamiR. and DavisL., Efficient mean-shift tracking via a new similarity measure, Proc 2005 IEEE Computer Society Conf on Computer Vision and Pattern Recognition (CVPR\u201905) Washington, DC, USA, 2005, pp. 176\u2013183."},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1001.2009.00350"},{"key":"e_1_3_2_21_2","first-page":"45","volume-title":"Doctoral Dissertation","author":"Liu S.H.","year":"2011","unstructured":"LiuS.H. and ZhangJ.Y., Research and application on kernel matrix low-rank decomposition and the kernel space information, In Doctoral Dissertation, Xidian University, 2011, pp. 45\u201347."},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37410-4_5"},{"key":"e_1_3_2_23_2","first-page":"201","article-title":"Robust kernel nonnegative matrix factorization","author":"Xia Z.","year":"2012","unstructured":"XiaZ., DingC. and ChowE., Robust kernel nonnegative matrix factorization, IEEE 12th International Conference on Data Mining Workshops, 2012, pp. 201\u2013210.","journal-title":"IEEE 12th International Conference on Data Mining Workshops"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2015.03.039"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-010-0411-7"},{"key":"e_1_3_2_26_2","unstructured":"RicciF. RokachL. ShapiraB. et al. Recommender Systems Handbook. Berlin: Springer 2011 pp. 145\u2013186."}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-161705","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-161705","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-161705","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:39:02Z","timestamp":1777455542000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-161705"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,24]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,2,24]]}},"alternative-id":["10.3233\/JIFS-161705"],"URL":"https:\/\/doi.org\/10.3233\/jifs-161705","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,2,24]]}}}