{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T06:45:28Z","timestamp":1777704328180,"version":"3.51.4"},"reference-count":23,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"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":[[2020,4,30]]},"abstract":"<jats:p>\u00a0With the popularity of networks and the increasing number of online users, recommender systems have suffered from the privacy leakage of sensitive information. While people enjoy recommender services, their information is exposed to the networks. To protect the privacy of users when using the recommender services, we propose a multi-level combined privacy-preserving model that maintains high accuracy of recommendation with privacy protection and alleviates the data sparsity problem. Our scheme contains two steps of recommendation. First, a multi-level combined random perturbation (MCRP) model is proposed on the client side. Our model dynamically divides multiple disturbance levels and adds noise of different ranges to the rating matrix according to Gaussian and uniform mixed disturbances. Second, on the server side, we propose a pseudo rating prediction filling (PRPF) algorithm based on the matrix factorization model. Combining the PRPF algorithm with the MCRP method significantly improves the recommender accuracy and effectively increases privacy security. Sensitive analysis and comparison experiments show that the proposed privacy method has certain advantages in security and recommender accuracy by using three publicly available datasets.<\/jats:p>","DOI":"10.3233\/jifs-191287","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T12:43:35Z","timestamp":1582029815000},"page":"4525-4535","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":1,"title":["A novel privacy-preserving matrix factorization recommendation system based on random perturbation"],"prefix":"10.1177","volume":"38","author":[{"given":"Hu","family":"Zhaoyan","sequence":"first","affiliation":[{"name":"School of Computer and Information, Anhui Normal University, Wuhu, Anhui, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Wuhu, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luo","family":"Yonglong","sequence":"additional","affiliation":[{"name":"School of Computer and Information, Anhui Normal University, Wuhu, Anhui, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Wuhu, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Xiaoyao","sequence":"additional","affiliation":[{"name":"School of Computer and Information, Anhui Normal University, Wuhu, Anhui, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Wuhu, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Yannian","sequence":"additional","affiliation":[{"name":"School of Computer and Information, Anhui Normal University, Wuhu, Anhui, China"},{"name":"Anhui Provincial Key Laboratory of Network and Information Security, Wuhu, Anhui, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2015.11.023"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-13-0617-4_52"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1145\/2556270"},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","unstructured":"CalandrinoJ.A. et al. You might also like: Privacy risks of collaborative filtering 2011 IEEE Symposium on Security and Privacy. IEEE (2011) 231\u2013246.","DOI":"10.1109\/SP.2011.40"},{"key":"e_1_3_2_6_2","doi-asserted-by":"crossref","unstructured":"ChangC.-C. et al. Towards publishing recommendation data with predictive anonymization. Proceedings of the 5th ACM Symposium on Information Computer and Communications Security. ACM (2010) 24\u201335. C.J. Kaufman RockyMountain Research Lab. Boulder CO private communication May 1995.","DOI":"10.1145\/1755688.1755693"},{"key":"e_1_3_2_7_2","doi-asserted-by":"crossref","unstructured":"BadshaS. et al. Privacy preserving user-based recommender system 2017 IEEE 37th International Conference on Distributed Computing Systems (ICDCS). IEEE (2017) 1074\u20131083.","DOI":"10.1109\/ICDCS.2017.248"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","unstructured":"ErkinZ. et al. Efficiently computing private recommendations 2011 IEEE International Conference on Acoustics Speech and Signal Processing (ICASSP). IEEE (2011) 5864\u20135867.","DOI":"10.1109\/ICASSP.2011.5947695"},{"key":"e_1_3_2_9_2","unstructured":"PolatH. and DuW. Privacy-preserving collaborative filtering using randomized perturbation techniques. Third IEEE International Conference on Data Mining. IEEE (2003) 625\u2013628."},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2016.11.018"},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","unstructured":"KorenY. and RobertB. Advances in collaborative filtering Recommender Systems Handbook Springer Boston MA (2015) 77\u2013118.","DOI":"10.1007\/978-1-4899-7637-6_3"},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29659-3_3"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2605085"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","unstructured":"KoutrikaG. Modern Recommender Systems: From Computing Matrices to Thinking with Neurons Proceedings of the 2018 International Conference on Management of Data. ACM (2018) 1651\u20131654.","DOI":"10.1145\/3183713.3197389"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.010"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2014.2308433"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.11.016"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","unstructured":"KorenY. Factorization meets the neighborhood: A multifaceted collaborative filtering model. Proceedings of the 14th ACMSIGKDD international conference on Knowledge discovery and data mining. ACM (2008) 426\u2013434.","DOI":"10.1145\/1401890.1401944"},{"key":"e_1_3_2_19_2","doi-asserted-by":"crossref","unstructured":"WangX. and ZhangJ. Handling the data growth with privacy preservation in collaborative filtering IAENG Transactions on Engineering Technologies Springer Dordrecht (2013) 231\u2013243.","DOI":"10.1007\/978-94-007-6190-2_18"},{"key":"e_1_3_2_20_2","unstructured":"ZhuX. et al. Tackling data sparseness in recommendation using social media based topic hierarchy modeling Twenty-Fourth International Joint Conference on Artificial Intelligence (2015) 2415\u20132421."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-006-0001-2"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.2991\/ijcis.2017.10.1.52"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2017.10.060"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.12.011"}],"container-title":["Journal of Intelligent &amp; Fuzzy Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191287","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JIFS-191287","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JIFS-191287","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:40:57Z","timestamp":1777455657000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JIFS-191287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,4,30]]}},"alternative-id":["10.3233\/JIFS-191287"],"URL":"https:\/\/doi.org\/10.3233\/jifs-191287","relation":{},"ISSN":["1064-1246","1875-8967"],"issn-type":[{"value":"1064-1246","type":"print"},{"value":"1875-8967","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]}}}