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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

PDPBoost: An XGBoost-Based Method for Predicting Programming Problem Difficulty

Yonghao Yan, Zhiyuan Wang, Linna Wang, Zhigao Liang et al.
Software System Performance and Reliability
article

PDPBoost: An XGBoost-Based Method for Predicting Programming Problem Difficulty

Yonghao Yan, Zhiyuan Wang, Linna Wang, Zhigao Liang, Bin Dai, Siyang Kong
article en

Abstract

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.

Beijing Polytechnic (CN)
Openalex Percentile: Top 81%
Software System Performance and Reliability
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

PDPBoost: An XGBoost-Based Method for Predicting Programming Problem Difficulty — Yonghao Yan, Zhiyuan Wang, et al. · (2025) | TGRS Research Map | TGRS