PDPBoost: An XGBoost-Based Method for Predicting Programming Problem Difficulty
With the increasing demand for programming skills across various industries, Online Judge platforms have become essential for improving programming proficiency. However, selecting appropriately challenging problems is key to effective adaptive learning on these platforms. Existing methods for determining problem difficulty face limitations: traditional approaches are constrained by subjectivity and inefficiency, while current deep-learning-based models struggle with interpretability and require extensive training time. In this paper, we propose PDPBoost, a novel method utilizing XGBoost models to Predict the Difficulty of Programming problems. Our method combines dense and sparse feature extraction with ensemble learning to improve prediction accuracy, speed, and model interpretability. Experimental evaluations on two real-world datasets demonstrate the superiority of our approach in both predictive performance and computational efficiency.
Authors
- Yonghao Yan
- Zhiyuan Wang (ORCID: https://orcid.org/0000-0001-6986-9589)
- Linna Wang (ORCID: https://orcid.org/0000-0003-3950-126X)
- Zhigao Liang
- Bin Dai (ORCID: https://orcid.org/0000-0003-3507-1901)
- Siyang Kong
Institutions
- Beijing Polytechnic (CN)
Publication Details
- Published
- 2025-04-18
- DOI
- https://doi.org/10.1109/icccs65393.2025.11069556
- Primary Topic
- Software System Performance and Reliability
- Type
- article
- Field-Weighted Citation Impact
- 0.00