Melola Discovery

← Melola Discovery

Open access Journal 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

40 authors · 111 co-authorship links · 21 across different organisations · showing the 40 most connected

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

  • IPB University
  • Politeknik Statistika STIS
  • Universitas Muhammadiyah Jakarta
  • Universiti Putra Malaysia
  • State University of Jakarta
  • Universitas Negeri Surabaya
  • National Research and Innovation Agency
  • Other organisations
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles
ERFIANI ERFIANIIPB University5
Bagus SartonoIPB University4
Anang KurniaIPB University3
Kusman SadikIPB University3
I Made SumertajayaIPB University2
Khairil Anwar NotodiputroIPB University2
Andi Harismahyanti A.IPB University2
Pradnya Sri RahayuIPB University1
Nabila Ghoni Trisno HidayatullohIPB University1
Sachnaz Desta OktarinaIPB University1
Anik DjuraidahIPB University1
Ismah IsmahUniversitas Muhammadiyah Jakarta1
Sim Hui XinUniversiti Putra Malaysia1
Vera Maya SantiState University of Jakarta1
Anggita Rizky FadilahIPB University1
Reni AmeliaIPB University1
Christiana Anggraeni PutriPoliteknik Statistika STIS1
Husnun NashirIPB University1
Khusnia Nurul KhikmahUniversitas Negeri Surabaya1
Ni Gusti Ayu Putu Puteri SuantariIPB University1
Nila LestariIPB University1
Elisa Diana JuliantiNational Research and Innovation Agency1
Leli LatifahIPB University1
Aji Hamim WigenaIPB University1
Titin YuniartyIPB University1
Yudi Fathul AminIPB University1
Hari WijayantoIPB University1
Kristuisno Martsuyanto KapilukaIPB University1
Anang KurniaIPB University1
Ita WulandariPoliteknik Statistika STIS1
Asep SaefuddinIPB University1
Lukmanul HakimIPB University1
Uswatun HasanahIPB University1
Cici SuhaeniIPB University1
Agus Mohamad SolehIPB University1
Megawati MegawatiSunan Gunung Djati State Islamic University Bandung1
Nadira Nisa AlwaniIPB University1

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 8 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>