International Journal of Electrical and Computer Engineering (IJECE), 2024
In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GN... more In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GNB) and the decision tree (DT) classifiers. The Gaussian naïve Bayes classifier is a probability-based classification model that predicts future probabilities based on past experiences. Whereas the decision tree classifier is based on a decision tree, a series of tests that are performed adaptively where the previous test affects the next test. Both of these methods are simulated on the Iris dataset where the dataset consists of three types of Iris: setosa, virginica, and versicolor. The data is divided into two parts, namely training and testing data, in which there are several features as information on flower characteristics. Furthermore, to evaluate the performance of the algorithms on both methods and determine the best algorithm for the dataset, we evaluate it using several metrics on the training and testing data for each method. Some of these metrics are recall, precision, F1-score, and accuracy where the higher the value, the better the algorithm's performance. The results show that the performance of the decision tree classifier algorithm is the most outperformed on the Iris dataset.
International Journal of Electrical and Computer Engineering (IJECE), 2024
In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GN... more In this study, we apply two classification algorithm methods, namely the Gaussian naïve Bayes (GNB) and the decision tree (DT) classifiers. The Gaussian naïve Bayes classifier is a probability-based classification model that predicts future probabilities based on past experiences. Whereas the decision tree classifier is based on a decision tree, a series of tests that are performed adaptively where the previous test affects the next test. Both of these methods are simulated on the Iris dataset where the dataset consists of three types of Iris: setosa, virginica, and versicolor. The data is divided into two parts, namely training and testing data, in which there are several features as information on flower characteristics. Furthermore, to evaluate the performance of the algorithms on both methods and determine the best algorithm for the dataset, we evaluate it using several metrics on the training and testing data for each method. Some of these metrics are recall, precision, F1-score, and accuracy where the higher the value, the better the algorithm's performance. The results show that the performance of the decision tree classifier algorithm is the most outperformed on the Iris dataset.
Uploads
Papers by Yasi Dani