Improvements to the Apriori Algorithm and Its Application in Educational Decision-Making Systems

The Apriori algorithm is among the traditional algorithms that are mainly employed to mine the educational data. Regrettably, the Apriori algorithm is not only the most classical algorithm, but also has some weaknesses, for instance, it has high computational complexity, generates too many candidate itemsets, which in turn leads it to be mainly used in small-scale educational data scenarios only. In this paper, the authors propose a modified version of the Apriori algorithm which aims to the rule generation process and the computational operation more efficient through data preprocessing phase information improvement and using the dynamic thresholding adjusting component as well as a not-so-well-known intelligent technique. The usefulness of the improved algorithm is tested by an experiment with actual course performance assessments, and the algorithm is also applied in the educational decision support system which comprises the course recommendation, teaching strategy optimization, and academic risk prediction the students. The results of the study suggest that there are no gains in script execution speed, generalization rate, or memory usage while there are with great advantage in the run time of the proposed algorithm. Consequently, the proposed algorithm is superior to the traditional one as it provides higher efficiency and thus, could be the best choice for educational data mining.

Authors

Institutions

Publication Details

Published
2025-02-21
DOI
https://doi.org/10.1145/3728725.3728784
Primary Topic
Advanced Technologies in Various Fields
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Improvements to the Apriori Algorithm and Its Application in Educational Decision-Making Systems

Wang Li
Advanced Technologies in Various Fields
article

Improvements to the Apriori Algorithm and Its Application in Educational Decision-Making Systems

Wang Li
article en

Abstract

The Apriori algorithm is among the traditional algorithms that are mainly employed to mine the educational data. Regrettably, the Apriori algorithm is not only the most classical algorithm, but also has some weaknesses, for instance, it has high computational complexity, generates too many candidate itemsets, which in turn leads it to be mainly used in small-scale educational data scenarios only. In this paper, the authors propose a modified version of the Apriori algorithm which aims to the rule generation process and the computational operation more efficient through data preprocessing phase information improvement and using the dynamic thresholding adjusting component as well as a not-so-well-known intelligent technique. The usefulness of the improved algorithm is tested by an experiment with actual course performance assessments, and the algorithm is also applied in the educational decision support system which comprises the course recommendation, teaching strategy optimization, and academic risk prediction the students. The results of the study suggest that there are no gains in script execution speed, generalization rate, or memory usage while there are with great advantage in the run time of the proposed algorithm. Consequently, the proposed algorithm is superior to the traditional one as it provides higher efficiency and thus, could be the best choice for educational data mining.

Shandong Institute of Commerce & Technology (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 94%
Advanced Technologies in Various Fields
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.