Checklist ONIA 2026 Local Stage · Task 2
Analysis and Classification of Churn in Telecommunications Services
Romanian title: Analiza și clasificarea churn-ului în servicii de telecomunicații
Compute two rule-based customer scores and predict customer churn for a telecommunications operator.
The task
Churn is the voluntary abandonment of an operator's services. The dataset describes customers through demographics, contract and payment data, subscribed services, charges and network-quality indicators (Ping Score, Avg Speed, Link Quality Index), with the target Churn (1 = left).
Task 1 asks for FinancialRiskScore = (Monthly Charge > 70) + (Total Extra Data Charges > 10) and task 2 for ServiceQualityScore = (Avg Speed < 50) + (Ping Score > 80) + (Link Quality Index < 30) for every test customer. Task 3 asks for a 0/1 churn prediction for every test customer.
Abridged and translated by SOTA from the official Romanian materials. The official statement has the exact rules, and it wins wherever this summary differs.
At a glance
- You get
train.csv(5,634 rows, 54 columns including Churn),test.csv(1,409 rows, without Churn) andsample_output.csv. Archive of 866,787 bytes.- You submit
submission.csvwith id (SampleID), subtaskID (1–3) and answer.- Scoring
- Tasks 1 and 2 (20 points each): exact match. Task 3 (60 points): ROC AUC; 0 points at AUC ≤ 0.70, full marks at AUC ≥ 0.85 (grades 9–10) or AUC ≥ 0.90 (grades 11–12), proportional in between.
- Rules
- Online, 14 February 2026, 10:00–16:00 (Europe/Bucharest); may be taken from home
- Mandatory full-screen OBS recording, shared via Google Drive within 8 hours of the end
- Only the listed documentation sites may be opened (NumPy, scikit-learn, OpenCV, Python, pandas, Matplotlib, seaborn, PyTorch, SciPy, CatBoost, Joblib); the approved-imports list applies
- Jupyter, PyCharm or VS Code with AI code completion disabled; Google Colab allowed at this stage
- Qualification to the county stage requires at least 60% of the total score
- Format
- ONIA 2026 local stage (both sections), 14 February 2026.