{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T16:04:04Z","timestamp":1771517044822,"version":"3.50.1"},"reference-count":37,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T00:00:00Z","timestamp":1585785600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Science Foundation of China","award":["61867006"],"award-info":[{"award-number":["61867006"]}]},{"name":"the National Science Foundation of China","award":["61771416"],"award-info":[{"award-number":["61771416"]}]},{"name":"the Doctoral Scientific Research Foundation of Xinjiang University","award":["BS150263"],"award-info":[{"award-number":["BS150263"]}]},{"name":"The Higher Education Innovation Project of Xinjiang Uygur Autonomous Region","award":["XJEDU2017T002"],"award-info":[{"award-number":["XJEDU2017T002"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>In modern recommender systems, matrix factorization has been widely used to decompose the user\u2013item matrix into user and item latent factors. However, the inner product in matrix factorization does not satisfy the triangle inequality, and the problem of sparse data is also encountered. In this paper, we propose a novel recommendation model, namely, metric factorization with item cooccurrence for recommendation (MFIC), which uses the Euclidean distance to jointly decompose the user\u2013item interaction matrix and the item\u2013item cooccurrence with shared latent factors. The item cooccurrence matrix is obtained from the colike matrix through the calculation of pointwise mutual information. The main contributions of this paper are as follows: (1) The MFIC model is not only suitable for rating prediction and item ranking, but can also well overcome the problem of sparse data. (2) This model incorporates the item cooccurrence matrix into metric learning so it can better learn the spatial positions of users and items. (3) Extensive experiments on a number of real-world datasets show that the proposed method substantially outperforms the compared algorithm in both rating prediction and item ranking.<\/jats:p>","DOI":"10.3390\/sym12040512","type":"journal-article","created":{"date-parts":[[2020,4,2]],"date-time":"2020-04-02T13:39:34Z","timestamp":1585834774000},"page":"512","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Metric Factorization with Item Cooccurrence for Recommendation"],"prefix":"10.3390","volume":"12","author":[{"given":"Honglin","family":"Dai","sequence":"first","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liejun","family":"Wang","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiwei","family":"Qin","sequence":"additional","affiliation":[{"name":"College of Information Science and Engineering, Xinjiang University, Urumqi 830046, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,4,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"92732","DOI":"10.1109\/ACCESS.2019.2927496","article-title":"Network Embedding Using Semi-Supervised Kernel Nonnegative Matrix Factorization","volume":"7","author":"He","year":"2019","journal-title":"IEEE Access"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J. (1994, January 22\u201326). GroupLens: An Open Architecture for Collaborative Filtering of Netnews. Proceedings of the 1994 ACM conference on Computer Supported Cooperative Work, Chapel Hill, NC, USA.","DOI":"10.1145\/192844.192905"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1155\/2009\/421425","article-title":"A Survey of Collaborative Filtering Techniques","volume":"Volume 2009","author":"Su","year":"2009","journal-title":"Advances in Artificial Intelligence"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"He, X., Liao, L., Zhang, H., Nie, L., Hu, X., and Chua, T.-S. (2017, January 3\u20137). Neural Collaborative Filtering. Proceedings of the 26th International Conference on World Wide Web, Perth, Australia.","DOI":"10.1145\/3038912.3052569"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2556270","article-title":"Collaborative Filtering beyond the User-Item Matrix: A Survey of the State of the Art and Future Challenges","volume":"47","author":"Yue","year":"2014","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Ram, P., and Gray, A.G. (2012, January 12\u201316). Maximum inner-product search using cone trees. Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Beijing, China.","DOI":"10.1145\/2339530.2339677"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1037\/0033-295X.89.2.123","article-title":"Similarity, separability, and the triangle inequality","volume":"89","author":"Tversky","year":"1982","journal-title":"Psychol. Rev."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Hu, Y., Koren, Y., and Volinsky, C. (2008). Collaborative Filtering for Implicit Feedback Datasets. ICDM, IEEE Computer Society.","DOI":"10.1109\/ICDM.2008.22"},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Tay, Y., Tuan, L.A., and Hui, S.C. (2018, January 23\u201327). Latent Relational Metric Learning via Memory-based Attention for Collaborative Ranking. Proceedings of the Web Conference (WWW 2018), Lyon, France.","DOI":"10.1145\/3178876.3186154"},{"key":"ref_10","first-page":"207","article-title":"Distance Metric Learning for Large Margin Nearest Neighbor Classification","volume":"10","author":"Weinberger","year":"2009","journal-title":"J. Mach. Learn. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1980","DOI":"10.1109\/TMM.2015.2476657","article-title":"Understanding Blooming Human Groups in Social Networks","volume":"17","author":"Hong","year":"2015","journal-title":"IEEE Trans. Multimed."},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Steck, H. (2010, January 24\u201328). Training and testing of recommender systems on data missing not at random. Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA.","DOI":"10.1145\/1835804.1835895"},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/MC.2009.263","article-title":"Matrix Factorization Techniques for Recommender Systems","volume":"42","author":"Koren","year":"2009","journal-title":"Computer"},{"key":"ref_14","unstructured":"Salakhutdinov, R. (2007, January 3\u20136). Probabilistic matrix factorization. Proceedings of the 20th International Conference on Neural Information Processing Systems, Vancouver, BC, Canada."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Salakhutdinov, R., and Mnih, A. (2008, January 5\u20139). Bayesian probabilistic matrix factorization using markov chain monte carlo. ICML 08. Proceedings of the 25th International Conference on Machine Learning, Helsinki, Finland.","DOI":"10.1145\/1390156.1390267"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"62815","DOI":"10.1109\/ACCESS.2018.2877137","article-title":"Location-Aware Service Recommendation With Enhanced Probabilistic Matrix Factorization","volume":"6","author":"Yin","year":"2018","journal-title":"IEEE Access"},{"key":"ref_17","unstructured":"Rubens, N., Kaplan, D., and Sugiyama, M. (2011, January 11\u201315). Active learning in recommender systems. Proceedings of the 19th International Conference on User Modeling, Adaption, Girona, Spain."},{"key":"ref_18","unstructured":"(July, January 28). Koren and Yehuda. Collaborative filtering with temporal dynamics. Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Volkovs, M., and Yu, G.W. (2015, January 9\u201313). Effective Latent Models for Binary Feedback in Recommender Systems. Proceedings of the 38th International ACM SIGIR Conference on Research and Development in Information Retrieval, Santiago, Chile.","DOI":"10.1145\/2766462.2767716"},{"key":"ref_20","unstructured":"Levy, O., and Goldberg, Y. (2014, January 8\u201313). Neural Word Embedding as Implicit Matrix Factorization. Proceedings of the 28th Conference on Neural Information Processing Systems (NIPS), Montreal, QC, Canada."},{"key":"ref_21","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G., and Dean, J. (2013, January 5\u20138). Distributed representations of words and phrases and their compositionality. NIPS\u201913. Proceedings of the 26th International Conference on Neural Information Processing Systems, Lake Tahoe, NV, USA."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Guardiasebaoun, E., Guigue, V., and Gallinari, P. (2015, January 16\u201320). Latent Trajectory Modeling: A Light and Efficient Way to Introduce Time in Recommender Systems. Proceedings of the 9th ACM Conference on Recommender Systems, Vienna, Austria.","DOI":"10.1145\/2792838.2799676"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Liang, D., Altosaar, J., Charlin, L., and Blei, D.M. (2016, January 15\u201319). Factorization Meets the Item Embedding: Regularizing Matrix Factorization with Item Co-occurrence. Proceedings of the 10th ACM Conference on Recommender Systems, Boston, MA, USA.","DOI":"10.1145\/2959100.2959182"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Tran, T., Lee, K., Liao, Y., and Lee, D. (2018, January 22\u201326). Regularizing Matrix Factorization with User and Item Embeddings for Recommendation. Proceedings of the 27th ACM International Conference on Information and Knowledge Managemen, Torino, Italy.","DOI":"10.1145\/3269206.3271730"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"He, X., Zhang, H., Kan, M.Y., and Chua, T.S. (2016, January 17\u201321). Fast Matrix Factorization for Online Recommendation with Implicit Feedback. Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, Pisa, Italy.","DOI":"10.1145\/2911451.2911489"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Barkan, O., and Koenigstein, N. (2016, January 13\u201316). ITEM2VEC: Neural item embedding for collaborative filtering. Proceedings of the 2016 IEEE 26th International Workshop on Machine Learning for Signal Processing (MLSP), Vietri sul Mare, Salerno, Italy.","DOI":"10.1109\/MLSP.2016.7738886"},{"key":"ref_27","first-page":"1","article-title":"Metric Factorization: Recommendation beyond Matrix Factorization","volume":"6","author":"Shuai","year":"2018","journal-title":"Comput. Sci."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Koren, Y. (2008, January 24\u201327). Factorization meets the neighborhood: A multifaceted collaborative filtering model. Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, NV, USA.","DOI":"10.1145\/1401890.1401944"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Bayer, I., He, X., Kanagal, B., and Rendle, S. (2017, January 3\u20137). A generic coordinate descent framework for learning from implicit feedback. Proceedings of the 26th International Conference on World Wide Web, Perth Australia.","DOI":"10.1145\/3038912.3052694"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Liang, D., Charlin, L., Mcinerney, J., and Blei, D.M. (2016, January 11\u201315). Modeling User Exposure in Recommendation. WWW 16. Proceedings of the 25th International Conference on World Wide Web, Montr\u00e9al, QC, Canada.","DOI":"10.1145\/2872427.2883090"},{"key":"ref_31","first-page":"1929","article-title":"Dropout: A simple way to prevent neural networks from overfitting","volume":"15","author":"Srivastava","year":"2014","journal-title":"J. Mach. Learn. Res. Arch."},{"key":"ref_32","first-page":"257","article-title":"Adaptive subgradient methods for online learning and stochastic optimization","volume":"12","author":"Duchi","year":"2011","journal-title":"J. Mach. Learn. Res. Arch."},{"key":"ref_33","first-page":"1","article-title":"Attention-based Group Recommendation","volume":"1","author":"Tran","year":"2018","journal-title":"Assoc. Comput. Mach."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Hsieh, C.-K., Yang, L., Cui, Y., Lin, T.-Y., Belongie, S., and Estrin, D. (2017, January 3\u20137). Collaborative Metric Learning. Proceedings of the 26th International Conference on World Wide Web (WWW \u201917), Perth, Australia.","DOI":"10.1145\/3038912.3052639"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Li, P., Wang, Z., Ren, Z., Bing, L., and Lam, W. (2017, January 7\u201311). Neural rating regression with abstractive tips generation for recommendation, SIGIR\u201917. Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval, Tokyo, Japan.","DOI":"10.1145\/3077136.3080822"},{"key":"ref_36","first-page":"1","article-title":"Neural Network Matrix Factorization","volume":"11","author":"Dziugaite","year":"2015","journal-title":"Comput. Sci."},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Wu, Y., Dubois, C., Zheng, A.X., and Ester, M. (2016, January 22\u201325). Collaborative Denoising Auto-Encoders for Top-N Recommender Systems, WSDM\u201916. Proceedings of the Ninth ACM International Conference on Web Search and Data Mining, San Francisco, CA, USA.","DOI":"10.1145\/2835776.2835837"}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/512\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T09:14:41Z","timestamp":1760174081000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/12\/4\/512"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,2]]},"references-count":37,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2020,4]]}},"alternative-id":["sym12040512"],"URL":"https:\/\/doi.org\/10.3390\/sym12040512","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,2]]}}}