Vol. 1 No. 1 (2024), Articles
Vol. 1 No. 1 (2024)

K - YAQIN QO'SHNI ALGORITMI

Articles
Published 2024-12-22
Onarkulov Maksadjon Karimberdiyevich
Amaliy matematika va informatika kafedrasi dotsenti maxmaqsad@gmail.com
Yusupov Mirsaid Abdulaziz o‘g‘li
Farg‘ona davlat universiteti o’qituvchisi mirsaidbeky@gmail.com
Ismoilova Mohinurbonu Is’hoqjon qizi
Farg‘ona davlat universiteti 3-kurs talabasi mohinur7479@gmail.com
PDF

Keywords

K-yaqin qo‘shnilar algoritmi, mashinani o‘rganish, tasniflash, regressiya, masofa o‘lchovlari, modelni optimallashtirish.

Abstract

K - yaqin qo‘shni (k -NN) algoritmi sun’iy intellekt va mashina o‘rganish sohalarida keng tarqalgan va oddiy, ammo samarali tasniflash va regressiya metodlaridan biridir. Ushbu tezisda, k - yaqin qo‘shni algoritmning nazariy asoslari, amaliy qo‘llanilishi, kuchli tomonlari va cheklovlari, shuningdek, takomillashtirish va optimallashtirish usullari ko‘rib chiqiladi.

PDF

References

1. Cover, T., & Hart, P. (1967). Nearest neighbor pattern classification. “IEEE Transactions on Information Theory”, 13(1), 21–27.

2. Altman, N. S. (1992). An introduction to kernel and nearest-neighbor nonparametric regression. “The American Statistician”:, 46(3), 175–185.

3. Han, J., Kamber, M., & Pei, J. (2011). “Data Mining: Concepts and Techniques” (3rd ed.). Elsevier.

4. Bishop, C. M. (2006). “Pattern Recognition and Machine Learning”. Springer.

5. Zhang, X., & Zhao, L. (2015). A review of the K-nearest neighbor algorithm in data mining. “International Journal of Computer Science and Technology”, 6(2), 61-64.