PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
April 12, 2026GAZI UNIVERSITY JOURNAL OF SCIENCE0 citationsOpen Access

Predicting Student Success in Distance Education Utilizing Soft Matrix-Based Machine Learning via Moodle and Student Information Systems Data

SMSamet MemişSFSema Yılmaz Fatik

Key Points

  • This research aims to predict student success in distance education courses using participation data and machine learning algorithms.
  • Collected anonymized participation data over 14 weeks from students taking specific courses.
  • Created datasets for binary (pass/fail) and multi-class (letter grades) classifications.
  • Applied fuzzy parameterized fuzzy soft k-nearest neighbor (FPFS-kNN) and other machine learning algorithms to the datasets.
  • Evaluated performance using metrics such as accuracy, precision, recall, and F1-scores.
  • FPFS-kNN achieved highest accuracy in binary pass-fail classification among the algorithms tested.
  • In multi-class problems, Boosted Tree performed best in terms of F1-score, but FPFS-kNN maintained strong and stable results.
  • Overall, FPFS-kNN was identified as highly effective for binary classification, suggesting its potential in educational settings.

Abstract

Machine learning has become an important tool for predicting student performance. This paper aims to create a dataset of the participation of some students who took Turkish Language, Atatürk’s Principles and History of Revolution, and English joint courses given via distance education at Istanbul Arel University to synchronous and asynchronous course activities for 14 weeks, and to predict the students’ success by employing fuzzy parameterized fuzzy soft k-nearest neighbor (FPFS-kNN) and the dataset. First, anonymized participation data from a 14-week lecture period is collected. Later, these data are processed to be used in machine learning. Two data sets are obtained from each raw dataset, whose class labels consist of two classes (pass/fail) and multi-class (letter grades). Then, FPFS-kNN and well-known/state-of-the-art machine learning algorithms are applied to the datasets. The performance results are compared using accuracy (Acc), precision (Pre), recall (Rec), macro F1-score (MacF1), and micro F1-score (MicF1) performance metrics. The results show that FPFS-kNN outperforms the other algorithms in binary pass–fail classification, achieving the highest accuracy with (ING1), (ATA1), and (TDE1), while maintaining competitive F1-scores (up to on TDE1). In the letter-grades datasets, performance decreased overall, with Boosted Tree reaching the best MicF1 ( on TDE2), yet FPFS-kNN still produced strong and stable results ( on TDE2, on ATA2). These findings indicate that FPFS-kNN is highly effective in binary classification and competitive in multi-class problems. Finally, a discussion of performance results and the use of machine learning in predicting student achievement is provided.Machine learning has become an important tool for predicting student performance. This paper aims to create a dataset of the participation of some students who took Turkish Language, Atatürk’s Principles and History of Revolution, and English joint courses given via distance education at Istanbul Arel University to synchronous and asynchronous course activities for 14 weeks, and to predict the students’ success by employing fuzzy parameterized fuzzy soft k-nearest neighbor (FPFS-kNN) and the dataset. First, anonymized participation data from a 14-week lecture period is collected. Later, these data are processed to be used in machine learning. Two data sets are obtained from each raw dataset, whose class labels consist of two classes (pass/fail) and multi-class (letter grades). Then, FPFS-kNN and well-known/state-of-the-art machine learning algorithms are applied to the datasets. The performance results are compared using accuracy (Acc), precision (Pre), recall (Rec), macro F1-score (MacF1), and micro F1-score (MicF1) performance metrics. The results show that FPFS-kNN outperforms the other algorithms in binary pass–fail classification, achieving the highest accuracy with (ING1), (ATA1), and (TDE1), while maintaining competitive F1-scores (up to on TDE1). In the letter-grades datasets, performance decreased overall, with Boosted Tree reaching the best MicF1 ( on TDE2), yet FPFS-kNN still produced strong and stable results ( on TDE2, on ATA2). These findings indicate that FPFS-kNN is highly effective in binary classification and competitive in multi-class problems. Finally, a discussion of performance results and the use of machine learning in predicting student achievement is provided.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

Memiş et al. (2026) studied this question.

synapsesocial.com/papers/69db37044fe01fead37c505dhttps://doi.org/10.35378/gujs.1597731
Ask AI
Helpful
Bookmark
Share
View Full Paper