Zheng Ju
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Zheng Ju has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Aonghus Lawlor
University College Dublin, Dublin, Ireland
3 shared publications - Elias Tragos
University College Dublin
3 shared publications - Neil Hurley
INSIGHT Centre for Data Analytics, University College Dublin, Dublin, Ireland
3 shared publications - Honghui Du
University College Dublin, Dublin, Ireland
2 shared publications - Diarmuid O'REilly Morgan
University College Dublin
1 shared publication - Qinqin Wang
INSIGHT Centre for Data Analytics, University College Dublin, Dublin, Ireland
1 shared publication
Latest Publications
- Open Access
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1170-1174
Transfer Learning via User-Item Graph Convolution for Enhanced Cross-Domain Recommendation
- 21 February 2026
- Published by Association for Computing Machinery (ACM)
- p. 1170-1174
Open AccessTransfer Learning via User-Item Graph Convolution for Enhanced Cross-Domain Recommendation
- 4 April 2025
- Published by Springer Nature
- p. 246-254
DiffGR: A Discrete Diffusion-Based Model for Personalised Recommendation by Reconstructing User-Item Bipartite Graphs
- 4 April 2025
- Published by Springer Nature
- p. 246-254
DiffGR: A Discrete Diffusion-Based Model for Personalised Recommendation by Reconstructing User-Item Bipartite Graphs
- Open Access
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1152-1157
Exploring Coresets for Efficient Training and Consistent Evaluation of Recommender Systems
Recommender systems have achieved remarkable success in various web applications, such as e-commerce, online advertising, and social media, harnessing the power of big data. To attain optimal model performance, recommender systems are typically trained on very large datasets, with substantial numbers of users and items. However, large datasets often present challenges in terms of processing time and computational resources. Coreset selection offers a method for obtaining a reduced yet representative subset from vast datasets, thereby enhancing the efficiency of training machine learning algorithms. Nevertheless, little research has been conducted to explore the practical implications of different coreset selection approaches on the performance of recommender systems algorithms. In this paper, we systematically investigate the impact of various coreset selection techniques. We evaluate the performance of the resulting coresets using inductive recommendation models which allow for consistent evaluations to be performed. The experimental results demonstrate that coreset methods are a powerful and useful approach for obtaining reduced datasets which preserve the properties of the large original dataset and have competitive performance compared to the time required to train with the full dataset.
- 8 October 2024
- Published by Association for Computing Machinery (ACM)
- p. 1152-1157
Open AccessExploring Coresets for Efficient Training and Consistent Evaluation of Recommender Systems
Recommender systems have achieved remarkable success in various web applications, such as e-commerce, online advertising, and social media, harnessing the power of big data. To attain optimal model performance, recommender systems are typically trained on very large datasets, with substantial numbers of users and items. However, large datasets often present challenges in terms of processing time and computational resources. Coreset selection offers a method for obtaining a reduced yet representative subset from vast datasets, thereby enhancing the efficiency of training machine learning algorithms. Nevertheless, little research has been conducted to explore the practical implications of different coreset selection approaches on the performance of recommender systems algorithms. In this paper, we systematically investigate the impact of various coreset selection techniques. We evaluate the performance of the resulting coresets using inductive recommendation models which allow for consistent evaluations to be performed. The experimental results demonstrate that coreset methods are a powerful and useful approach for obtaining reduced datasets which preserve the properties of the large original dataset and have competitive performance compared to the time required to train with the full dataset.