Big Data-Driven Precision Strategy Generation for College Admissions Using Gradient Boosted Decision Trees (GBDT)

As the scale of higher education enrollment expands and the complexity of enrollment decisions increases, traditional enrollment strategies have significant deficiencies in data analysis accuracy and resource allocation efficiency. This study proposes an enrollment data analysis and precise strategy generation system based on gradient boosting decision tree (GBDT) to solve the problem of insufficient data-driven decision-making in enrollment practice. By analyzing five years of enrollment data, the study used the GBDT model to achieve automatic screening and accurate prediction of high-dimensional variables. Experimental results show that the GBDT model is significantly better than the random forest and support vector machine models in performance indicators such as prediction accuracy, F1 score and AUC value, demonstrating excellent classification capabilities and high computational efficiency. Based on the model output, a number of optimization strategies were developed, including measures such as professional recommendation and regional enrollment focus adjustment. These strategies increased the overall enrollment success rate from 75% to 85%, significantly optimizing resource allocation efficiency and decision-making quality. The research innovation of this article is to combine the GBDT model to identify key variables and generate precise strategies, and to prove its practical application value in the field of higher education enrollment through experiments.

Authors

Publication Details

Published
2025-03-28
DOI
https://doi.org/10.1145/3745238.3745390
Primary Topic
Online Learning and Analytics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Big Data-Driven Precision Strategy Generation for College Admissions Using Gradient Boosted Decision Trees (GBDT)

Ziya Tan
Online Learning and Analytics
article

Big Data-Driven Precision Strategy Generation for College Admissions Using Gradient Boosted Decision Trees (GBDT)

Ziya Tan
article en

Abstract

As the scale of higher education enrollment expands and the complexity of enrollment decisions increases, traditional enrollment strategies have significant deficiencies in data analysis accuracy and resource allocation efficiency. This study proposes an enrollment data analysis and precise strategy generation system based on gradient boosting decision tree (GBDT) to solve the problem of insufficient data-driven decision-making in enrollment practice. By analyzing five years of enrollment data, the study used the GBDT model to achieve automatic screening and accurate prediction of high-dimensional variables. Experimental results show that the GBDT model is significantly better than the random forest and support vector machine models in performance indicators such as prediction accuracy, F1 score and AUC value, demonstrating excellent classification capabilities and high computational efficiency. Based on the model output, a number of optimization strategies were developed, including measures such as professional recommendation and regional enrollment focus adjustment. These strategies increased the overall enrollment success rate from 75% to 85%, significantly optimizing resource allocation efficiency and decision-making quality. The research innovation of this article is to combine the GBDT model to identify key variables and generate precise strategies, and to prove its practical application value in the field of higher education enrollment through experiments.

Openalex Percentile: Top 80%
Online Learning and Analytics
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.