Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3485447.3511971acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article
Open access

Learning Explicit User Interest Boundary for Recommendation

Published: 25 April 2022 Publication History

Abstract

The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score sp and minimize the negative sample score sn, which can usually be summarized into two paradigms: the pointwise and the pairwise. The pointwise approaches fit each sample with its label individually, which is flexible in weighting and sampling on instance-level but ignores the inherent ranking property. By qualitatively minimizing the relative score sn − sp, the pairwise approaches capture the ranking of samples naturally but suffer from training efficiency. Additionally, both approaches are hard to explicitly provide a personalized decision boundary to determine if users are interested in items unseen. To address those issues, we innovatively introduce an auxiliary score bu for each user to represent the User Interest Boundary(UIB) and individually penalize samples that cross the boundary with pairwise paradigms, i.e., the positive samples whose score is lower than bu and the negative samples whose score is higher than bu. In this way, our approach successfully achieves a hybrid loss of the pointwise and the pairwise to combine the advantages of both. Analytically, we show that our approach can provide a personalized decision boundary and significantly improve the training efficiency without any special sampling strategy. Extensive results show that our approach achieves significant improvements on not only the classical pointwise or pairwise models but also state-of-the-art models with complex loss function and complicated feature encoding.

References

[1]
Alejandro Bellogin, Javier Parapar, and Pablo Castells. 2013. Probabilistic collaborative filtering with negative cross entropy. In Proceedings of the 7th ACM conference on Recommender systems(RecSys ’13). Association for Computing Machinery, 387–390. https://doi.org/10.1145/2507157.2507191
[2]
Chris J.C. Burges, Tal Shaked, Erin Renshaw, Ari Lazier, Matt Deeds, Nicole Hamilton, and Greg Hullender. 2005. Learning to Rank using Gradient Descent. Technical Report MSR-TR-2005-06. https://www.microsoft.com/en-us/research/publication/learning-to-rank-using-gradient-descent/
[3]
Iván Cantador, Peter Brusilovsky, and Tsvi Kuflik. 2011. 2nd Workshop on Information Heterogeneity and Fusion in Recommender Systems (HetRec 2011). In Proceedings of the 5th ACM conference on Recommender systems (Chicago, IL, USA) (RecSys 2011). ACM, New York, NY, USA.
[4]
Chong Chen, Min Zhang, Yongfeng Zhang, Yiqun Liu, and Shaoping Ma. 2020. Efficient Neural Matrix Factorization without Sampling for Recommendation. ACM Trans. Inf. Syst. 38, 2, Article 14 (Jan. 2020), 28 pages. https://doi.org/10.1145/3373807
[5]
Paul Covington, Jay Adams, and Emre Sargin. 2016. Deep Neural Networks for YouTube Recommendations. In Proceedings of the 10th ACM Conference on Recommender Systems(RecSys ’16). Association for Computing Machinery, 191–198. https://doi.org/10.1145/2959100.2959190
[6]
Jingtao Ding, Yuhan Quan, Xiangnan He, Yong Li, and Depeng Jin. 2019. Reinforced Negative Sampling for Recommendation with Exposure Data. (2019), 2230–2236.
[7]
Jingtao Ding, Yuhan Quan, Quanming Yao, Yong Li, and Depeng Jin. 2020. Simplify and Robustify Negative Sampling for Implicit Collaborative Filtering. In NeurIPS. https://proceedings.neurips.cc/paper/2020/hash/0c7119e3a6a2209da6a5b90e5b5b75bd-Abstract.html
[8]
John Duchi, Elad Hazan, and Yoram Singer. 2011. Adaptive Subgradient Methods for Online Learning and Stochastic Optimization. Journal of Machine Learning Research 12, 61 (2011), 2121–2159.
[9]
Huifeng Guo, Ruiming Tang, Yunming Ye, Zhenguo Li, Xiuqiang He, and Zhenhua Dong. 2018. DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Prediction. CoRR abs/1804.04950(2018). arXiv:1804.04950http://arxiv.org/abs/1804.04950
[10]
F Maxwell Harper and Joseph A Konstan. 2015. The movielens datasets: History and context. Acm transactions on interactive intelligent systems (tiis) 5, 4(2015), 1–19.
[11]
Ruining He and Julian McAuley. 2016. Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filtering. In Proceedings of the 25th International Conference on World Wide Web(WWW ’16). International World Wide Web Conferences Steering Committee, 507–517. https://doi.org/10.1145/2872427.2883037
[12]
Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, YongDong Zhang, and Meng Wang. 2020. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR ’20). Association for Computing Machinery, 639–648. https://doi.org/10.1145/3397271.3401063
[13]
Xiangnan He, Zhankui He, Xiaoyu Du, and Tat-Seng Chua. 2018. Adversarial Personalized Ranking for Recommendation. In The 41st International ACM SIGIR Conference on Research & Development in Information Retrieval(SIGIR ’18). Association for Computing Machinery, 355–364. https://doi.org/10.1145/3209978.3209981
[14]
Xiangnan He, Lizi Liao, Hanwang Zhang, Liqiang Nie, Xia Hu, and Tat-Seng Chua. 2017. Neural Collaborative Filtering. In Proceedings of the 26th International Conference on World Wide Web(WWW ’17). International World Wide Web Conferences Steering Committee, 173–182. https://doi.org/10.1145/3038912.3052569
[15]
Cheng-Kang Hsieh, Longqi Yang, Yin Cui, Tsung-Yi Lin, Serge Belongie, and Deborah Estrin. 2017. Collaborative Metric Learning. In Proceedings of the 26th International Conference on World Wide Web. International World Wide Web Conferences Steering Committee, 193–201. https://doi.org/10.1145/3038912.3052639
[16]
Jae Kyeong Kim, Moon Kyoung Jang, Hyea Kyeong Kim, and Yoon Ho Cho. 2009. A hybrid recommendation procedure for new items using preference boundary. In Proceedings of the 11th International Conference on Electronic Commerce(ICEC ’09). Association for Computing Machinery, 289–295. https://doi.org/10.1145/1593254.1593298
[17]
Brian Kulis 2013. Metric learning: A survey. Foundations and Trends® in Machine Learning 5, 4(2013), 287–364.
[18]
Mingming Li, Shuai Zhang, Fuqing Zhu, Wanhui Qian, Liangjun Zang, Jizhong Han, and Songlin Hu. 2020. Symmetric Metric Learning with Adaptive Margin for Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence 34, 0404 (Apr 2020), 4634–4641. https://doi.org/10.1609/aaai.v34i04.5894
[19]
Huafeng Liu, Jingxuan Wen, Liping Jing, and Jian Yu. 2019. Deep generative ranking for personalized recommendation. In Proceedings of the 13th ACM Conference on Recommender Systems(RecSys ’19). Association for Computing Machinery, 34–42. https://doi.org/10.1145/3298689.3347012
[20]
Kachun Lo and Tsukasa Ishigaki. 2021. PPNW: personalized pairwise novelty loss weighting for novel recommendation. Knowledge and Information Systems 63, 5 (May 2021), 1117–1148. https://doi.org/10.1007/s10115-021-01546-8
[21]
Kelong Mao, Jieming Zhu, Jinpeng Wang, Quanyu Dai, Zhenhua Dong, Xi Xiao, and Xiuqiang He. 2021. SimpleX: A Simple and Strong Baseline for Collaborative Filtering. arXiv:2109.12613 [cs] (Sep 2021). http://arxiv.org/abs/2109.12613 arXiv:2109.12613.
[22]
Vitalik Melnikov, Eyke Hüllermeier, Daniel Kaimann, Bernd Frick, and Pritha Gupta. 2017. Pairwise versus Pointwise Ranking: A Case Study. Schedae Informaticae 1/2016 (2017). https://doi.org/10.4467/20838476SI.16.006.6187
[23]
Chanyoung Park, Donghyun Kim, Xing Xie, and Hwanjo Yu. 2018. Collaborative Translational Metric Learning. In 2018 IEEE International Conference on Data Mining (ICDM). 367–376. https://doi.org/10.1109/ICDM.2018.00052
[24]
Dae Hoon Park and Yi Chang. 2019. Adversarial Sampling and Training for Semi-Supervised Information Retrieval. In The World Wide Web Conference(WWW ’19). Association for Computing Machinery, 1443–1453. https://doi.org/10.1145/3308558.3313416
[25]
Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, and et al.2019. PyTorch: An Imperative Style, High-Performance Deep Learning Library. In Advances in Neural Information Processing Systems, Vol. 32. Curran Associates, Inc.https://proceedings.neurips.cc/paper/2019/hash/bdbca288fee7f92f2bfa9f7012727740-Abstract.html
[26]
Steffen Rendle and Christoph Freudenthaler. 2014. Improving pairwise learning for item recommendation from implicit feedback. In Proceedings of the 7th ACM international conference on Web search and data mining(WSDM ’14). Association for Computing Machinery, 273–282. https://doi.org/10.1145/2556195.2556248
[27]
Steffen Rendle and Christoph Freudenthaler. 2014. Improving pairwise learning for item recommendation from implicit feedback. In Proceedings of the 7th ACM international conference on Web search and data mining(WSDM ’14). Association for Computing Machinery, 273–282. https://doi.org/10.1145/2556195.2556248
[28]
Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian personalized ranking from implicit feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence(UAI’09). AUAI Press, 452–461.
[29]
Sumit Sidana, Mikhail Trofimov, Oleg Horodnitskii, Charlotte Laclau, Yury Maximov, and Massih-Reza Amini. 2021. Representation Learning and Pairwise Ranking for Implicit Feedback in Recommendation Systems. Data Mining and Knowledge Discovery 35, 2 (Mar 2021), 568–592. https://doi.org/10.1007/s10618-020-00730-8 arXiv:1705.00105.
[30]
Kun Song, Feiping Nie, Junwei Han, and Xuelong Li. 2017. Parameter Free Large Margin Nearest Neighbor for Distance Metric Learning. Proceedings of the AAAI Conference on Artificial Intelligence 31, 11 (Feb 2017). https://ojs.aaai.org/index.php/AAAI/article/view/10861
[31]
Yifan Sun, Changmao Cheng, Yuhan Zhang, Chi Zhang, Liang Zheng, Zhongdao Wang, and Yichen Wei. 2020. Circle Loss: A Unified Perspective of Pair Similarity Optimization. arXiv:2002.10857 [cs] (Jun 2020). http://arxiv.org/abs/2002.10857 arXiv:2002.10857.
[32]
Jun Wang, Lantao Yu, Weinan Zhang, Yu Gong, Yinghui Xu, Benyou Wang, Peng Zhang, and Dell Zhang. 2017. IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Models. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval(SIGIR ’17). Association for Computing Machinery, 515–524. https://doi.org/10.1145/3077136.3080786
[33]
Mengyue Yang, Quanyu Dai, Zhenhua Dong, Xu Chen, Xiuqiang He, and Jun Wang. 2021. Top-N Recommendation with Counterfactual User Preference Simulation. arXiv preprint arXiv:2109.02444(2021).
[34]
Lu Yu, Chuxu Zhang, Shichao Pei, Guolei Sun, and Xiangliang Zhang. 2018. WalkRanker: A Unified Pairwise Ranking Model With Multiple Relations for Item Recommendation. Proceedings of the AAAI Conference on Artificial Intelligence 32, 11 (Apr 2018). https://ojs.aaai.org/index.php/AAAI/article/view/11866
[35]
Yongqi Zhang, Quanming Yao, Yingxia Shao, and Lei Chen. 2019. NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embedding. In 2019 IEEE 35th International Conference on Data Engineering (ICDE). 614–625. https://doi.org/10.1109/ICDE.2019.00061
[36]
Xiaofei Zhou, Qiannan Zhu, Ping Liu, and Li Guo. 2017. Learning knowledge embeddings by combining limit-based scoring loss. In Proceedings of the 2017 ACM on Conference on Information and Knowledge Management. 1009–1018.

Cited By

View all
  • (2023)Augmented Negative Sampling for Collaborative FilteringProceedings of the 17th ACM Conference on Recommender Systems10.1145/3604915.3608811(256-266)Online publication date: 14-Sep-2023
  • (2023)Toward a Better Understanding of Loss Functions for Collaborative FilteringProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615086(2034-2043)Online publication date: 21-Oct-2023
  • (2022)DAS-GNN: Denoising autoencoder integrated with self-supervised learning in graph neural network-based recommendationsApplied Intelligence10.1007/s10489-022-04399-y53:14(17292-17309)Online publication date: 28-Dec-2022

Index Terms

  1. Learning Explicit User Interest Boundary for Recommendation
        Index terms have been assigned to the content through auto-classification.

        Recommendations

        Comments

        Information & Contributors

        Information

        Published In

        cover image ACM Conferences
        WWW '22: Proceedings of the ACM Web Conference 2022
        April 2022
        3764 pages
        ISBN:9781450390965
        DOI:10.1145/3485447
        This work is licensed under a Creative Commons Attribution International 4.0 License.

        Sponsors

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        Published: 25 April 2022

        Check for updates

        Author Tags

        1. Loss Function
        2. Recommender System
        3. User Interest Boundary

        Qualifiers

        • Research-article
        • Research
        • Refereed limited

        Conference

        WWW '22
        Sponsor:
        WWW '22: The ACM Web Conference 2022
        April 25 - 29, 2022
        Virtual Event, Lyon, France

        Acceptance Rates

        Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

        Contributors

        Other Metrics

        Bibliometrics & Citations

        Bibliometrics

        Article Metrics

        • Downloads (Last 12 months)261
        • Downloads (Last 6 weeks)13
        Reflects downloads up to 30 Aug 2024

        Other Metrics

        Citations

        Cited By

        View all
        • (2023)Augmented Negative Sampling for Collaborative FilteringProceedings of the 17th ACM Conference on Recommender Systems10.1145/3604915.3608811(256-266)Online publication date: 14-Sep-2023
        • (2023)Toward a Better Understanding of Loss Functions for Collaborative FilteringProceedings of the 32nd ACM International Conference on Information and Knowledge Management10.1145/3583780.3615086(2034-2043)Online publication date: 21-Oct-2023
        • (2022)DAS-GNN: Denoising autoencoder integrated with self-supervised learning in graph neural network-based recommendationsApplied Intelligence10.1007/s10489-022-04399-y53:14(17292-17309)Online publication date: 28-Dec-2022

        View Options

        View options

        PDF

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format.

        HTML Format

        Get Access

        Login options

        Media

        Figures

        Other

        Tables

        Share

        Share

        Share this Publication link

        Share on social media