Melola Discovery

← Melola Discovery

Open access Jurnal SINTA 3

PERFORMANCE ANALYSIS OF MODIFIED-ODBOT AND SMOTE FOR TREE-BASED CLASSIFICATION OF IMBALANCED HUMAN DEVELOPMENT INDEX DATA

BAREKENG: Jurnal Ilmu Matematika dan Terapan · Vol. 20 No. 3 (2026) · pp. 2311–2326

DOI
10.30598/barekengvol20iss3pp2311-2326
ISSN
2615-3017, 1978-7227
Published
2026-04-08
Publisher
PATTIMURA UNIVERSITY
Language
eng
License
creativecommons.org/licenses/by-sa/4.0

Abstract

Classification of Human Development Index (HDI) data presents significant challenges due to severe class imbalance, where low-development regions are substantially underrepresented. This imbalance reduces classification performance because machine learning models tend to be biased toward the majority classes, making it challenging to accurately identify minority classes. This study proposes a modified ODBOT that replaces Euclidean distance with Mahalanobis distance within the oversampling mechanism (Mahalanobis-based ODBOT) and compares its performance with Euclidean-based ODBOT with and without Principal Component Analysis (PCA), as well as the conventional SMOTE technique. Four tree-based classifications were used, namely Random Forest, Double Random Forest, XGBoost, and LightGBM. The Human Development Index (HDI) data set from the Central Statistics Agency, consisting of 514 observations and four features, with an imbalance ratio (IR) of 19.0, was divided into training and testing sets (ratio 80:20) with 30 repetitions and evaluated using F1-Measure (F1-M), Geometric Mean (G-M), Area Under the Curve (AUC), and computation time. The results show that Mahalanobis-based ODBOT achieved the highest performance on the AUC evaluation metric across all classification models and the highest on the G-M evaluation metric in three of the four classification models, but required significantly longer computation time (2545.66 seconds). In contrast, the Euclidean-based ODBOT with PCA improved F1-M while reducing computation time (7.21 seconds) compared to the original ODBOT (68.23 seconds), while SMOTE consistently improved G-M and AUC across all experiments. These findings suggest that oversampling techniques should be selected based on practical application needs. Specifically, the Mahalanobis-based ODBOT can be recommended when improving prediction performance is a priority, while the Euclidean-based ODBOT with PCA or SMOTE is preferable for real-world implementations that require faster execution and lower computational cost.

Collaboration network of the authors

37 authors · 101 co-authorship links · 1 across different organisations

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • IPB University
  • Bandung Islamic University
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
Erfiani ErfianiAffiliation unknown5
Bagus SartonoIPB University4
Anang KurniaAffiliation unknown4
Kusman SadikAffiliation unknown3
I Made SumertajayaAffiliation unknown2
Khairil Anwar NotodiputroBandung Islamic University2
Andi Harismahyanti A.Affiliation unknown2
Anik DjuraidahAffiliation unknown1
Ismah IsmahAffiliation unknown1
Sim Hui XinAffiliation unknown1
Vera Maya SantiAffiliation unknown1
Anggita Rizky FadilahAffiliation unknown1
Reni AmeliaAffiliation unknown1
Christiana Anggraeni PutriAffiliation unknown1
Husnun NashirAffiliation unknown1
Khusnia Nurul KhikmahAffiliation unknown1
Ni Gusti Ayu Putu Puteri SuantariAffiliation unknown1
Nila LestariAffiliation unknown1
Elisa D JuliantiAffiliation unknown1
Leli LatifahAffiliation unknown1
Aji Hamim WigenaAffiliation unknown1
Titin YuniartyAffiliation unknown1
Yudi Fathul AminAffiliation unknown1
Hari WijayantoAffiliation unknown1
Kristuisno Martsuyanto KapilukaAffiliation unknown1
Ita WulandariAffiliation unknown1
Asep SaefuddinIPB University1
Lukmanul HakimAffiliation unknown1
Cici SuhaeniIPB University1
Uswatun HasanahAffiliation unknown1
Agus Mohamad SolehAffiliation unknown1
Nadira Nisa AlwaniAffiliation unknown1
Megawati MegawatiAffiliation unknown1
Alfa Nugraha PradanaAffiliation unknown1

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://ojs3.unpatti.ac.id/index.php/barekeng/oai, first harvested 5 Nov 2026, last seen 5 Nov 2026.
Original metadata (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-US">PERFORMANCE ANALYSIS OF MODIFIED-ODBOT AND SMOTE FOR TREE-BASED CLASSIFICATION OF IMBALANCED HUMAN DEVELOPMENT INDEX DATA</dc:title>
	<dc:creator>Indah, Yunna Mentari</dc:creator>
	<dc:creator>Fitrianto, Anwar</dc:creator>
	<dc:creator>Indahwati, Indahwati</dc:creator>
	<dc:description xml:lang="en-US">Classification of Human Development Index (HDI) data presents significant challenges due to severe class imbalance, where low-development regions are substantially underrepresented. This imbalance reduces classification performance because machine learning models tend to be biased toward the majority classes, making it challenging to accurately identify minority classes. This study proposes a modified ODBOT that replaces Euclidean distance with Mahalanobis distance within the oversampling mechanism (Mahalanobis-based ODBOT) and compares its performance with Euclidean-based ODBOT with and without Principal Component Analysis (PCA), as well as the conventional SMOTE technique. Four tree-based classifications were used, namely Random Forest, Double Random Forest, XGBoost, and LightGBM. The Human Development Index (HDI) data set from the Central Statistics Agency, consisting of 514 observations and four features, with an imbalance ratio (IR) of 19.0, was divided into training and testing sets (ratio 80:20) with 30 repetitions and evaluated using F1-Measure (F1-M), Geometric Mean (G-M), Area Under the Curve (AUC), and computation time. The results show that Mahalanobis-based ODBOT achieved the highest performance on the AUC evaluation metric across all classification models and the highest on the G-M evaluation metric in three of the four classification models, but required significantly longer computation time (2545.66 seconds). In contrast, the Euclidean-based ODBOT with PCA improved F1-M while reducing computation time (7.21 seconds) compared to the original ODBOT (68.23 seconds), while SMOTE consistently improved G-M and AUC across all experiments. These findings suggest that oversampling techniques should be selected based on practical application needs. Specifically, the Mahalanobis-based ODBOT can be recommended when improving prediction performance is a priority, while the Euclidean-based ODBOT with PCA or SMOTE is preferable for real-world implementations that require faster execution and lower computational cost.</dc:description>
	<dc:publisher xml:lang="en-US">PATTIMURA UNIVERSITY</dc:publisher>
	<dc:date>2026-04-08</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://ojs3.unpatti.ac.id/index.php/barekeng/article/view/21342</dc:identifier>
	<dc:identifier>10.30598/barekengvol20iss3pp2311-2326</dc:identifier>
	<dc:source xml:lang="en-US">BAREKENG: Jurnal Ilmu Matematika dan Terapan; Vol 20 No 3 (2026): BAREKENG: Journal of Mathematics and Its Application; 2311-2326</dc:source>
	<dc:source>2615-3017</dc:source>
	<dc:source>1978-7227</dc:source>
	<dc:source>10.30598/barekengvol20iss3year2026</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/21342/12653</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Yunna Mentari Indah, Anwar Fitrianto, Indahwati Indahwati</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>