TY - JOUR
T1 - Feature Matching Machine for Cold-Start Recommendation
AU - Wu, Hanrui
AU - Li, Nuosi
AU - Kwok, Ka Ho
AU - Cai, Xuheng
AU - Zhang, Jia
AU - Long, Jinyi
AU - Ng, Michael K.
N1 - The work of Michael K. Ng was supported in part by the Hong Kong Research Grant Council GRF under Grants 17201020 and 17300021, in part by CRF under Grant C7004-21GF and in part by Joint NSFC-RGC under Grant N-HKU76921. This work was supported in part by the National Natural Science Foundation of China under Grants 62206111, 62276115, and 62106084, in part by the Young Talent Support Project of Guangzhou Association for Science and Technology under Grant QT-2023-017, in part by the Guangzhou Basic and Applied Basic Research Foundation under Grants 2023A04J1058 and 202201010498, in part by the China Postdoctoral Science Foundation under Grants 2022M721343 and 2022M711331, in part by the National Natural Science Foundation of Guangdong, China under Grants 2019A1515012175 and 2022A1515010468, in part by the Outstanding Youth Project of Guangdong Natural Science Foundation of China under Grant 2021B1515020076, in part by the Guangdong Provincial Key Laboratory of Traditional Chinese Medicine Informatization under Grant 2021B1212040007, in part by the Science and Technology Planning Project of Guangdong Province under Grant 2023A0505050092, and in part by the Fundamental Research Funds for Central Universities under Grant 21622326.
PY - 2024/1
Y1 - 2024/1
N2 - In recommendation systems, the cold-start issue is a long-standing problem where no historical interaction records are given for certain users or items. Under this circumstance, recommendations for new users or new items become challenging. To address this problem, most existing approaches seek to discover a latent common space for users and items. However, these methods require a strong assumption that a shared space exists where the distributions of users and items are identical, which may limit the recommendation performance. In this article, we propose a novel model called Feature Matching Machine (FMM) to learn latent informative user and item representations. Different from previous methods, for warm users (or items), FMM learns two kinds of latent features, i.e., one is constructed by a hypergraph auto-encoder based on historical interactions between users and items, and the other is built by a multi-layer perceptron based on users (or items). Subsequently, FMM matches these two latent feature representations so as to discover the relationships across users (or items) and cold-start items (or users). We conduct extensive experiments on several real-world datasets and compare the proposed method with well-known baseline methods. Promising results demonstrate the effectiveness and efficiency of the proposed model.
AB - In recommendation systems, the cold-start issue is a long-standing problem where no historical interaction records are given for certain users or items. Under this circumstance, recommendations for new users or new items become challenging. To address this problem, most existing approaches seek to discover a latent common space for users and items. However, these methods require a strong assumption that a shared space exists where the distributions of users and items are identical, which may limit the recommendation performance. In this article, we propose a novel model called Feature Matching Machine (FMM) to learn latent informative user and item representations. Different from previous methods, for warm users (or items), FMM learns two kinds of latent features, i.e., one is constructed by a hypergraph auto-encoder based on historical interactions between users and items, and the other is built by a multi-layer perceptron based on users (or items). Subsequently, FMM matches these two latent feature representations so as to discover the relationships across users (or items) and cold-start items (or users). We conduct extensive experiments on several real-world datasets and compare the proposed method with well-known baseline methods. Promising results demonstrate the effectiveness and efficiency of the proposed model.
KW - Cold-start recommendation
KW - hypergraph auto- encoder
KW - hypergraph convolution
KW - multi-layer perceptron
KW - recommendation systems
UR - http://www.scopus.com/inward/record.url?scp=85178060741&partnerID=8YFLogxK
U2 - 10.1109/TSC.2023.3334241
DO - 10.1109/TSC.2023.3334241
M3 - Journal article
AN - SCOPUS:85178060741
SN - 1939-1374
VL - 17
SP - 98
EP - 112
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 1
ER -