Metode Pembobotan Jarak dengan Koefisien Variasi untuk Mengatasi Kelemahan Euclidean Distance pada Algoritma k-Nearest Neighbor

Jurnal Ilmiah SINUS

View Publication Info
 
 
Field Value
 
Title Metode Pembobotan Jarak dengan Koefisien Variasi untuk Mengatasi Kelemahan Euclidean Distance pada Algoritma k-Nearest Neighbor
 
Creator Agustiyar, Agustiyar
Wahono, Romi Satria
Supriyanto, Catur
 
Subject k-NN; attribute weighting; weighted Euclidean distance; MinMax normalization
 
Description k-Nearest Neighbor (k-NN) is one of the classification algorithms which becomes top 10 in data mining. k-NN is simple and easy to apply. However, the classification results are greatly influenced by the scale of the data input. All of its attributes are considered equally important by Euclidean distance, but inappropriate with the relevance of each attribute. Thus, it makes classification results decreased. Some of the attributes are more or less relevance or, in fact, irrelevant in determining the classification results. To overcome the disadvantage of k-NN, Zolghadri, Parvinnia, and John proposed Weighted Distance Nearest Neighbor (WDNN) having the performance better than k-NN. However, when the result is k >1, the performance decrease. Gou proposed Dual Distance Weighted Voting k-Nearest Neighbor (DWKNN) having the performance better than k-NN. However, DWKNN focused in determining label of classification result by weighted voting. It applied Euclidean distance without attribute weighting. This might cause all attribute considered equally important by Euclidean distance, but inappropriate with the relevance of each attribute, which make classification results decreased. This research proposed Coefficient of Variation Weighting k-Nearest Neighbor (CVWKNN) integrating with MinMax normalization and weighted Euclidean distance. Seven public datasets from UCI Machine Learning Repository were used in this research. The results of Friedman test and Nemenyi post hoc test for accuracy showed CVWKNN had better performance and significantly different compared to k-NN algorithm. 
 
Publisher STMIK Sinar Nusantara
 
Contributor
 
Date 2022-01-14
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Peer-reviewed Article

 
Format application/pdf
 
Identifier https://p3m.sinus.ac.id/jurnal/index.php/e-jurnal_SINUS/article/view/565
10.30646/sinus.v20i1.565
 
Source Jurnal Ilmiah SINUS; Vol 20, No 1 (2022): Vol. 20 No. 1, Januari 2022; 1-10
2548-4028
1693-1173
10.30646/sinus.v20i1
 
Language eng
 
Relation https://p3m.sinus.ac.id/jurnal/index.php/e-jurnal_SINUS/article/view/565/pdf
https://p3m.sinus.ac.id/jurnal/index.php/e-jurnal_SINUS/article/downloadSuppFile/565/96
 
Rights Copyright (c) 2022 Jurnal Ilmiah SINUS
https://p3m.sinus.ac.id/jurnal/e-jurnal_SINUS/
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library