skip to main content

PENERAPAN METODE ADAPTIVE BOOSTING (ADABOOST) PADA DECISION TREE UNTUK ANALISIS SENTIMEN PELANGGAN MAXIM

*Erni Triana  -  Departemen Statistika, Fakultas Sains dan Matematika, Universitas Diponegoro, Indonesia
Mustafid Mustafid  -  , Indonesia
Rukun Santoso  -  , Indonesia
Open Access Copyright 2025 Jurnal Gaussian under http://creativecommons.org/licenses/by-nc-sa/4.0.

Citation Format:
Abstract

Information technology is currently growing rapidly, one form of technology beneficiary is using the internet, namely online transportation services based on mobile applications. Maxim is one of the online transportation services in Indonesia that offers relatively cheaper prices compared to other online transportation services. This study aims to apply the Adaptive Boosting (Adaboost) method with Decision Tree to classify Maxim's customer review data so that it can establish customer satisfaction factors. Review data was obtained from June – December 2022 with a total of 1500 reviews. Classification was carried out using the Adaptive Boosting method with a Decision Tree and Tuning Hyperparameter Grid Search. Adaptive Boosting is used to improve the performance of the Decision Tree so it can work better. The Grid Search algorithm is used to determine the best hyperparameter combination in Adaptive Boosting so that the classification process can be more optimal. Classification using the Adaptive Boosting model with Decision Tree yields accuracy, precision and recall values of 83,69%, 86,75% and 85,71% with the best parameter combination based on Grid Search is n_estimator (number of trees) 300 and learning rate 0,001. Based on this accuracy value, it can be concluded that the Adaptive Boosting model is quite good at classifying Maxim's customer review data.

Note: This article has supplementary file(s).

Fulltext View|Download |  Research Instrument
CTA Gaussian_Erni Triana
Subject
Type Research Instrument
  Download (421KB)    Indexing metadata
Keywords: Online Transportation;Adaptive Boosting;Decision Tree;Grid Search.

Article Metrics:

  1. Brownlee, J. 2020. Probability for Machine Learning: Discover How To Harness Uncertainty With Python. San Fransisco: Machine Learning Mastery
  2. Castellà, Q., Sutton, C. 2014. Word storms: Multiples of word clouds for visual comparison of documents. Proceedings of the 23th International Conference of World
  3. Feldman, R., Sanger, J. 2007. The Text Mining Handbook: Advanced Approachesiin Analyzing Unstructured Data. New York:Cambridge
  4. Freund, Y., Schapire, R. E. 1996. AiDecision-Theoretic Generalization of ON-Line Learning andian Application to Boosting. Journal of Computer and System Sciences Vol.55, Hal: i119-139
  5. Han, J., Kamber, M., Pei, J. 2012. Data Mining: Concepts And Techniques Third Edition. San Francisco: Morgan Kaufmann
  6. Hastie, T. J., Tibshirani, R. J., Friedman, J.H. 2008. The Elements of Statistical Learning: Data-mining, Inference and Prediction Second Edition. New York: Springer-Verlag
  7. Liu, B. 2012. Sentiment Analysis and Opinion Mining, Morgan & Claypool Publishers
  8. Quinlan, J. R. 1993. C4.5: Programs For Machine Learning. California: Morgan Kaufmann
  9. Salton, C., Buckley, C. 1987. The Weighting Approaches in Automatic Text Retrieval. Information Processing & Management, Hal: 513-523
  10. Syarif, I., Prugel-Bennett, A., Wills, G. 2016. SVM Parameter Optimization Using Grid Search and Genetic Algorithm to Improve Classification Performance. Telkomnika (Telecommunication Comput. Electron. Control) Vol 14, No. 4, Hal: 1502-1509
  11. Wahid, D. H., Azhari, S. N. 2016. Peringkasan Sentimen Ekstraktif di Twitter Menggunakan Hybrid TF-IDF dan Cosine Similarity. IJCCS (Indonesian Journal of Computing and Cybernetics System) Vol. 10, No.2, Hal: 207-218

Last update:

No citation recorded.

Last update:

No citation recorded.