EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Review of Literature on Improving the KNN Algorithm

Raja Sakti Arief Daulay, Syahril Efendi, Suherman

Transactions on Engineering and Computing Sciences · 2023

DOI: 10.14738/tecs.113.14768 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Transactions on Engineering and Computing Sciences, 2023. Verfasst von Raja Sakti Arief Daulay und 2 weiteren Autor:innen. Die Arbeit wurde bisher 9-mal zitiert (Crossref) und nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

K-Nearest Neighbors (KNN) is a classification algorithm that has been widely used in the world of machine learning. The KNN algorithm classifies objects with learning data that are closest to the object. The special case where the classification is predicted based on the closest learning data is called the Nearest Neighbors algorithm. Classification is an important issue in processing big data, data science, and machine learning. KNN is one of the oldest, simplest, and also accurate algorithms for pattern classification and regression models. Many researchers have also improvised KNNs and the results obtained by these studies have changed a lot in terms of the accuracy of the results. The purpose of this paper is to see the improvement of several types of development of the KNN algorithm.

Zitieren

APA

Daulay, R. S. A., Efendi, S., & Suherman (2023). Review of Literature on Improving the KNN Algorithm. Transactions on Engineering and Computing Sciences. https://doi.org/10.14738/tecs.113.14768

Vancouver

Daulay RSA, Efendi S, Suherman. Review of Literature on Improving the KNN Algorithm. Transactions on Engineering and Computing Sciences. 2023. doi:10.14738/tecs.113.14768

BibTeX
@article{Daulay2023,
  author = {Daulay, Raja Sakti Arief and Efendi, Syahril and Suherman},
  title = {Review of Literature on Improving the KNN Algorithm},
  journal = {Transactions on Engineering and Computing Sciences},
  year = {2023},
  doi = {10.14738/tecs.113.14768}
}
Kostenlos starten →