TY - JOUR
T1 - Cold-Start Next-Item Recommendation by User-Item Matching and Auto-Encoders
AU - Wu, Hanrui
AU - Wong, Chung Wang
AU - Zhang, Jia
AU - Yan, Yuguang
AU - Yu, Dahai
AU - Long, Jinyi
AU - Ng, Michael K.
N1 - This work was supported in part by the National Natural Science Foundation of China under Grants 62206111, 62276115, 62106084, 62206061, in part by Outstanding Youth Project of Guangdong Natural Science Foundation of China under Grant 2021B1515020076, in part by Guangdong Provincial Natural Science Foundation of China under Grant 2022A1515010468, in part by China Postdoctoral Science Foundation under Grants 2022M721343, 2022M711331, in part by Fundamental Research Funds for the Central Universities under Grants 21622326, 21621026, in part by Science and Technology Project in Guangzhou under Grant 202201010498. M. Ng's work as funded in part by HKRGC GRF under Grants 12300519, 17201020, 17300021, in part by HKRGC CRF under Grants C1013-21GF, C7004-21GF, and NSFC-RGC N-HKU769/21, and HKU-TCL Joint Research Centre for Artificial Intelligence.
PY - 2023/7
Y1 - 2023/7
N2 - Recommendation systems provide personalized service to users and aim at suggesting to them items that they may prefer. There is an increasing requirement of next-item recommendation systems to infer a user's next favor item based on his/her historical selection of items. In this article, we study the next-item recommendation under the cold-start situation, where the users in the system share no interaction with the new items. Specifically, we seek to address the problem from the perspective of zero-shot learning (ZSL), which classifies samples whose classes are unseen during training. To this end, we crystallize the relationship and setting from ZSL to cold-start next-item recommendation, and further propose a novel model called User-Item Matching and Auto-encoders (UIMA) which learns the latent embeddings for both users and items by exploiting user historical preferences and item attributes. Concretely, UIMA consists of three components, i.e., two auto-encoders for learning user and item embeddings and a matching network to explore the relationship between the learned user and item embeddings. We perform experiments on several cold-start next-item recommendation datasets, including movies, music, and bookmarks. Promising results demonstrate the effectiveness of the proposed method for cold-start next-item recommendation.
AB - Recommendation systems provide personalized service to users and aim at suggesting to them items that they may prefer. There is an increasing requirement of next-item recommendation systems to infer a user's next favor item based on his/her historical selection of items. In this article, we study the next-item recommendation under the cold-start situation, where the users in the system share no interaction with the new items. Specifically, we seek to address the problem from the perspective of zero-shot learning (ZSL), which classifies samples whose classes are unseen during training. To this end, we crystallize the relationship and setting from ZSL to cold-start next-item recommendation, and further propose a novel model called User-Item Matching and Auto-encoders (UIMA) which learns the latent embeddings for both users and items by exploiting user historical preferences and item attributes. Concretely, UIMA consists of three components, i.e., two auto-encoders for learning user and item embeddings and a matching network to explore the relationship between the learned user and item embeddings. We perform experiments on several cold-start next-item recommendation datasets, including movies, music, and bookmarks. Promising results demonstrate the effectiveness of the proposed method for cold-start next-item recommendation.
KW - Auto-encoder
KW - cold-start
KW - item recommendation
KW - recommendation systems
UR - http://www.scopus.com/inward/record.url?scp=85147312522&partnerID=8YFLogxK
U2 - 10.1109/TSC.2023.3237638
DO - 10.1109/TSC.2023.3237638
M3 - Journal article
AN - SCOPUS:85147312522
SN - 1939-1374
VL - 16
SP - 2477
EP - 2489
JO - IEEE Transactions on Services Computing
JF - IEEE Transactions on Services Computing
IS - 4
ER -