The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Self-supervised Graph Learning for Recommendation
Open accessAbstract
Representation learning on user-item graph for recommendation has evolved from using single ID or interaction history to exploiting higher-order neighbors. This leads to the success of graph convolution networks (GCNs) for recommendation such as PinSage and LightGCN. Despite effectiveness, we argue that they suffer from two limitations: (1) high-degree nodes exert larger impact on the representation learning, deteriorating the recommendations of low-degree (long-tail) items; and (2) representations are vulnerable to noisy interactions, as the neighborhood aggregation scheme further enlarges the impact of observed edges.
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
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2018) · arXiv · doi:10.48550/arxiv.1810.04805 · Cited by 73,173
Distributed Representations of Words and Phrases and their Compositionality
Mikolov, T., Sutskever, I., Chen, K., Corrado, G., & Dean, J. (2013) · arXiv · doi:10.48550/arxiv.1310.4546 · Cited by 24,533
(2010) · Cited by 14,134
Momentum Contrast for Unsupervised Visual Representation Learning
He, K., Fan, H., Wu, Y., Xie, S., & Girshick, R. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.00975 · Cited by 13,347
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation
He, X., Deng, K., Wang, X., Li, Y., Zhang, Y., & Wang, M. (2020) · Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3397271.3401063 · Cited by 4,430
Self-citationALBERT: A Lite BERT for Self-supervised Learning of Language Representations
Lan, Z., Chen, M., Goodman, S., Gimpel, K., Sharma, P., & Soricut, R. (2019) · arXiv · doi:10.48550/arxiv.1909.11942 · Cited by 4,308
Factorization meets the neighborhood: a multifaceted collaborative filtering model
Koren, Y. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401944 · Cited by 3,852
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
Supervised Contrastive Learning
Khosla, P., Teterwak, P., Wang, C., Sarna, A., Tian, Y., Isola, P., Maschinot, A., Liu, C., & Krishnan, D. (2020) · arXiv · doi:10.48550/arxiv.2004.11362 · Cited by 3,569 · cited 1×
“It is worth mentioning that, our analyses are inspired by the prior study [24], but there are major differences: (1) [24] defines hard negatives as samples whose similarity are near-to-zero to the positive sample (i.”
MethodNoise-contrastive estimation: A new estimation principle for unnormalized statistical models
Gutmann, M. U., & Hyvärinen, A. (2010) · Edinburgh Research Explorer (University of Edinburgh) · Cited by 2,992
KGAT: Knowledge Graph Attention Network for Recommendation
Wang, X., He, X., Cao, Y., Liu, M., & Chua, T.-S. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330989 · Cited by 2,147
Self-citationTian, Y., Krishnan, D., & Isola, P. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58621-8_45 · Cited by 1,997
Variational Autoencoders for Collaborative Filtering
Liang, D., Krishnan, R. G., Hoffman, M. D., & Jebara, T. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186150 · Cited by 1,338
Knowledge Graph Convolutional Networks for Recommender Systems
Wang, H., Zhao, M., Xie, X., Li, W., & Guo, M. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313417 · Cited by 1,021
Self-citationGCC: Graph Contrastive Coding for Graph Neural Network Pre-Training
Qiu, J., Chen, Q., Dong, Y., Zhang, J., Yang, H., Ding, M., Wang, K., & Tang, J. (2020) · Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3394486.3403168 · Cited by 777
Bias and Debias in Recommender System: A Survey and Future Directions
Chen, J., Dong, H., Wang, X., Feng, F., Wang, M., & He, X. (2023) · ACM Transactions on Information Systems · doi:10.1145/3564284 · Cited by 741 · cited 1×
“Hence, the GCNs are easily biased towards high-degree items [5, 36], sacrificing the performance of low-degree (long-tail) items.”
BackgroundSelf-citationCao, Y., Wang, X., He, X., Hu, Z., & Chua, T.-S. (2019) · The World Wide Web Conference · doi:10.1145/3308558.3313705 · Cited by 630
Self-citationVideo suggestion and discovery for youtube: taking random walks through the view graph
Baluja, S., Seth, R., Sivakumar, D., Jing, Y., Yagnik, J., Kumar, S., Ravichandran, D., & Aly, M. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367618 · Cited by 443
Improving pairwise learning for item recommendation from implicit feedback
Rendle, S., & Freudenthaler, C. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556248 · Cited by 360
Denoising 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-citationOptimizing top-n collaborative filtering via dynamic negative item sampling
Zhang, W., Chen, T., Wang, J., & Yu, Y. (2013) · Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/2484028.2484126 · Cited by 256
A Generic Coordinate Descent Framework for Learning from Implicit Feedback
Bayer, I., He, X., Kanagal, B., & Rendle, S. (2017) · Proceedings of the 26th International Conference on World Wide Web · doi:10.1145/3038912.3052694 · Cited by 223
Self-citationParameter-Efficient Transfer from Sequential Behaviors for User Modeling and Recommendation
Yuan, F., He, X., Karatzoglou, A., & Zhang, L. (2020) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3397271.3401156 · Cited by 217
Self-citationPOG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashion
Chen, W., Huang, P., Xu, J., Guo, X., Guo, C., Sun, F., Li, C., Pfadler, A., Zhao, H., & Zhao, B. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330652 · Cited by 212
Investigating and Mitigating Degree-Related Biases in Graph Convoltuional Networks
Tang, X., Yao, H., Sun, Y., Wang, Y., Tang, J., Aggarwal, C. C., Mitra, P., & Wang, S. (2020) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/3340531.3411872 · Cited by 201
Power law distributions in information science: Making the case for logarithmic binning
Milojević, S. (2010) · Journal of the American Society for Information Science and Technology · doi:10.1002/asi.21426 · Cited by 132
Semi-supervised User Profiling with Heterogeneous Graph Attention Networks
Chen, W., Gu, Y., Ren, Z., He, X., Xie, H., Guo, T., Yin, D., & Zhang, Y. (2019) · International Joint Conference on Artificial Intelligence · doi:10.24963/ijcai.2019/293 · Cited by 101
Self-citationContext-Aware Friend Recommendation for Location Based Social Networks using Random Walk
Bagci, H., & Karagöz, P. (2016) · International World Wide Web Conference (WWW) · doi:10.1145/2872518.2890466 · Cited by 71
Cited by
A Survey of Graph Neural Networks for Recommender Systems: Challenges, Methods, and Directions
Gao, C., Zheng, Y., Li, N., Li, Y., Qin, Y., Piao, J., Quan, Y., Chang, J., Jin, D., He, X., et al. (2023) · ACM Transactions on Recommender Systems · doi:10.1145/3568022 · Cited by 1,082
Self-citationAre Graph Augmentations Necessary?: Simple Graph Contrastive Learning for Recommendation
Yu, J., Yin, H., Xia, X., Chen, T., Cui, L., & Nguyen, Q. V. H. (2022) · Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3477495.3531937 · Cited by 664
Contrastive Learning for Sequential Recommendation
Xie, X., Sun, F., Liu, Z., Wu, S., Gao, J., Zhang, J., Ding, B., & Cui, B. (2022) · 2022 IEEE 38th International Conference on Data Engineering (ICDE) · doi:10.1109/icde53745.2022.00099 · Cited by 663
Self-citationImproving Graph Collaborative Filtering with Neighborhood-enriched Contrastive Learning
Lin, Z., Tian, C., Hou, Y., & Zhao, W. X. (2022) · Proceedings of the ACM Web Conference 2022 · doi:10.1145/3485447.3512104 · Cited by 572
Hypergraph Contrastive Collaborative Filtering
Xia, L., Huang, C., Xu, Y., Zhao, J., Yin, D., & Huang, J. (2022) · Proceedings of the 45th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3477495.3532058 · Cited by 445
Metadata
- Authors
- Wu, J., Wang, X., Feng, F., He, X., Chen, L., Lian, J., & Xie, X.
- Venue
- Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval
- Publisher
- ACM
- Published
- 2021-07-11
- Pages
- 726-735
- OpenAlex
- W3094605801
- Cited by
- 1,488
- References
- 30
- FWCI
- 179.10
- Type
- conference paper
- Language
- en
- Open access
- green
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
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.