The Sriwijaya University Library

  • Home
  • Information
  • News
  • Help
  • Login
  • Librarian
  • Member Area
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of PENERAPAN ADASYN UNTUK MENANGANI DATA IMBALANCE DALAM PERBANDINGAN KINERJA SVM, RANDOM FOREST, DAN XGBOOST PADA ANALISIS SENTIMEN APLIKASI ACCESS BY KAI
Bookmark Share

Skripsi

PENERAPAN ADASYN UNTUK MENANGANI DATA IMBALANCE DALAM PERBANDINGAN KINERJA SVM, RANDOM FOREST, DAN XGBOOST PADA ANALISIS SENTIMEN APLIKASI ACCESS BY KAI

Epriyanti, Nadia - Personal Name;

The rapid growth of digital applications has heightened the need to understand user perceptions more thoroughly, particularly through sentiment analysis of user-generated reviews. In practice, sentiment classification often faces challenges related to class imbalance, especially when neutral reviews are significantly fewer than positive or negative ones. This imbalance can limit a model’s ability to accurately detect all sentiment categories. This study examines the comparative performance of three machine learning algorithms Support Vector Machine (SVM), Random Forest (RF), and Extreme Gradient Boosting (XGBoost) by applying the Adaptive Synthetic Sampling (ADASYN) technique to address class imbalance. This study differs from previous similar research by conducting a simultaneous comparative analysis of three algorithms using the ADASYN method in the context of Access by KAI application reviews, which has not been examined in prior studies. Experimental results indicate that after implementing ADASYN, model accuracies reached 75.17% for SVM, 84.06% for RF, and 83.17% for XGBoost. Although accuracy slightly decreased after oversampling, the F1-scores for the neutral class improved to 0.13 (SVM), 0.05 (RF), and 0.14 (XGBoost). Before applying ADASYN, the models achieved accuracies of 85.88% (SVM), 85.13% (RF), and 85.37% (XGBoost), but they were unable to effectively recognize neutral sentiments, with F1-scores of 0.00 for SVM and RF, and 0.03 for XGBoost. These findings suggest that ADASYN enhances model sensitivity to neutral sentiment, with XGBoost demonstrating the most consistent and robust performance in sentiment classification for the Access by KAI application.


Availability
#
Central Library (Reference) T1895872025
T189587
Available but not for loan - Not for Loan
Detail Information
Series Title
-
Call Number
T1895872025
Publisher
Indralaya : Prodi Sistem Informasi, Fakultas Ilmu Komputer Universitas Sriwijaya., 2025
Collation
xvi, 93 hlm.; ilus.; tab.; 29 cm.
Language
Indonesia
ISBN/ISSN
-
Classification
006.350 7
Content Type
Text
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Prodi Sistem Informasi
Analisis Sintimen--Analisis Data
Specific Detail Info
-
Statement of Responsibility
MI
Other version/related

No other version available

File Attachment
  • PENERAPAN ADASYN UNTUK MENANGANI DATA IMBALANCE DALAM PERBANDINGAN KINERJA SVM, RANDOM FOREST, DAN XGBOOST PADA ANALISIS SENTIMEN APLIKASI ACCESS BY KAI
Comments

You must be logged in to post a comment

The Sriwijaya University Library
  • Information
  • Services
  • Librarian
  • Member Area

About Us

As a complete Library Management System, SLiMS (Senayan Library Management System) has many features that will help libraries and librarians to do their job easily and quickly. Follow this link to show some features provided by SLiMS.

Search

start it by typing one or more keywords for title, author or subject

Keep SLiMS Alive Want to Contribute?

© 2026 — Senayan Developer Community

Powered by SLiMS
Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?