Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Random Forest vs Elastic-Net Penalized Logistic Regression for Patient Discharge Classification in BPJS Primary Care

Jurnal Matematika, Statistika dan Komputasi · Vol. 22 No. 2 (2026) · hlm. 511–526

DOI
10.20956/j.v22i2.48609
ISSN
2614-8811, 1858-1382
Terbit
2026-01-10
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

This study analyzes and compares Random Forest and Penalized Logistic Regression (Elastic Net, SAGA solver) for classifying patient discharge status at BPJS Kesehatan primary care facilities (FKTP). The large-scale dataset consists entirely of nominal predictors with class imbalance (~64.9% majority). The experimental design applies an 80/20 train–test split, one-hot encoding, and class_weight = balanced for both models. Hyperparameters are tuned via a staged coarse→fine randomized search with a local-optimum convergence rule (improvement threshold ε = 1e−6, patience = 10), followed by 10-fold cross-validation for internal validation and final testing on the hold-out set. We evaluate three primary metrics: F1-Score, Precision–Recall AUC (PR-AUC), and Brier Score. On the test set, Random Forest attains F1 = 0.996679, PR-AUC = 0.999933, and Brier = 0.002646; Penalized Logistic Regression attains F1 = 0.996676, PR-AUC = 0.999928, and Brier = 0.002017. The near-identical F1 and PR-AUC indicate comparable discrimination between methods, while the lower Brier Score for Penalized Logistic Regression demonstrates superior probability calibration. Overall, both approaches lie on the same performance plateau for discrimination, with a consistent calibration advantage for Penalized Logistic Regression; method choice can thus be guided by whether operational needs prioritize calibrated probabilities or flexible non-linear decision boundaries.

Kata kunci

Jaringan kolaborasi para penulis

4 penulis · 6 tautan kepenulisan bersama

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Sumatera Utara
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) https://journal.unhas.ac.id/index.php/jmsk/oai, pertama di-harvest 5 Nov 2026, terakhir terlihat 15 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en">Random Forest vs Elastic-Net Penalized Logistic Regression for Patient Discharge Classification in BPJS Primary Care</dc:title>
	<dc:creator xml:lang="en">Hutabarat, David Kevin</dc:creator>
	<dc:creator xml:lang="en">Sawaluddin, Sawaluddin</dc:creator>
	<dc:creator xml:lang="en">Sitorus, Syahriol</dc:creator>
	<dc:creator xml:lang="en">Sutarman, Sutarman</dc:creator>
	<dc:subject xml:lang="en">BPJS Kesehatan</dc:subject>
	<dc:subject xml:lang="en">Elastic Net</dc:subject>
	<dc:subject xml:lang="en">Hyperparameter Tuning</dc:subject>
	<dc:subject xml:lang="en">Imbalanced  Classification</dc:subject>
	<dc:subject xml:lang="en">Random Forest</dc:subject>
	<dc:description xml:lang="en">This study analyzes and compares Random Forest and Penalized Logistic Regression (Elastic Net, SAGA solver) for classifying patient discharge status at BPJS Kesehatan primary care facilities (FKTP). The large-scale dataset consists entirely of nominal predictors with class imbalance (~64.9% majority). The experimental design applies an 80/20 train–test split, one-hot encoding, and class_weight = balanced for both models. Hyperparameters are tuned via a staged coarse→fine randomized search with a local-optimum convergence rule (improvement threshold ε = 1e−6, patience = 10), followed by 10-fold cross-validation for internal validation and final testing on the hold-out set. We evaluate three primary metrics: F1-Score, Precision–Recall AUC (PR-AUC), and Brier Score. On the test set, Random Forest attains F1 = 0.996679, PR-AUC = 0.999933, and Brier = 0.002646; Penalized Logistic Regression attains F1 = 0.996676, PR-AUC = 0.999928, and Brier = 0.002017. The near-identical F1 and PR-AUC indicate comparable discrimination between methods, while the lower Brier Score for Penalized Logistic Regression demonstrates superior probability calibration. Overall, both approaches lie on the same performance plateau for discrimination, with a consistent calibration advantage for Penalized Logistic Regression; method choice can thus be guided by whether operational needs prioritize calibrated probabilities or flexible non-linear decision boundaries.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2026-01-10</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://journal.unhas.ac.id/index.php/jmsk/article/view/48609</dc:identifier>
	<dc:identifier>10.20956/j.v22i2.48609</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 22 No. 2 (2026): JANUARY 2026; 511-526</dc:source>
	<dc:source>2614-8811</dc:source>
	<dc:source>1858-1382</dc:source>
	<dc:language>en</dc:language>
	<dc:relation>https://journal.unhas.ac.id/index.php/jmsk/article/view/48609/14002</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2026 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>