{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T02:46:47Z","timestamp":1760237207001,"version":"build-2065373602"},"reference-count":55,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2020,3,9]],"date-time":"2020-03-09T00:00:00Z","timestamp":1583712000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>Low-rank tensor factorization can not only mine the implicit relationships between data but also fill in the missing data when working with complex data. Compared with the traditional collaborative filtering (CF) algorithm, the changes are essentially proposed, from traditional matrix analysis to three-dimensional spatial analysis. Based on low-rank tensor factorization, this paper proposes a recommendation model that comprehensively considers local information and global information, in other words, combining the similarity between trust users and low-rank tensor factorization. First, the similarity between trusted users is measured to capture local information between users by trusting similar preferences of users when selecting items. Then, the users\u2019 similarity is integrated into the tensor, and the low-rank tensor factorization is used to better maintain and describe the internal structure of the data to obtain global information. Furthermore, based on the idea of the alternating least squares method, the conjugate gradient (CG) optimization algorithm for the model of this paper is designed. The local and global information is used to generate the optimal expected result in an iterative process. Finally, we conducted a large number of comparative experiments on the Ciao dataset and the FilmTrust dataset. Experimental results show that the algorithm has less precision loss under the data set with lower density. Thus, not only can a perfect compromise between accuracy and coverage be achieved, but also the computational complexity can be reduced to meet the need for real-time results.<\/jats:p>","DOI":"10.3390\/sym12030439","type":"journal-article","created":{"date-parts":[[2020,3,13]],"date-time":"2020-03-13T08:58:59Z","timestamp":1584089939000},"page":"439","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Low-Rank Tensor Factorization Using Implicit Similarity in Trust Relationships"],"prefix":"10.3390","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4323-649X","authenticated-orcid":false,"given":"Pei","family":"Ma","sequence":"first","affiliation":[{"name":"School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liejun","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwei","family":"Qin","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,3,9]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/j.knosys.2013.03.012","article-title":"Recommender systems survey","volume":"46","author":"Bobadilla","year":"2013","journal-title":"Knowl. Based Syst."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1007\/s11257-018-9214-9","article-title":"A comparative analysis of recommender systems based on item aspect opinions extracted from user reviews","volume":"29","author":"Cantador","year":"2019","journal-title":"User Modeling User Adapt. Interact."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.knosys.2012.07.019","article-title":"A new similarity function for selecting neighbors for each target item in collaborative filtering","volume":"37","author":"Choi","year":"2013","journal-title":"Knowl. Based Syst."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Jeong, H., and Chak, J. (2019). An Efficient MapReduce-Based Parallel Processing Framework for User-Based Collaborative Filtering. Symmetry, 11.","DOI":"10.3390\/sym11060748"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1016\/j.jocs.2018.09.007","article-title":"Trust aware recommender system using swarm intelligence","volume":"28","author":"Yadav","year":"2018","journal-title":"J. Comput. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/TKDE.2011.18","article-title":"Mining web graphs for recommendations","volume":"24","author":"Ma","year":"2011","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.artint.2012.02.002","article-title":"Towards mobile intelligence: Learning from GPS history data for collaborative recommendation","volume":"184","author":"Zheng","year":"2012","journal-title":"Artif. Intell."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"100864","DOI":"10.1016\/j.jocs.2018.04.015","article-title":"Finding, analysing and solving MPI communication bottlenecks in Earth System models","volume":"36","author":"Prims","year":"2019","journal-title":"J. Comput. Sci."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Kim, K.S., Chang, D.S., and Choi, Y.S. (2019). Boosting Memory-Based Collaborative Filtering Using Content-Metadata. Symmetry, 11.","DOI":"10.3390\/sym11040561"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Maroulis, S., Boutsis, I., and Kalogeraki, V. (2016, January 5\u20138). Context-aware point of interest recommendation using tensor factorization. Proceedings of the 2016 IEEE International Conference on Big Data (Big Data), Washington, DC, USA.","DOI":"10.1109\/BigData.2016.7840694"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/j.ins.2018.01.035","article-title":"Matrix factorization for low-rank tensor completion using framelet prior","volume":"436","author":"Jiang","year":"2018","journal-title":"Inf. Sci."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Zhao, J., and Sun, G. (2018). Detect User\u2019s Rating Characteristics by Separate Scores for Matrix Factorization Technique. Symmetry, 10.","DOI":"10.3390\/sym10110616"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1080\/01969722.2016.1128771","article-title":"Mymoviehistory: Social recommender system by discovering social affinities among users","volume":"47","author":"Hong","year":"2016","journal-title":"Cybern. Syst."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.ins.2014.12.004","article-title":"Gputensor: Efficient tensor factorization for context-aware recommendations","volume":"299","author":"Zou","year":"2015","journal-title":"Inf. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/3057283","article-title":"A time-aware personalized point-of-interest recommendation via high-order tensor factorization","volume":"35","author":"Li","year":"2017","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Ma, H., Yang, H., Lyu, M.R., and King, I. (2008, January 26\u201330). Sorec: Social recommendation using probabilistic matrix factorization. Proceedings of the 17th ACM Conference on Information and Knowledge Management, Napa Valley, CA, USA.","DOI":"10.1145\/1458082.1458205"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"3308","DOI":"10.1214\/17-AOS1659","article-title":"Multilayer tensor factorization with applications to recommender systems","volume":"46","author":"Bi","year":"2018","journal-title":"Ann. Stat."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1145\/963770.963772","article-title":"Evaluating collaborative filtering recommender systems","volume":"22","author":"Herlocker","year":"2004","journal-title":"ACM Trans. Inf. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1145\/1183463.1183470","article-title":"Inferring binary trust relationships in web-based social networks","volume":"6","author":"Golbeck","year":"2006","journal-title":"ACM Trans. Internet Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/MIC.2003.1167344","article-title":"Amazon com recommendations: Item-to-item collaborative filtering","volume":"7","author":"Linden","year":"2003","journal-title":"IEEE Internet Comput."},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Moradi, P., Rezaimehr, F., Ahmadian, S., and Jalili, M. (2016, January 1\u20133). A trust-aware recommender algorithm based on users overlapping community structure. Proceedings of the 2016 Sixteenth International Conference on Advances in ICT for Emerging Regions (ICTer), Negombo, Sri Lanka.","DOI":"10.1109\/ICTER.2016.7829914"},{"key":"ref_22","unstructured":"Guo, G., Zhang, J., and Yorke-Smith, N. (2013, January 1st). A novel bayesian similarity measure for recommender systems. Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, Beijing, Chain."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/j.eswa.2016.05.021","article-title":"A genetic algorithm solution to the collaborative filtering problem","volume":"61","author":"Ar","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Al-Shamri, M.Y.H., and Bharadwaj, K.K. (2007, January 13\u201315). A compact user model for hybrid movie recommender system. Proceedings of the International Conference on Computational Intelligence and Multimedia Applications (ICCIMA 2007), Tamil Nadu, India.","DOI":"10.1109\/ICCIMA.2007.15"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/widm.1150","article-title":"Predicting the dynamics of social circles in ego networks using pattern analysis and GA K-means clustering","volume":"5","author":"Agarwal","year":"2015","journal-title":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1183","DOI":"10.1016\/j.eswa.2011.07.124","article-title":"Trust based recommender system using ant colony for trust computation","volume":"39","author":"Bedi","year":"2012","journal-title":"Expert Syst. Appl."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/2915921","article-title":"Tensors for data mining and data fusion: Models, applications, and scalable algorithms","volume":"8","author":"Papalexakis","year":"2017","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Symeonidis, P., Nanopoulos, A., and Manolopoulos, Y. (2008, January 23\u201325). Tag recommendations based on tensor dimensionality reduction. Proceedings of the 2008 ACM Conference on Recommender Systems, New York, NY, USA.","DOI":"10.1145\/1454008.1454017"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rendle, S., and Schmidt-Thieme, L. (2010, January 4\u20136). Pairwise interaction tensor factorization for personalized tag recommendation. Proceedings of the third ACM International Conference on Web Search and Data Mining, New York, NY, USA.","DOI":"10.1145\/1718487.1718498"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Rendle, S., and Freudenthaler, C. Improving pairwise learning for item recommendation from implicit feedback. WSDM\u201914, Proceedings of the 7th ACM International Conference on Web Search and Data Mining, New York, NY, USA, 24\u201328 February 2014, Association for Computing Machinery.","DOI":"10.1145\/2556195.2556248"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/TSMCA.2012.2208186","article-title":"The TFC model: Tensor factorization and tag clustering for item recommendation in social tagging systems","volume":"43","author":"Rafailidis","year":"2012","journal-title":"IEEE Trans. Syst. ManCybern. Syst."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Symeonidis, P., Papadimitriou, A., and Manolopoulos, Y. (2011, January 27). Geo-social recommendations based on incremental tensor reduction and local path traversal. Proceedings of the 3rd ACM SIGSPATIAL International Workshop on Location-Based Social Networks, Chicago, IL, USA.","DOI":"10.1145\/2063212.2063228"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1016\/j.neucom.2017.02.067","article-title":"A temporal-aware POI recommendation system using context-aware tensor decomposition and weighted HITS","volume":"242","author":"Ying","year":"2017","journal-title":"Neurocomputing"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Ifada, N., and Nayak, R. (2014, January 7\u201311). Tensor-based item recommendation using probabilistic ranking in social tagging systems. Proceedings of the 23rd International Conference on World Wide Web, Seoul, Korea.","DOI":"10.1145\/2567948.2579243"},{"key":"ref_35","unstructured":"Zheng, N., Li, Q., Liao, S., and Zhang, L.M. (, January July). Flickr group recommendation based on tensor decomposition. Proceedings of the 33rd International ACM SIGIR Conference on Research and Development in Information Retrieval, New York, NY, USA."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Karatzoglou, A., Amatriain, X., Baltrunas, L., and Oliver, N. (2010, January 26\u201330). Multiverse recommendation: N-dimensional tensor factorization for context-aware collaborative filtering. Proceedings of the Fourth ACM Conference on Recommender Systems, Barcelona, Spain.","DOI":"10.1145\/1864708.1864727"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/s10791-009-9110-3","article-title":"Gradient descent optimization of smoothed information retrieval metrics","volume":"13","author":"Chapelle","year":"2010","journal-title":"Inf. Retr."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Gemulla, R., Nijkamp, E., Haas, P.J., Haas, P.J., Sismanis, Y., Teflioudi, C., and Makari, F. (2011, January 22\u201327). Large-scale matrix factorization with distributed stochastic gradient descent. Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Diego, CA, USA.","DOI":"10.1145\/2020408.2020426"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1016\/S0893-9659(04)90104-8","article-title":"Some new variants of Newton\u2019s method","volume":"17","year":"2004","journal-title":"Appl. Math. Lett."},{"key":"ref_40","unstructured":"Shewchuk, J.R. (2020, March 09). An Introduction to the Conjugate Gradient Method without the Agonizing Pain. Available online: https:\/\/www.cs.cmu.edu\/~quake-papers\/painless-conjugate-gradient.pdf."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"409","DOI":"10.6028\/jres.049.044","article-title":"Methods of conjugate gradients for solving linear systems","volume":"49","author":"Hestenes","year":"1952","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1093\/comjnl\/7.2.149","article-title":"Function minimization by conjugate gradients","volume":"7","author":"Fletcher","year":"1964","journal-title":"Comput. J."},{"key":"ref_43","first-page":"35","article-title":"Note sur la convergence de directions conjug\u00e9es","volume":"16","author":"Polak","year":"1969","journal-title":"Rev. Fr. Inf. Rech. Opertionelle"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0041-5553(69)90035-4","article-title":"The conjugate gradient method in extremal problems","volume":"9","author":"Polyak","year":"1969","journal-title":"Ussr Comput. Math. Math. Phys."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/S1052623497318992","article-title":"A nonlinear conjugate gradient method with a strong global convergence property","volume":"10","author":"Dai","year":"1999","journal-title":"Siam J. Optim."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1137\/030601880","article-title":"A new conjugate gradient method with guaranteed descent and an efficient line search","volume":"16","author":"Hager","year":"2005","journal-title":"Siam J. Optim."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1137\/100813026","article-title":"A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search","volume":"23","author":"Dai","year":"2013","journal-title":"Siam J. Optim."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.ins.2015.07.049","article-title":"Tensor completion using total variation and low-rank matrix factorization","volume":"326","author":"Ji","year":"2016","journal-title":"Inf. Sci."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"601","DOI":"10.3934\/ipi.2015.9.601","article-title":"Parallel matrix factorization for low-rank tensor completion","volume":"9","author":"Xu","year":"2015","journal-title":"Inverse Probl. Imaging"},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.inffus.2015.07.005","article-title":"Efficient recommendation methods using category experts for a large dataset","volume":"28","author":"Hwang","year":"2016","journal-title":"Inf. Fusion"},{"key":"ref_51","first-page":"3619","article-title":"SVDFeature: A toolkit for feature-based collaborative filtering","volume":"13","author":"Chen","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref_52","unstructured":"Jia, Y., Zhang, C., Lu, Q., and Wang, P. (2014, January 29\u201330). Users\u2019 brands preference based on SVD++ in recommender systems. Proceedings of the 2014 IEEE Workshop on Advanced Research and Technology in Industry Applications (WARTIA), Ottawa, ON, Canada."},{"key":"ref_53","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1007\/s10342-010-0400-5","article-title":"A review of habitat thresholds for dead wood: A baseline for management recommendations in European forests","volume":"129","year":"2010","journal-title":"Eur. J. For. Res."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Campos, P.G., Bellog\u00edn, A., D\u00edez, F., and Chavarriaga, J.E. (2010, January 30). Simple time-biased KNN-based recommendations. Proceedings of the Workshop on Context-Aware Movie Recommendation, Barcelona, Spain.","DOI":"10.1145\/1869652.1869655"},{"key":"ref_55","doi-asserted-by":"crossref","unstructured":"Li, T., Gao, C., and Du, J. (2009, January 26\u201328). A NMF-based privacy-preserving recommendation algorithm. Proceedings of the 2009 First International Conference on Information Science and Engineering, Nanjing, China.","DOI":"10.1109\/ICISE.2009.107"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/3\/439\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:05:29Z","timestamp":1760173529000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/3\/439"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,3,9]]},"references-count":55,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2020,3]]}},"alternative-id":["sym12030439"],"URL":"https:\/\/doi.org\/10.3390\/sym12030439","relation":{},"ISSN":["2073-8994"],"issn-type":[{"type":"electronic","value":"2073-8994"}],"subject":[],"published":{"date-parts":[[2020,3,9]]}}}