scholarly journals Student Academic Performance Prediction using Supervised Learning Techniques

2019 ◽  
Vol 14 (14) ◽  
pp. 92 ◽  
Author(s):  
Muhammad Imran ◽  
Shahzad Latif ◽  
Danish Mehmood ◽  
Muhammad Saqlain Shah
Keyword(s):  
Data Mining ◽  
Supervised Learning ◽  
Student Performance ◽  
Performance Prediction ◽  
Class Imbalance ◽  
Ensemble Methods ◽  
Fine Tuning ◽  
Classification Error ◽  
Decision Tree Classifier ◽  
Tree Classifier

Automatic Student performance prediction is a crucial job due to the large volume of data in educational databases. This job is being addressed by educational data mining (EDM). EDM develop methods for discovering data that is derived from educational environment. These methods are used for understanding student and their learning environment. The educational institutions are often curious that how many students will be pass/fail for necessary arrangements. In previous studies, it has been observed that many researchers have intension on the selection of appropriate algorithm for just classification and ignores the solutions of the problems which comes during data mining phases such as data high dimensionality ,class imbalance and classification error etc. Such types of problems reduced the accuracy of the model. Several well-known classification algorithms are applied in this domain but this paper proposed a student performance prediction model based on supervised learning decision tree classifier. In addition, an ensemble method is applied to improve the performance of the classifier. Ensemble methods approach is designed to solve classification, predictions problems. This study proves the importance of data preprocessing and algorithms fine-tuning tasks to resolve the data quality issues. The experimental dataset used in this work belongs to Alentejo region of Portugal which is obtained from UCI Machine Learning Repository. Three supervised learning algorithms (J48, NNge and MLP) are employed in this study for experimental purposes. The results showed that J48 achieved highest accuracy 95.78% among others.

scholarly journals Student Performance Predictions Using Knowledge Discovery Database and Data Mining, DPU Students Records as Sample

2021 ◽  
Vol 10 (3) ◽  
pp. 121-127
Author(s):  
Bareen Haval ◽  
Karwan Jameel Abdulrahman ◽  
Araz Rajab
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Student Performance ◽  
Educational Data Mining ◽  
Data Sets ◽  
Decision Tree Classifier ◽  
Data Mining Techniques ◽  
Academic History ◽  
Tree Classifier ◽  
Using Data

This article presents the results of connecting an educational data mining techniques to the academic performance of students. Three classification models (Decision Tree, Random Forest and Deep Learning) have been developed to analyze data sets and predict the performance of students. The projected submission of the three classificatory was calculated and matched. The academic history and data of the students from the Office of the Registrar were used to train the models. Our analysis aims to evaluate the results of students using various variables such as the student's grade. Data from (221) students with (9) different attributes were used. The results of this study are very important, provide a better understanding of student success assessments and stress the importance of data mining in education. The main purpose of this study is to show the student successful forecast using data mining techniques to improve academic programs. The results of this research indicate that the Decision Tree classifier overtakes two other classifiers by achieving a total prediction accuracy of 97%.

scholarly journals Using T3, an Improved Decision Tree Classifier, for Mining Stroke-related Medical Data

2007 ◽  
Vol 46 (05) ◽  
pp. 523-529 ◽  
Author(s):  
M. Saraee ◽  
B. Theodoulidis ◽  
J. A. Keane ◽  
C. Tjortjis
Keyword(s):  
Data Mining ◽  
Decision Tree ◽  
Predictive Models ◽  
Medical Data ◽  
Classification Algorithm ◽  
Medical Decision ◽  
Classification Error ◽  
Decision Tree Classifier ◽  
Data Set ◽  
Tree Classifier

Summary Objectives: Medical data are a valuable resource from which novel and potentially useful knowledge can be discovered by using data mining. Data mining can assist and support medical decision making and enhance clinical managementand investigative research. The objective of this work is to propose a method for building accurate descriptive and predictive models based on classification of past medical data. We also aim to compare this method with other well established data mining methods and identify strengths and weaknesses. Method: We propose T3, a decision tree classifier which builds predictive models based on known classes, by allowing for a certain amount of misclassification error in training in order to achieve better descriptive and predictive accuracy. We then experiment with a real medical data set on stroke, and various subsets, in order to identify strengths and weaknesses. We also compare performance with a very successful and well established decision tree classifier. Results: T3 demonstrated impressive performance when predicting unseen cases of stroke resulting in as little as 0.4% classification error while the state of the art decision tree classifier resulted in 33.6% classification error respectively. Conclusions: This paper presents and evaluates T3, a classification algorithm that builds decision trees of depth at most three, and results in high accuracy whilst keeping the tree size reasonably small. T3 demonstrates strong descriptive and predictive power without compromising simplicity and clarity. We evaluate T3 based on real stroke register data and compare it with C4.5, a well-known classification algorithm, showing that T3 produces significantly more accurate and readable classifiers.

scholarly journals Applicability of Traditional Classification Techniques on Educational Data

2020 ◽  
Vol 8 (6) ◽  
pp. 1672-1677
Keyword(s):  
Data Mining ◽  
Pilot Study ◽  
Decision Tree ◽  
Student Performance ◽  
Performance Prediction ◽  
Nearest Neighbor ◽  
Class Imbalance ◽  
Classification Techniques ◽  
Statistical Measures ◽  
Traditional Classification

Student performance prediction and analysis is an essential part of higher educational institutions, which helps in overall betterment of the educational system. Various traditional Data Mining (DM) techniques like Regression, Classification, etc. are prominently utilized for analyzing the data coming from educational settings. The usage of DM in the area of academics is called Educational Data Mining (EDM). The current pilot study aims to determine the applicability of these standalone classification techniques namely; Decision Tree, BayesNet, Nearest Neighbor, Rule-Based, and Random Forest (RF). The present pilot study uses the WEKA tool to implement traditional classification techniques on a standard dataset containing student academic information and background. The paper also implements feature selection to identify the high influential features from the dataset. It helps in reducing the dimensionality of the dataset as well as enhancing the accuracy of the classifier. The results of classifiers are compared on basis of standard statistical measures like Mean Absolute Error (MAE), Root Mean Square Error (RMSE), and Kappa, etc. The results show the applicability of classification algorithms for student performance prediction which will help under-achievers and struggling students to improve. It is found the output that, J48 algorithm of the Decision tree gave the best results. Further, it is deduced from the comparative analysis that individual classifiers give different accuracy on the same dataset due to class imbalance in a multiclass dataset.

Data Mining: A Bagged Decision Tree Classifier Algorithm For Ids Intrusion Detection System Based Attacks Classification

2021 ◽  
pp. 1826-1839
Author(s):  
Sandeep Adhikari, Dr. Sunita Chaudhary
Keyword(s):  
Data Mining ◽  
Intrusion Detection ◽  
Decision Tree ◽  
Intrusion Detection System ◽  
Detection System ◽  
Large Data ◽  
Large Data Sets ◽  
Data Sets ◽  
Decision Tree Classifier ◽  
Tree Classifier

The exponential growth in the use of computers over networks, as well as the proliferation of applications that operate on different platforms, has drawn attention to network security. This paradigm takes advantage of security flaws in all operating systems that are both technically difficult and costly to fix. As a result, intrusion is used as a key to worldwide a computer resource's credibility, availability, and confidentiality. The Intrusion Detection System (IDS) is critical in detecting network anomalies and attacks. In this paper, the data mining principle is combined with IDS to efficiently and quickly identify important, secret data of interest to the user. The proposed algorithm addresses four issues: data classification, high levels of human interaction, lack of labeled data, and the effectiveness of distributed denial of service attacks. We're also working on a decision tree classifier that has a variety of parameters. The previous algorithm classified IDS up to 90% of the time and was not appropriate for large data sets. Our proposed algorithm was designed to accurately classify large data sets. Aside from that, we quantify a few more decision tree classifier parameters.

scholarly journals DEVELOPING A PARALLEL CLASSIFIER FOR MINING IN BIG DATA SETS

2021 ◽  
Vol 22 (2) ◽  
pp. 119-134
Author(s):  
Ahad Shamseen ◽  
Morteza Mohammadi Zanjireh ◽  
Mahdi Bahaghighat ◽  
Qin Xin
Keyword(s):  
Data Mining ◽  
Big Data ◽  
Decision Tree ◽  
Main Memory ◽  
Experimental Results ◽  
Primary Data ◽  
Data Sets ◽  
Decision Tree Classifier ◽  
Vast Amount ◽  
Tree Classifier

Data mining is the extraction of information and its roles from a vast amount of data. This topic is one of the most important topics these days. Nowadays, massive amounts of data are generated and stored each day. This data has useful information in different fields that attract programmers’ and engineers’ attention. One of the primary data mining classifying algorithms is the decision tree. Decision tree techniques have several advantages but also present drawbacks. One of its main drawbacks is its need to reside its data in the main memory. SPRINT is one of the decision tree builder classifiers that has proposed a fix for this problem. In this paper, our research developed a new parallel decision tree classifier by working on SPRINT results. Our experimental results show considerable improvements in terms of the runtime and memory requirements compared to the SPRINT classifier. Our proposed classifier algorithm could be implemented in serial and parallel environments and can deal with big data. ABSTRAK: Perlombongan data adalah pengekstrakan maklumat dan peranannya dari sejumlah besar data. Topik ini adalah salah satu topik yang paling penting pada masa ini. Pada masa ini, data yang banyak dihasilkan dan disimpan setiap hari. Data ini mempunyai maklumat berguna dalam pelbagai bidang yang menarik perhatian pengaturcara dan jurutera. Salah satu algoritma pengkelasan perlombongan data utama adalah pokok keputusan. Teknik pokok keputusan mempunyai beberapa kelebihan tetapi kekurangan. Salah satu kelemahan utamanya adalah keperluan menyimpan datanya dalam memori utama. SPRINT adalah salah satu pengelasan pembangun pokok keputusan yang telah mengemukakan untuk masalah ini. Dalam makalah ini, penyelidikan kami sedang mengembangkan pengkelasan pokok keputusan selari baru dengan mengusahakan hasil SPRINT. Hasil percubaan kami menunjukkan peningkatan yang besar dari segi jangka masa dan keperluan memori berbanding dengan pengelasan SPRINT. Algoritma pengklasifikasi yang dicadangkan kami dapat dilaksanakan dalam persekitaran bersiri dan selari dan dapat menangani data besar.

scholarly journals Building student’s performance decision tree classifier using boosting algorithm

2019 ◽  
Vol 14 (3) ◽  
pp. 1298 ◽  
Author(s):  
Farid Jauhari ◽  
Ahmad Afif Supianto
Keyword(s):  
Student Performance ◽  
Binary Classification ◽  
Training Data ◽  
Special Treatment ◽  
Decision Tree Classifier ◽  
Baseline Method ◽  
Tree Classifier ◽  
Boosting Algorithms ◽  
Student’S Performance ◽  
Boosting Algorithm

<span lang="EN-US">Student’s performance is the most important value of the educational institutes for their competitiveness. In order to improve the value, they need to predict student’s performance, so they can give special treatment to the student that predicted as low performer. In this paper, we propose 3 boosting algorithms (C5.0, adaBoost.M1, and adaBoost.SAMME) to build the classifier for predicting student’s performance. This research used <sup>1</sup>UCI student performance datasets. There are 3 scenarios of evaluation, the first scenario was employ 10-fold cross-validation to compare performance of boosting algorithms. The result of first scenario showed that adaBoost.SAMME and adaBoost.M1 outperform baseline method in binary classification. The second scenario was used to evaluate boosting algorithms under different number of training data. On the second scenario, adaBoost.M1 was outperformed another boosting algorithms and baseline method on the binary classification. As third scenario, we build models from one subject dataset and test using onother subject dataset. The third scenario results indicate that it can build prediction model using one subject to predict another subject.</span>

scholarly journals Role of FCBF Feature Selection in Educational Data Mining

2020 ◽  
Vol 39 (4) ◽  
pp. 772-778
Author(s):  
Maryam Zaffar ◽  
Manzoor Ahmad Hashmani ◽  
K.S. Savita ◽  
Syed Sajjad Hussain Rizvi ◽  
Mubashar Rehman
Keyword(s):  
Data Mining ◽  
Feature Selection ◽  
Prediction Model ◽  
Student Performance ◽  
Performance Prediction ◽  
Prediction Models ◽  
Educational Data Mining ◽  
Action Plans ◽  
Factors Affecting ◽  
Academic Organization

The Educational Data Mining (EDM) is a very vigorous area of Data Mining (DM), and it is helpful in predicting the performance of students. Student performance prediction is not only important for the student but also helpful for academic organization to detect the causes of success and failures of students. Furthermore, the features selected through the students’ performance prediction models helps in developing action plans for academic welfare. Feature selection can increase the prediction accuracy of the prediction model. In student performance prediction model, where every feature is very important, as a neglection of any important feature can cause the wrong development of academic action plans. Moreover, the feature selection is a very important step in the development of student performance prediction models. There are different types of feature selection algorithms. In this paper, Fast Correlation-Based Filter (FCBF) is selected as a feature selection algorithm. This paper is a step on the way to identifying the factors affecting the academic performance of the students. In this paper performance of FCBF is being evaluated on three different student’s datasets. The performance of FCBF is detected well on a student dataset with greater no of features.

Conceptual Approach to Predict Loan Defaults Using Decision Trees

2019 ◽  
pp. 148-161 ◽  
Author(s):  
Syed Muzamil Basha ◽  
Dharmendra Singh Rajput ◽  
N. Ch. S. N. Iyengar
Keyword(s):  
Decision Tree ◽  
Decision Trees ◽  
Prediction Algorithm ◽  
Classification Error ◽  
Selection Algorithm ◽  
Decision Tree Classifier ◽  
Time Data ◽  
Conceptual Approach ◽  
Tree Classifier ◽  
Loan Defaults

In this chapter, the authors show how to build a decision tree from given real-time data. They interpret the output of decision tree by learning decision tree classifier using really recursive greedy algorithm. Feature selection is made based on classification error using the algorithm called feature split selection algorithm (FSSA), with all different possible stopping conditions for splitting. The authors perform prediction with decision trees using decision tree prediction algorithm (DTPA), followed by multiclass predictions and their probabilities. Finally, they perform splitting procedure on real continuous value input using threshold split selection algorithm (TSSA).

Sign in / Sign up

Export Citation Format

Share Document