TY - GEN
T1 - Matching novelty while training
T2 - 19th IEEE International Conference on Data Mining, ICDM 2019
AU - Lo, Kachun
AU - Ishigaki, Tsukasa
N1 - Funding Information:
This work was supported by JSPS KAKENHI (Grant Numbers JP17K03988, JP18H00904).
Publisher Copyright:
© 2019 IEEE.
PY - 2019/11
Y1 - 2019/11
N2 - Most works of recommender system seek to provide highly accurate item prediction while having potentially great bias to popular items. Both users and items' providers will suffer if their system has strong preference for monotonous popular items. A better system should consider also item novelty. Previous works of novel recommendation focus mainly on re-ranking a top-N list generated by an accuracy-focused base model. As a result, these frameworks are 2-stage and essentially limited to the base model. In addition, when training the base model, the common BRP loss function treats all pairs in the same manner, consistently suppresses interesting negative items which should have been recommended. In this work, we propose a personalized pairwise novelty weighting for BPR loss function, which covers the limitations of BPR and effectively improves novelty with marginal loss in accuracy. Base model will be guided by the loss weights to learn user preference and to generate novel suggestion list in 1 stage. Comprehensive experiments on 3 public datasets show that our approach effectively promotes novelty with almost no decrease in accuracy.
AB - Most works of recommender system seek to provide highly accurate item prediction while having potentially great bias to popular items. Both users and items' providers will suffer if their system has strong preference for monotonous popular items. A better system should consider also item novelty. Previous works of novel recommendation focus mainly on re-ranking a top-N list generated by an accuracy-focused base model. As a result, these frameworks are 2-stage and essentially limited to the base model. In addition, when training the base model, the common BRP loss function treats all pairs in the same manner, consistently suppresses interesting negative items which should have been recommended. In this work, we propose a personalized pairwise novelty weighting for BPR loss function, which covers the limitations of BPR and effectively improves novelty with marginal loss in accuracy. Base model will be guided by the loss weights to learn user preference and to generate novel suggestion list in 1 stage. Comprehensive experiments on 3 public datasets show that our approach effectively promotes novelty with almost no decrease in accuracy.
KW - Loss Weighting
KW - Novel Recommendation
KW - Personalized Recommendation
KW - Recommender System
UR - http://www.scopus.com/inward/record.url?scp=85078901724&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85078901724&partnerID=8YFLogxK
U2 - 10.1109/ICDM.2019.00057
DO - 10.1109/ICDM.2019.00057
M3 - Conference contribution
AN - SCOPUS:85078901724
T3 - Proceedings - IEEE International Conference on Data Mining, ICDM
SP - 468
EP - 477
BT - Proceedings - 19th IEEE International Conference on Data Mining, ICDM 2019
A2 - Wang, Jianyong
A2 - Shim, Kyuseok
A2 - Wu, Xindong
PB - Institute of Electrical and Electronics Engineers Inc.
Y2 - 8 November 2019 through 11 November 2019
ER -