Melola Discovery

← Melola Discovery

Jurnal SINTA 1

Optimization of distance formula in K-Nearest Neighbor method

Bulletin of Electrical Engineering and Informatics · Vol. 9 No. 1 (2020) · hlm. 326–338

DOI
10.11591/eei.v9i1.1464
ISSN
2089-3191, 2302-9285
Terbit
2020-02-01
Penerbit
Institute of Advanced Engineering and Science (IAES)
Bahasa
en

Abstrak

K-Nearest Neighbor (KNN) is a method applied in classifying objects based on learning data that is closest to the object based on comparison between previous and current data. In the learning process, KNN calculates the distance of the nearest neighbor by applying the euclidean distance formula, while in other methods, optimization has been done on the distance formula by comparing it with the other similar in order to get optimal results. This study will discuss the calculation of the euclidean distance formula in KNN compared with the normalized euclidean distance, manhattan and normalized manhattan to achieve optimization results or optimal value in finding the distance of the nearest neighbor.

Kata kunci

Jaringan kolaborasi para penulis

40 penulis · 108 tautan kepenulisan bersama · 72 lintas organisasi · menampilkan 40 yang paling banyak terhubung

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • Universitas Sumatera Utara
  • Telkom University
  • Politeknik Negeri Medan
  • Universitas Muhammadiyah Sumatera Utara
  • Media Design School
  • International Islamic University Malaysia
  • National Research and Innovation Agency
  • Organisasi lain
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Romi Fadillah RahmatUniversitas Sumatera Utara14
Julham JulhamPoliteknik Negeri Medan6
Mahyuddin K. M. NasutionUniversitas Sumatera Utara4
Sarah PurnamawatiUniversitas Sumatera Utara4
Sharfina FazaPoliteknik Negeri Medan4
Idham KamilPoliteknik Negeri Medan3
Mhd Faris PratamaUniversitas Sumatera Utara3
Irvan IrvanUniversitas Muhammadiyah Sumatera Utara3
Habibi Ramdani SafitriPoliteknik Negeri Medan3
Syahril EfendiUniversitas Sumatera Utara2
Elviawaty Muisa ZamzamiUniversitas Sumatera Utara2
Opim Salim SitompulUniversitas Sumatera Utara2
Ferry FachrizalPoliteknik Negeri Medan2
Hariyadi HariyadiUniversitas Muhammadiyah Sumatera Barat2
Dini Oktarina Dwi HandayaniTaylor's University2
Muhammad BasriUniversitas Halu Oleo2
Michael J. WattsMedia Design School2
Akrim AkrimUniversitas Muhammadiyah Sumatera Utara2
Tien Fabrianti KusumasariTelkom University1
Lukmanul HakimInternational Islamic University Malaysia1
Hanif FakhrurrojaNational Research and Innovation Agency1
Rian Bimo AnkhalTelkom University1
Muhammad Fakhrul SafitraPertamina (Indonesia)1
Yulio FerdinandTelkom University1
Oktariani Nurul PratiwiTelkom University1
Sinung SuakantoTelkom University1
Jan M. PawlowskiAfiliasi tidak diketahui1
Litasari Widyastuti SuwarsonoTelkom University1
Joko SiswantoBandung Institute of Technology1
Syfa Nur LathifahTelkom University1
Amrullah AmrullahUniversitas Muhammadiyah Sumatera Utara1
Akbar IdamanUniversitas Satya Terra Bhinneka1
Herman MawengkangUniversitas Sumatera Utara1
Michael John WattsMedia Design School1
Anton Abdulbasah Kamilİstanbul Gelişim Üniversitesi1
Suherman SuhermanUniversitas Sumatera Utara1
Santi PrayudaniPoliteknik Negeri Medan1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OpenAlex API (jurnal SINTA, ADR 0048) https://openalex.org/S2765016208, pertama di-harvest 19 Nov 2026, terakhir terlihat 19 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/"><dc:title xml:lang="en">Optimization of distance formula in K-Nearest Neighbor method</dc:title><dc:creator>Arif Ridho Lubis</dc:creator><dc:creator>Muharman Lubis</dc:creator><dc:creator>Al-Khowarizmi Al-Khowarizmi</dc:creator><dc:subject>k-nearest neighbors</dc:subject><dc:subject>Euclidean distance</dc:subject><dc:subject>normalized Euclidean distance</dc:subject><dc:subject>Manhattan distance</dc:subject><dc:subject>nearest neighbor classification</dc:subject><dc:description xml:lang="en">K-Nearest Neighbor (KNN) is a method applied in classifying objects based on learning data that is closest to the object based on comparison between previous and current data. In the learning process, KNN calculates the distance of the nearest neighbor by applying the euclidean distance formula, while in other methods, optimization has been done on the distance formula by comparing it with the other similar in order to get optimal results. This study will discuss the calculation of the euclidean distance formula in KNN compared with the normalized euclidean distance, manhattan and normalized manhattan to achieve optimization results or optimal value in finding the distance of the nearest neighbor.</dc:description><dc:publisher>Institute of Advanced Engineering and Science (IAES)</dc:publisher><dc:date>2020-02-01</dc:date><dc:type>info:eu-repo/semantics/article</dc:type><dc:format>application/pdf</dc:format><dc:identifier>https://doi.org/10.11591/eei.v9i1.1464</dc:identifier><dc:identifier>10.11591/eei.v9i1.1464</dc:identifier><dc:source>Bulletin of Electrical Engineering and Informatics; Vol 9 No 1 (2020); 326-338</dc:source><dc:source>2089-3191</dc:source><dc:source>2302-9285</dc:source><dc:language>en</dc:language><dc:relation>https://beei.org/index.php/EEI/article/download/1464/1303</dc:relation></oai_dc:dc>