No image available for this title

Text

Model Balanced Bagging Berbasis Decision Tree Pada Dataset Imbalanced Class



Abstract— The classification algorithm is an algorithm that is
very often used in conjunction with human needs, but previous
studies often encountered obstacles when using the classification
algorithm. One problem that is often encountered is the case of an
imbalanced dataset. So in this study, an ensemble method is
proposed to overcome this; one of the well-known ensemble
method algorithms is bagging. The implementation of balanced
bagging is used to improve the capabilities of the bagging
algorithm. This study compares three different classification
models with five datasets with different imbalanced ratios (IR).
The model will be evaluated based on the accuracy (balanced
accuracy), geometric mean and area under the curve (AUC). The
first model is a classification process using a Decision Tree
(without bagging), the second model is a classification process
using a Decision Tree (with bagging), and the third model uses a
Decision Tree (with Balanced-Bagging). The implementation of
the bagging and balanced bagging methods for the Decision Tree
classification algorithm was able to improve the performance of
the results of the accuracy (balanced accuracy), geometric mean,
and AUC. The Decision Tree + Balanced Bagging model generally
produces the best performance for all datasets used.


Availability

No copy data


Detail Information

Series Title
-
Call Number
-
Publisher JURNAL SISFOKOM (SISTEM INFORMASI DAN KOMPUTER) : Indonesia.,
Collation
12
Language
Indonesia
ISBN/ISSN
2598-7305
Classification
NONE
Content Type
-
Media Type
-
Carrier Type
-
Edition
-
Subject(s)
Specific Detail Info
-
Statement of Responsibility

Other Information

Accreditation
-

Other version/related

No other version available


File Attachment



Information


Web Online Public Access Catalog - Use the search options to find documents quickly