Perbandingan Oversampling Duplikasi Terhadap Oversampling Acak pada Algoritme K-Nearest Neighbour untuk Kasus Imbalanced Data
dc.contributor.advisor | Kustiyo, Aziz | |
dc.contributor.author | Meitanisyah | |
dc.date.accessioned | 2014-12-23T04:06:01Z | |
dc.date.available | 2014-12-23T04:06:01Z | |
dc.date.issued | 2014 | |
dc.identifier.uri | http://repository.ipb.ac.id/handle/123456789/72477 | |
dc.description.abstract | Imbalanced class can give negative effect, especially the tendency of the data classes becomes imbalanced. It causes the data will be more inclined to the majority class composition and ignore the minority class. But, minority class sometimes has important information even more difficult to predict than the majority class. In addition, it can also decrease the classifier performance of imbalanced class. The solution will be done by modifying the dataset using duplication oversampling and random oversampling. In this study, a comparison will be made between the random oversampling and duplication oversampling. In this study, we use k-nearest neighbour as the clasifier. The results show that duplication oversampling has better performance than random oversampling, but random oversampling. However, the f-measure of random oversampling is slightly different compared to that of the duplication oversampling | en |
dc.language.iso | id | |
dc.subject.ddc | Bogor-Jawa Barat | en |
dc.subject.ddc | 2014 | en |
dc.subject.ddc | Data | en |
dc.subject.ddc | Computer Science | en |
dc.title | Perbandingan Oversampling Duplikasi Terhadap Oversampling Acak pada Algoritme K-Nearest Neighbour untuk Kasus Imbalanced Data | en |
dc.subject.keyword | Oversampling. | en |
dc.subject.keyword | K-Nearest Neighbour | en |
dc.subject.keyword | Bogor Agricultural University (IPB) | en |
dc.subject.keyword | Imbalanced data | en |
dc.subject.keyword | F-measure | en |
Files in this item
This item appears in the following Collection(s)
-
UT - Computer Science [2236]