Melola Discovery

← Melola Discovery

Akses terbuka Jurnal Tanpa peringkat SINTA

Optimizing Credit Scoring Performance Using Ensemble Feature Selection with Random Forest

Jurnal Matematika, Statistika dan Komputasi · Vol. 21 No. 2 (2025) · hlm. 560–572

DOI
10.20956/j.v21i2.42032
ISSN
2614-8811, 1858-1382
Terbit
2025-01-12
Penerbit
Department of Mathematics, Hasanuddin University
Bahasa
en
Lisensi
creativecommons.org/licenses/by/4.0

Abstrak

Credit scoring has a very important role in the financial industry to assess the eligibility of loan applicants and mitigate credit risk. However, the main challenge in credit scoring modeling is the large number of features that need to be considered. Feature selection becomes an inevitable step to improve model performance. This research proposes the use of hybrid ensemble boosting techniques through XGBoost, LightGBM, and CatBoost methods, as well as aggregation techniques for feature selection, the results of which are then used to build predictive models using Random Forest. Experimental results show that the aggregation technique using feature slices selected by the three methods provides the best model with the least number of features, which is only about 11% of the total features. The use of fewer features not only increases the computational speed and efficiency of the model but also improves the generalization ability, which allows the model to perform better on new data. In addition, this model shows the smallest difference between train accuracy and mean cross-validation score, indicating high model stability and reliability.

Kata kunci

Jaringan kolaborasi para penulis

Belum ada rekan penulis di Melola.

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">Optimizing Credit Scoring Performance Using Ensemble Feature Selection with Random Forest </dc:title>
	<dc:creator xml:lang="en">Fauziah, Ana</dc:creator>
	<dc:subject xml:lang="en">Classification</dc:subject>
	<dc:subject xml:lang="en">credit scoring</dc:subject>
	<dc:subject xml:lang="en">feature selection</dc:subject>
	<dc:subject xml:lang="en">ensemble method</dc:subject>
	<dc:subject xml:lang="en">random forest</dc:subject>
	<dc:description xml:lang="en">Credit scoring has a very important role in the financial industry to assess the eligibility of loan applicants and mitigate credit risk. However, the main challenge in credit scoring modeling is the large number of features that need to be considered. Feature selection becomes an inevitable step to improve model performance. This research proposes the use of hybrid ensemble boosting techniques through XGBoost, LightGBM, and CatBoost methods, as well as aggregation techniques for feature selection, the results of which are then used to build predictive models using Random Forest. Experimental results show that the aggregation technique using feature slices selected by the three methods provides the best model with the least number of features, which is only about 11% of the total features. The use of fewer features not only increases the computational speed and efficiency of the model but also improves the generalization ability, which allows the model to perform better on new data. In addition, this model shows the smallest difference between train accuracy and mean cross-validation score, indicating high model stability and reliability.</dc:description>
	<dc:publisher xml:lang="en">Department of Mathematics, Hasanuddin University</dc:publisher>
	<dc:date>2025-01-12</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/42032</dc:identifier>
	<dc:identifier>10.20956/j.v21i2.42032</dc:identifier>
	<dc:source xml:lang="en">Jurnal Matematika, Statistika dan Komputasi; Vol. 21 No. 2 (2025): JANUARY 2025; 560-572</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/42032/12452</dc:relation>
	<dc:rights xml:lang="en">Copyright (c) 2025 Jurnal Matematika, Statistika dan Komputasi</dc:rights>
	<dc:rights xml:lang="en">https://creativecommons.org/licenses/by/4.0</dc:rights>
</oai_dc:dc>