Analisis Perbandingan Kinerja Algoritma Naïve Bayes, Decision Tree-J48 dan Lazy-IBK

  • Rukmana I
  • Rasheda A
  • Fathulhuda F
  • et al.
N/ACitations
Citations of this article
51Readers
Mendeley users who have this article in their library.

Abstract

This research is focused on knowing the performance of the classification algorithms, namely Naïve Bayes, Decision Tree-J48 and K-Nearest Neighbor. The speed and the percentage of accuracy in this study are the benchmarks for the performance of the algorithm. This study uses the Breast Cancer and Thoracic Surgery dataset, which is downloaded on the UCI Machine Learning Repository website. Using the help of Weka software Version 3.8.5 to find out the classification algorithm testing. The results show that the J-48 Decision Tree algorithm has the best accuracy, namely 75.6% in the cross-validation test mode for the Breast Cancer dataset and 84.5% for the Thoracic Surgery dataset.

Cite

CITATION STYLE

APA

Rukmana, I., Rasheda, A., Fathulhuda, F., Cahyadi, M. R., & Fitriyani, F. (2021). Analisis Perbandingan Kinerja Algoritma Naïve Bayes, Decision Tree-J48 dan Lazy-IBK. JURNAL MEDIA INFORMATIKA BUDIDARMA, 5(3), 1038. https://doi.org/10.30865/mib.v5i3.3055

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free