Neural Metric Factorization for Recommendation

Xiaoxin Sun, Liqiu Gong, Zhichao Han, Peng Zhao, Junchao Yu and Suhua Wang
Additional contact information
Xiaoxin Sun: School of Information Science and Technology, Northeast Normal University, Changchun 130117, China
Liqiu Gong: School of Information Science and Technology, Northeast Normal University, Changchun 130117, China
Zhichao Han: School of Information Science and Technology, Northeast Normal University, Changchun 130117, China
Peng Zhao: School of Information Science and Technology, Northeast Normal University, Changchun 130117, China
Junchao Yu: School of Information Science and Technology, Northeast Normal University, Changchun 130117, China
Suhua Wang: Institute of Technology Changchun Humanities and Sciences College, Changchun 130117, China

Mathematics, 2022, vol. 10, issue 3, 1-14

Abstract: All current recommendation algorithms, when modeling user–item interactions, basically use dot product. This dot product calculation is derived from matrix factorization. We argue that an inherent drawback of matrix factorization is that latent semantic vectors of users or items sometimes do not satisfy triangular inequalities, which may affect the performance of the recommendation. Recently, metric factorization was proposed to replace matrix factorization and has achieved some improvements in terms of recommendation accuracy. However, similar to matrix factorization, metric factorization still uses a simple, linear fashion. In this paper, we explore leveraging nonlinear deep neural networks to realize Euclidean distance interaction between users and items. We propose a generic Neural Metric Factorization Framework (NMetricF), which learns representations for users and items by incorporating Euclidean metric factorization into deep neural networks. Extensive experiments on six real-world datasets show that, compared to the previous recommendation algorithms based purely on rating data, NMetricF achieves the best performance.

Keywords: neural metric factorization; euclidean distance; collaborative filtering; deep learning (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2022
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/10/3/503/pdf (application/pdf)
https://www.mdpi.com/2227-7390/10/3/503/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:10:y:2022:i:3:p:503-:d:742255

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().