Analysis of User Satisfaction and Loyalty in the BRI Mobile E-Banking Application using a Data Mining Approach (K-Means Clustering and Decision Tree)

Sri Mawarni Bahri, Syaiful Zuhri Harahap, Irmayanti Irmayanti, Budianto Bangun

Abstract


The development of information technology has driven digital transformation in the banking sector, particularly through e-banking services that provide convenience, speed, and flexibility for users in conducting financial transactions. The BRI Mobile (BRImo) application, as a digital service of Bank Rakyat Indonesia, plays an important role in improving service quality for customers. However, the emergence of negative perceptions regarding transaction notifications, along with varying user experiences, may affect user satisfaction and loyalty levels. The main problem in this study is that the patterns of user satisfaction and loyalty, as well as the most influential factors affecting both aspects, have not been clearly identified. This study aims to analyze the level of user satisfaction and loyalty toward the BRI Mobile application and to identify the dominant factors influencing them, namely ease of use, security, trust, and system performance. The research employs a quantitative approach using data mining techniques, specifically the K-Means Clustering algorithm to group users based on satisfaction levels, and a Decision Tree to determine the most influential factors affecting user loyalty. Data were collected through questionnaires distributed to 100 active BRImo users. The results show that users can be grouped into several clusters with different satisfaction characteristics. In addition, the Decision Tree analysis reveals that system performance is the most dominant factor influencing user satisfaction and loyalty, followed by ease of use, security, and trust. Overall, the combination of K-Means Clustering and Decision Tree methods provides a more comprehensive understanding of user satisfaction and loyalty patterns, and can serve as a basis for strategic decision-making to improve the quality of the BRI Mobile application services.

Keywords


decision tree; e-banking; K-Means clustering; user loyalty; user satisfaction

Full Text:

PDF

References


A. Yahya and R. Kurniawan, “Implementasi Algoritma K-Means untuk Pengelompokan Data Penjualan berdasarkan Pola Penjualan,” MALCOM Indones. J. Mach. Learn. Comput. SCI. J., Vol. 5, No. January, pp. 350–358, 2025.

Sulistiani et al., “Data Analysis of Student Monitoring using the K-Means Clustering Method,” Indones. J. Mod. SCI. Technol., Vol. 1, No. 2, pp. 50–57, 2025, DOI: 10.64021/ijmst.1.2.50-57.2025.

R. Rahmawati, W. Prihartono, and K. Cirebon, “Optimasi Stok dengan Clustering Data Transaksi Penjualan menggunakan Algoritma K-Means di Konter Agung Cell,” JITET (Jurnal Inform. dan Tek. Elektro Ter., Vol. 13, No. 2, 2025.

E. A. Wibowo and R. Aryanti, “Penerapan Metode Clustering K-Means menggunakan RapidMiner untuk Klasifikasi Prestasi Siswa di Sekolah Swasta,” J. Inf. Technol. Informatics Eng., Vol. 1, No. 1, pp. 20–24, 2025, [Online]. Available: https://journal.jci.co.id/jitie/article/view/35

I. Fazira, Z. Fitri, and Risawandi, “Optimasi Jumlah Cluster pada K-Means Clustering menggunakan Particle Swarm Optimization untuk Pengelompokan UKT Mahasiswa,” RABIT J. Teknol. dan Sist. Inf. Univrab, Vol. 10, No. 2, pp. 874–886, 2025.

A. Alawiyah, N. Aghnia, and F. F. Abdalah, “Implementasi Clustering Algoritma K-Means pada Penjualan Beras di CV Tangguh Bumi Perkasa,” J. Komisi (Jurnal Komput. dan Sist. Informasi), Vol. 2, No. 2, pp. 17–23, 2025.

J. N. Iin, “Perbandingan Kmeans Dan Hierarchical Clustering Untuk Pemetaan Kawasan Rawan Stunting Di Kabupaten Kolaka,” RABIT J. Teknol. dan Sist. Inf. Univrab, vol. 10, no. 2, pp. 701–716, 2025.

M. Fadhil, W. Fuadi, and Maryana, “Clustering Tingkat Kecanduan Game Mobile Legends terhadap Keharmonisan Keluarga menggunakan Metode K-Means,” RABIT J. Teknol. dan Sist. Inf. Univrab, Vol. 10, No. 2, pp. 981–990, 2025.

N. Bili, R. T. Abineno, and A. Aha Pekuwali, “Penerapan Algoritma K-Means Clustering untuk Pengelompokkan Peforma Siswa pada Pembelajaran Bahasa Indonesia (Studi Kasus : SD Inpress Waingapu 3),” SATI Sustain. Agric. Technol. Innov., pp. 523–537, 2024.

I. Ibrahim and W. Usino, “Klasterisasi Tingkat Kelayakan Provinsi dalam Pembangunan Kawasan Industri menggunakan Algoritma K-Means,” SENAFTI (Semiinar Nas. Mhs. Fak. Teknol. Informasi), Vol. 3, No. September, pp. 324–333, 2024.

M. Rival, M. Misriani, and L. O. Bakrim, “Penerapan Metode Cluster dalam Data Mining Mengelompokkan Kenakalan Remaja (Studi Kasus Polda Sultra),” Simkom, Vol. 9, No. 1, pp. 79–89, 2024, DOI: 10.51717/simkom.v9i1.375.

E. Muningsih, C. Kesuma, Sunanto, Suripah, and A. Widayanto, “Combination of K-Means Method with Davies Bouldin Index and Decision Tree Method with Parameter Optimization for Best Performance,” 2023, p. 020021. DOI: 10.1063/5.0129119.

U. Arfan and N. Paraga, “Perbandingan Algoritma K-Means, Naïve Bayes dan Decision Tree dalam memprediksi Penjualan Bahan Bakar Minyak,” MALCOM Indones. J. Mach. Learn. Comput. SCI., Vol. 4, No. 4, pp. 1379–1389, Jul. 2024, DOI: 10.57152/malcom.v4i4.1566.

R. Ridwansyah, V. Riyanto, A. Hamid, S. Rahayu, and J. J. Purnama, “Grouping Data in Predicting Infant Mortality using K-Means and Decision Tree,” Paradig. - J. Komput. dan Inform., Vol. 24, No. 2, pp. 168–174, Sep. 2022, DOI: 10.31294/paradigma.v24i2.1399.

D. H. Khoiriyah and R. Ambarwati, “Dynamic Segmentation Analysis for Expedition Services: Integrating K-Means and Decision Tree,” J. Inf. Syst. Informatics, Vol. 6, No. 1, pp. 363–377, Mar. 2024, DOI: 10.51519/journalisi.v6i1.666.

P. C. Hartono and A. D. Widiantoro, “Analisis Prediksi Harga Saham Unilever menggunakan Regresi Linier dengan RapidMiner,” J. Comput. Inf. Syst. Ampera, Vol. 5, No. 3, pp. 2775–2496, 2024, [Online]. Available: https://journal-computing.org/index.php/journal-cisa/index




DOI: https://doi.org/10.32520/stmsi.v15i4.6305

Article Metrics

Abstract view : 0 times
PDF - 0 times

Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.