The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
STAR-GCN: Stacked and Reconstructed Graph Convolutional Networks for Recommender Systems
Open accessAbstract
We propose a new STAcked and Reconstructed Graph Convolutional Networks (STAR-GCN) architecture to learn node representations for boosting the performance in recommender systems, especially in the cold start scenario. STAR-GCN employs a stack of GCN encoder-decoders combined with intermediate supervision to improve the final prediction performance. Unlike the graph convolutional matrix completion model with one-hot encoding node inputs, our STAR-GCN learns low-dimensional user and item latent factors as the input to restrain the model space complexity. Moreover, our STAR-GCN can produce node embeddings for new nodes by reconstructing masked input node embeddings, which essentially tackles the cold start problem. Furthermore, we discover a label leakage issue when training GCN-based models for link prediction tasks and propose a training strategy to avoid the issue. Empirical results on multiple rating prediction benchmarks demonstrate our model achieves state-of-the-art performance in four out of five real-world datasets and significant improvements in predicting ratings in the cold start scenario. The code implementation is available in https://github.com/jennyzhang0215/STAR-GCN.
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
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
BERT: Pre-training of Deep Bidirectional Transformers for Language Understanding
Devlin, J., Chang, M.-W., Lee, K., & Toutanova, K. (2019) · Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers) · doi:10.18653/v1/n19-1423 · Cited by 54,325
Glove: Global Vectors for Word Representation
Pennington, J., Socher, R., & Manning, C. (2014) · Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.3115/v1/d14-1162 · Cited by 34,071
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
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
Veličković, P., Casanova, A., Liò, P., Cucurull, G., Romero, A., & Bengio, Y. (2017) · arXiv (Cornell University) · doi:10.17863/cam.48429 · Cited by 8,657
Modeling Relational Data with Graph Convolutional Networks
Schlichtkrull, M., Kipf, T. N., Bloem, P., van den Berg, R., Titov, I., & Welling, M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93417-4_38 · Cited by 5,570
Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks
Silva, G., Rodrigues, M., Teixeira, A., & Amorim, M. (2024) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.sea.2024.20 · Cited by 5,183
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Advances In Deep Learning On Graphs (Gsp'18 Workshop)
Defferrard, M. (2016) · Figshare · doi:10.5281/zenodo.1286817 · Cited by 4,613
Geometric Deep Learning: Going beyond Euclidean data
Bronstein, M. M., Bruna, J., LeCun, Y., Szlam, A., & Vandergheynst, P. (2017) · IEEE Signal Processing Magazine · doi:10.1109/msp.2017.2693418 · Cited by 3,661
Collaborative Deep Learning for Recommender Systems
Wang, H., Wang, N., & Yeung, D.-Y. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783273 · Cited by 1,657
Identifying Resilient Communities in Road Networks: A Path-Based Embedding Approach
Wagner, C., Dodge, S., & Alizadeh, D. (2025) · Leibniz international proceedings in informatics · doi:10.4230/lipics.giscience.2025.9 · Cited by 1,543
Graph Convolutional Matrix Completion
van den Berg, R., Kipf, T., & Welling, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1706.02263 · Cited by 1,023
DropoutNet: Addressing Cold Start in Recommender Systems
Volkovs, M., Yu, G. W., & Poutanen, T. (2017) · neural information processing systems · Cited by 463
STELLAR: Spatial-Temporal Latent Ranking for Successive Point-of-Interest Recommendation
Zhao, S., Zhao, T., Yang, H., Lyu, M., & King, I. (2016) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v30i1.9986 · Cited by 241
Self-citationGeometric Matrix Completion with Recurrent Multi-Graph Neural Networks
Monti, F., Bronstein, M. M., & Bresson, X. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.06803 · Cited by 235
Neural Network Matrix FactorizationPreprint
Dziugaite, G. K., & Roy, D. M. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1511.06443 · Cited by 216
Collaborative filtering with graph information: consistency and scalable methods
Rao, N., Yu, H., Ravikumar, P., & Dhillon, I. S. (2015) · Cited by 201
A Neural Autoregressive Approach to Collaborative FilteringPreprint
Zheng, Y., Tang, B., Ding, W., & Zhou, H. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.09477 · Cited by 183
Machine Learning for Spatiotemporal Sequence Forecasting: A SurveyPreprint
Shi, X., & Yeung, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1808.06865 · Cited by 148
Self-citationDeep Models of Interactions Across Sets
Hartford, J., Graham, D. R., Leyton‐Brown, K., & Ravanbakhsh, S. (2018) · Research Explorer (The University of Manchester) · doi:10.48550/arxiv.1803.02879 · Cited by 101
Difficulty Controllable Question Generation for Reading Comprehension.Preprint
Gao, Y., Wang, J., Bing, L., King, I., & Lyu, M. R.-T. (2018) · arXiv (Cornell University) · Cited by 17
Self-citationLearning to Rank Using Localized Geometric Mean Metrics
Su, Y., King, I., & Lyu, M. R.-T. (2017) · International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR) · doi:10.1145/3077136.3080828 · Cited by 8
Self-citationChen, T., Wang, Z., Li, L., Li, D., Li, Z., Chang, X., Bian, P., Liang, G., Wang, Q., & Xie, T. (2025) · Schloss Dagstuhl – Leibniz-Zentrum für Informatik · doi:10.4230/lipics.ecoop.2025.6
Cited by
Graph Neural Networks in Recommender Systems: A Survey
Wu, S., Sun, F., Zhang, W., Xie, X., & Cui, B. (2023) · ACM Computing Surveys · doi:10.1145/3535101 · Cited by 1,326
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
MAGNN: Metapath Aggregated Graph Neural Network for Heterogeneous Graph Embedding
Fu, X., Zhang, J., Meng, Z., & King, I. (2020) · Proceedings of The Web Conference 2020 · doi:10.1145/3366423.3380297 · Cited by 976
Self-citationDiffNet++: A Neural Influence and Interest Diffusion Network for Social Recommendation
Wu, L., Li, J., Sun, P., Hong, R., Ge, Y., & Wang, M. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.3048414 · Cited by 373
A federated graph neural network framework for privacy-preserving personalization
Wu, C., Wu, F., Lyu, L., Qi, T., Huang, Y., & Xie, X. (2022) · Nature Communications · doi:10.1038/s41467-022-30714-9 · Cited by 311
Metadata
- Authors
- Zhang, J., Shi, X., Zhao, S., & King, I.
- Venue
- Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence
- Published
- 2019-08
- Pages
- 4264-4270
- OpenAlex
- W2966750432
- Cited by
- 257
- References
- 27
- FWCI
- 24.66
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.