Learning to Recommend With Multiple Cascading Behaviors
Open accessThe DOI matches its Crossref record, with a small difference in title or year; 57 of the 57 references it cites were found in a registry or an index.
Abstract
Most existing recommender systems leverage user behavior data of one type only, such as the purchase behavior in E-commerce that is directly related to the business Key Performance Indicator (KPI) of conversion rate. Besides the key behavioral data, we argue that other forms of user behaviors also provide valuable signal, such as views, clicks, adding a product to shopping carts and so on. They should be taken into account properly to provide quality recommendation for users. In this work, we contribute a new solution named short for Neural Multi-Task Recommendation (NMTR) for learning recommender systems from user multi-behavior data. We develop a neural network model to capture the complicated and multi-type interactions between users and items. In particular, our model accounts for the cascading relationship among different types of behaviors (e.g., a user must click on a product before purchasing it). To fully exploit the signal in the data of multiple types of behaviors, we perform a joint optimization based on the multi-task learning framework, where the optimization on a behavior is treated as a task. Extensive experiments on two real-world datasets demonstrate that NMTR significantly outperforms state-of-the-art recommender systems that are designed to learn from both single-behavior data and multi-behavior data. Further analysis shows that modeling multiple behaviors is particularly useful for providing recommendation for sparse users that have very few interactions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Adam: A Method for Stochastic Optimization
Kingma, D. P., & Ba, J. (2014) · arXiv · doi:10.48550/arxiv.1412.6980 · Cited by 98,946
Semi-supervised classification with graph convolutional networks
Kipf, T. N., & Welling, M. (2016) · arXiv · doi:10.48550/arxiv.1609.02907 · Cited by 24,853
Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classification
He, K., Zhang, X., Ren, S., & Sun, J. (2015) · 2015 IEEE International Conference on Computer Vision (ICCV) · doi:10.1109/iccv.2015.123 · Cited by 19,741
Representation Learning: A Review and New Perspectives
Bengio, Y., Courville, A., & Vincent, P. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2013.50 · Cited by 13,001
(2010) · Cited by 8,261
Neural Collaborative Filtering
He, X., Liao, L., Zhang, H., Nie, L., Hu, X., & Chua, T.-S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052569 · Cited by 6,652
Self-citationBPR: Bayesian Personalized Ranking from Implicit Feedback
Rendle, S., Freudenthaler, C., Gantner, Z., & Schmidt-Thieme, L. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1205.2618 · Cited by 4,242
Neural Graph Collaborative Filtering
Wang, X., He, X., Wang, M., Feng, F., & Chua, T.-S. (2019) · Proceedings of the 42nd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3331184.3331267 · Cited by 3,823
Self-citationGraph Convolutional Neural Networks for Web-Scale Recommender Systems
Ying, R., He, R., Chen, K., Eksombatchai, P., Hamilton, W. L., & Leskovec, J. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219890 · Cited by 3,733
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
Research works printed but not linked: 1
- ning, 2010, Multi-task learning for recommender system, Proc 12th ACM Conf Recommender Syst, 269
Cited by
Multi-behavior Recommendation with Graph Convolutional Networks
Jin, B., Gao, C., He, X., Jin, D., & Li, Y. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401072 · Cited by 415
Self-citationDenoising Implicit Feedback for Recommendation
Wang, W., Feng, F., He, X., Nie, L., & Chua, T.-S. (2021) · Proceedings of the 14th ACM International Conference on Web Search and Data Mining · doi:10.1145/3437963.3441800 · Cited by 290
Self-citationDeep Learning for Sequential Recommendation: Algorithms, Influential Factors, and Evaluations
Fang, H., Zhang, D., Shu, Y., & Guo, G. (2021) · ACM Transactions on Information Systems · doi:10.1145/3426723 · Cited by 287
Knowledge-Enhanced Hierarchical Graph Transformer Network for Multi-Behavior Recommendation
Xia, L., Huang, C., Xu, Y., Dai, P., Zhang, X., Yang, H., Pei, J., & Bo, L. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i5.16576 · Cited by 237
Contrastive Meta Learning with Behavior Multiplicity for Recommendation
Wei, W., Huang, C., Xia, L., Xu, Y., Zhao, J., & Yin, D. (2022) · Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3488560.3498527 · Cited by 210
Metadata
- Authors
- Gao, C., He, X., Gan, D., Chen, X., Feng, F., Li, Y., Chua, T.-S., Yao, L., Song, Y., & Jin, D.
- Affiliations
- Beijing National Research Center for Information Science and Technology (CN)
- University of Science and Technology of China (CN)
- Carnegie Mellon University (US)
- National University of Singapore (SG)
- UNSW Sydney (AU)
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2021-06-01
- Volume
- 33
- Issue
- 6
- Pages
- 2588-2601
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W2996623289
- Cited by
- 136
- References
- 57
- Citations by year
- 2026: 13 · 2025: 35 · 2024: 26 · 2023: 26 · 2022: 18 · 2021: 11
- FWCI
- 11.20
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- Locations
- IEEE Transactions on Knowledge and Data Engineering (publishedVersion)
- arXiv (Cornell University) (publishedVersion)
- arXiv (Cornell University)
- Funders
- National Key Research and Development Program of China (2018YFB1800804)
- National Natural Science Foundation of China (U1936217, 61971267, 61972223, 61941117, 61861136003)
- Beijing Natural Science Foundation (L182038)
- Beijing National Research Center for Information Science and Technology (20031887521)
- Tsinghua University - Tencent Joint Laboratory for Internet Innovation Technology
- Topics
- Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
- Physical Sciences › Computer Science › Information Systems › Information Retrieval and Search Behavior
- Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Keywords
- recommender systems, multi-task learning, user-item interactions, e-commerce recommendation
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning to Recommend With Multiple Cascading Behaviors. https://app.cochat.ai/papers/10.1109/tkde.2019.2958808
- The paper
- Gao, C., He, X., Gan, D., Chen, X., Feng, F., Li, Y., Chua, T.-S., Yao, L., Song, Y., & Jin, D. (2021). Learning to Recommend With Multiple Cascading Behaviors. IEEE Transactions on Knowledge and Data Engineering. https://doi.org/10.1109/tkde.2019.2958808
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.