Penerapan Algoritma K-Nearest Neighbor dengan Euclidean Distance untuk Menentukan Kelompok Uang Kuliah Tunggal Mahasiswa

نویسندگان

چکیده

Single tuition fee or called UKT is the amount of determined based on student's economic ability. In its application, there are still many students who object to group that obtained. Therefore, university must apply right and accurate method in group. This study aims obtain result student’s classification using K-Nearest Neighbor (KNN) algorithm with Euclidean Distance calculation determine accuracy optimal k value. used a quantitative descriptive approach. The data collection techniques interviews, literature study, documentation. has been collected 1,650 verification for 2019-2021 which be processed mining RStudio software. results showed KNN can applied UKT. With testing as 320 students, 23 were get I, 149 II, 129 III, 32 IV, 2 got V. 87.58% Good Classification category. obtained K-Fold Cross Validation k=1.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest path distance in random k-nearest neighbor graphs

Consider a weighted or unweighted k-nearest neighbor graph that has been built on n data points drawn randomly according to some density p on R. We study the convergence of the shortest path distance in such graphs as the sample size tends to infinity. We prove that for unweighted kNN graphs, this distance converges to an unpleasant distance function on the underlying space whose properties are...

متن کامل

K-Local Hyperplane and Convex Distance Nearest Neighbor Algorithms

Guided by an initial idea of building a complex (non linear) decision surface with maximal local margin in input space, we give a possible geometrical intuition as to why K-Nearest Neighbor (KNN) algorithms often perform more poorly than SVMs on classification tasks. We then propose modified K-Nearest Neighbor algorithms to overcome the perceived problem. The approach is similar in spirit to Ta...

متن کامل

Distance-Constraint k-Nearest Neighbor Searching in Mobile Sensor Networks

The κ-Nearest Neighbors ( κNN) query is an important spatial query in mobile sensor networks. In this work we extend κNN to include a distance constraint, calling it a l-distant κ-nearest-neighbors (l-κNN) query, which finds the κ sensor nodes nearest to a query point that are also at or greater distance from each other. The query results indicate the objects nearest to the area of interest tha...

متن کامل

A New Distance-weighted k-nearest Neighbor Classifier

In this paper, we develop a novel Distance-weighted k -nearest Neighbor rule (DWKNN), using the dual distance-weighted function. The proposed DWKNN is motivated by the sensitivity problem of the selection of the neighborhood size k that exists in k -nearest Neighbor rule (KNN), with the aim of improving classification performance. The experiment results on twelve real data sets demonstrate that...

متن کامل

Drought Monitoring and Prediction using K-Nearest Neighbor Algorithm

Drought is a climate phenomenon which might occur in any climate condition and all regions on the earth. Effective drought management depends on the application of appropriate drought indices. Drought indices are variables which are used to detect and characterize drought conditions. In this study, it was tried to predict drought occurrence, based on the standard precipitation index (SPI), usin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Edumatic : jurnal pendidikan informatika

سال: 2022

ISSN: ['2549-7472']

DOI: https://doi.org/10.29408/edumatic.v6i2.6547