scholarly journals Aplikasi Prediksi Kelulusan Mahasiswa Berbasis K-Nearest Neighbor (K-NN)

2019 ◽  
Vol 1 (1) ◽  
pp. 30-36 ◽  
Author(s):  
Lalu Abd Rahman Hakim ◽  
Ahmad Ashril Rizal ◽  
Dwi Ratnasari
Keyword(s):  
Nearest Neighbor ◽  
Educational Institution ◽  
Confusion Matrix ◽  
K Nearest Neighbor ◽  
Study Program ◽  
K Value ◽  
Student Graduation ◽  
K Nearest Neighbor Algorithm ◽  
Communication Planning ◽  
Fold Cross Validation

Students are important assets for an educational institution and for this reason, it is necessary to pay attention to the student's graduation rate on time. Presentation of the ups and downs of students' ability to complete their studies on time is one of the elements of campus accreditation assessment. Based on data from the Study Program Section in the last 3 years the student graduation presentation is only 25% of the total students who can complete their studies on time. In this study using the K-Nearest Neighbor algorithm which aims to be able to identify student graduation in new cases by adapting solutions from previous cases that have closeness to new cases. This algorithm has the role to get the value of the closeness of the new case to the old case, which in turn the most population in area K with the closest value obtained by the student is predicted whether to pass on time or not on time. This study uses Roger S. Pressman's waterfalll method, namely Communication, Planning, Modeling, and Construction. Based on the tests carried out using K-Fold Cross Validation, the highest accuracy in the third model was 80% when folded 4th and 61% when the K value = 1. While testing using the Confusion Matrix obtained the highest accuracy of 98% at K = 1 for classification "Timely", and 98% at K = 2 for classification "Not Timely"

scholarly journals Analysis K-Nearest Neighbor Algorithm for Improving Prediction Student Graduation Time

SinkrOn ◽  
2020 ◽  
Vol 4 (2) ◽  
pp. 42
Author(s):  
Rizki Muliono ◽  
Juanda Hakim Lubis ◽  
Nurul Khairina
Keyword(s):  
Higher Education ◽  
Nearest Neighbor ◽  
Training Data ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
Study Program ◽  
Sample Data ◽  
Student Graduation ◽  
K Nearest Neighbor Algorithm

Higher education plays a major role in improving the quality of education in Indonesia. The BAN-PT institution established by the government has a standard of higher education accreditation and study program accreditation. With the 4.0-based accreditation instrument, it encourages university leaders to improve the quality and quality of their education. One indicator that determines the accreditation of study programs is the timely graduation of students. This study uses the K-Nearest Neighbor algorithm to predict student graduation times. Students' GPA at the time of the seventh semester will be used as training data, and data of students who graduate are used as sample data. K-Nearest Neighbor works in accordance with the given sample data. The results of prediction testing on 60 data for students of 2015-2016, obtained the highest level of accuracy of 98.5% can be achieved when k = 3. Prediction results depend on the pattern of data entered, the more samples and training data used, the calculation of the K-Nearest Neighbor algorithm is also more accurate.

scholarly journals IMPLEMENTASI K-NEAREST NEIGHBORD PADA RAPIDMINER UNTUK PREDIKSI KELULUSAN MAHASISWA

2018 ◽  
Vol 10 (1) ◽  
pp. 35-41
Author(s):  
Sumarlin Sumarlin ◽  
Dewi Anggraini
Keyword(s):  
Cross Validation ◽  
Nearest Neighbor ◽  
Confusion Matrix ◽  
Training Data ◽  
K Nearest Neighbor ◽  
Process Data ◽  
Nearest Neighbor Algorithm ◽  
Student Graduation ◽  
K Nearest Neighbor Algorithm ◽  
Auc Value

Data on graduate students is an important part in determining the quality of a private and public university. Graduate data is included in important assessments in the accreditation process. Data from Uyelindo Kupang STIKOM graduates every year will continue to grow and accumulate like neglected data because it is rarely used. To maximize student data into information that can be used by universities, the data must be processed in this case used as training data in a study using data mining to obtain information in the form of predictions of graduation from Kupang Uyelindo STIKOM students. The method used in this study is K-Nearest Neighbor using rapidminer software to measure K-Nearest Neighbor's accuracy against student graduate data. The criteria used were in the form of student names, gender, cumulative achievement index (GPA) from semester 1 to 6. In applying the K-Nearest Neighbor algorithm can be used to produce predictions of student graduation. To measure the performance of the k-nearest neighbor algorithm, the Cross Validation, Confusion Matrix and ROC Curves methods are used, in this study using a 5-fold cross validation to predict student graduation. From 100 student dataset records Uyelindo Kupang STIKOM graduates obtained accuracy rate reached 82% and included a very good classification because it has an AUC value between 0.90-1.00, which is 0.971, so it can be concluded that the accuracy of testing of student graduation models using K-Nearest Neighbor (K-NN) algorithm is influenced by the number of data clusters. Accuracy and the highest AUC value of 5-fold validation is to cluster data k = 4 with the accuracy value of 90%.

scholarly journals Optimization of k value and lag parameter of k-nearest neighbor algorithm on the prediction of hotel occupancy rates

2020 ◽  
Vol 8 (3) ◽  
pp. 246-254
Author(s):  
Agus Subhan Akbar ◽  
R. Hadapiningradja Kusumodestoni
Keyword(s):  
Nearest Neighbor ◽  
Business Management ◽  
Training Data ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
K Value ◽  
Sample Data ◽  
K Nearest Neighbor Algorithm ◽  
Occupancy Rates ◽  
Fold Cross Validation

Hotel occupancy rates are the most important factor in hotel business management. Prediction of the rates for the next few months determines the manager's decision to arrange and provide all the needed facilities. This study performs the optimization of lag parameters and k values of the k-Nearest Neighbor algorithm on hotel occupancy history data. Historical data were arranged in the form of supervised training data, with the number of columns per row according to the lag parameter and the number of prediction targets. The kNN algorithm was applied using 10-fold cross-validation and k-value variations from 1-30. The optimal lag was obtained at intervals of 14-17 and the optimal k at intervals of 5-13 to predict occupancy rates of 1, 3, 6, 9, and 12 months later. The obtained k-value does not follow the rule at the square root of the number of sample data.

scholarly journals Application Development of Student's Graduation Classification Model based on The First 2 Years Performance using K-Nearest Neighbor

2018 ◽  
Author(s):  
Purwono Prasetyawan ◽  
Muhammad Faridz Abadi
Keyword(s):  
Cross Validation ◽  
Nearest Neighbor ◽  
Educational Institution ◽  
Training Data ◽  
Classification Model ◽  
K Nearest Neighbor ◽  
Application Development ◽  
K Value ◽  
The Status ◽  
Fold Cross Validation

A College keeps a lot of data such as, academic data, administration, student biodata and others. The existing student data has not been fully utilized. In the student education system is an important asset for an educational institution and for that it is necessary to note the graduation rate of students on time. Differences in the ability of students to complete the study on time required the monitoring and evaluation, so that it can find new information or knowledge to make decisions. The purpose of this study, to know the relationship between IP variables Semester 1, IP Semester 2, IP Semester 3, IP Semester 4, Gender, Student Status on Student Study Duration using k-nearest neighbor algorithm. The result of this research in the classification of students' graduation using the knn algorithm based on student status, gender, ip semester 1 - ip semester 4 with k-fold cross validation in can mean value of K1 accuracy 88%, K3 accuracy 88.67%, K5 accuracy of 93.78%, K7 86% accuracy, K9 accuracy 86.22%, K11 accuracy 92.44%, K13 accuracy 89.55%, K15 accuracy 93.78%, K17 accuracy 99.78%, and K19 accuracy 100 %. Of the 500 training data in the status of 188 students, 312 students, the status of students work longer in completing the lecture and in the gender of 290 men, 210 women, then women longer in finishing college. Finding the optimal k value using k-fold cross validation. The result of accuracy using k-fold cross validation is K19 with 100% accuracy.

IDENTIFICATION OF HOAX BASED ON TEXT MINING USING K-NEAREST NEIGHBOR METHOD

2022 ◽  
Vol 10 (2) ◽  
pp. 217
Author(s):  
I Wayan Santiyasa ◽  
Gede Putra Aditya Brahmantha ◽  
I Wayan Supriana ◽  
I GA Gede Arya Kadyanan ◽  
I Ketut Gede Suhartana ◽  
...  
Keyword(s):  
Nearest Neighbor ◽  
The Internet ◽  
Test Results ◽  
K Nearest Neighbor ◽  
K Value ◽  
The Public ◽  
A Value ◽  
K Nearest Neighbor Algorithm ◽  
Time Information ◽  
Fold Cross Validation

At this time, information is very easy to obtain, information can spread quickly to all corners of society. However, the information that spreaded are not all true, there is false information or what is commonly called hoax which of course is also easily spread by the public, the public only thinks that all the information circulating on the internet is true. From every news published on the internet, it cannot be known directly that the news is a hoax or valid one. The test uses 740 random contents / issue data that has been verified by an institution, where 370 contents are hoaxes and 370 contents are valid. The test uses the K-Nearest Neighbor algorithm, before the classification process is performed, the preprocessing stage is performed first and uses the TF-IDF equation to get the weight of each feature, then classified using K-Nearest Neighbor and the test results is evaluated using 10-Fold Cross Validation. The test uses the k value with a value of 2 to 10. The optimal use of the k value in the implementation is obtained at a value of k = 4 with precision, recall, and F-Measure results of 0.764856, 0.757583, and 0.751944 respectively and an accuracy of 75.4%

scholarly journals Application of Data Mining Classification Method for Student Graduation Prediction Using K-Nearest Neighbor (K-NN) Algorithm

2018 ◽  
Vol 1 (1) ◽  
pp. 1-8
Author(s):  
Mohammad Imron ◽  
Satia Angga Kusumah
Keyword(s):  
Data Mining ◽  
Graduation Rate ◽  
Nearest Neighbor ◽  
High Accuracy ◽  
Classification Method ◽  
K Nearest Neighbor ◽  
Data Mining Technique ◽  
Study Program ◽  
Mining Technique ◽  
Student Graduation

The student graduation rate is one of the indicators to improve the accreditation of a course. It is needed to monitor and evaluate student graduation tendencies, timely or not. One of them is to predict the graduation rate by utilizing the data mining technique. Data Mining Classification method used is the algorithm K-Nearest Neighbor (K-NN). The data used comes from student data, student value data, and student graduation data for the year 2010-2012 with a total of 2,189 records. The attributes used are gender, school of origin, IP study program Semester 1-6. The results showed that the K-NN method produced a high accuracy of 89.04%.

scholarly journals Security System Aided by Voice Fingerprint

2021 ◽  
Vol 14 (1) ◽  
pp. 24-29
Author(s):  
Gabriel Popan ◽  
Lorena Muscar ◽  
Lacrimioara Grama
Keyword(s):  
Private Information ◽  
Nearest Neighbor ◽  
Confusion Matrix ◽  
Training Model ◽  
Security System ◽  
Fingerprint Recognition ◽  
K Nearest Neighbor ◽  
Mel Frequency Cepstral Coefficients ◽  
K Nearest Neighbor Algorithm ◽  
Audio Files

Abstract The goal of this paper is to create a security system to identify a specific person who wants to access private information or enter a building using their voice. To perform this system, we identified a database containing the audio files of the users who will be able to authenticate with this system. Several steps were sequentially performed in order to extract the characteristics of the Mel Frequency Cepstral Coefficients from the audio files. Based on the k-Nearest Neighbor algorithm with an Euclidean distance and 4 neighbors, a training model was created. Through experimental results we prove in two ways, using confusion matrix and scatter plot, that the overall voice fingerprint recognition is 100%, for this particular configuration.

Temporal Prediction on Students’ Graduation using Naïve Bayes and K-Nearest Neighbor Algorithm

2021 ◽  
Vol 5 (2) ◽  
pp. 682
Author(s):  
Ahmad Marzuqi ◽  
Kusuma Ayu Laksitowening ◽  
Ibnu Asror
Keyword(s):  
Nearest Neighbor ◽  
Naive Bayes ◽  
Naïve Bayes ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
Temporal Prediction ◽  
Study Programs ◽  
Level 3 ◽  
Student Graduation ◽  
K Nearest Neighbor Algorithm

Accreditation is a form of assessment of the feasibility and quality of higher education. One of the accreditation assessment factors is the percentage of graduation on time. A low percentage of on-time graduations can affect the assessment of accreditation of study programs. Predicting student graduation can be a solution to this problem. The prediction results can show that students are at risk of not graduating on time. Temporal prediction allows students and study programs to do the necessary treatment early. Prediction of graduation can use the learning analytics method, using a combination of the naïve bayes and the k-nearest neighbor algorithm. The Naïve Bayes algorithm looks for the courses that most influence graduation. The k-nearest neighbor algorithm as a classification method with the attribute limit used is 40% of the total attributes so that the algorithm becomes more effective and efficient. The dataset used is four batches of Telkom University Informatics Engineering student data involving data index of course scores 1, level 2, level 3, and level 4 data. The results obtained from this study are 5 attributes that most influence student graduation. As well as the results of the presentation of the combination naïve bayes and k-nearest neighbor algorithm with the largest percentage yield at level 1 75.40%, level 2 82.08%, level 3 81.91%, and level 4 90.42%.

scholarly journals Bayes Classifier dan Support Vector Machine dalam Klasifikasi Judul Karya Akhir Mahasiswa Program Studi PTIK UNJ

2019 ◽  
Vol 3 (1) ◽  
pp. 54-62
Author(s):  
Razi Aziz Syahputro ◽  
Widodo ◽  
Hamidillah Ajie
Keyword(s):  
Support Vector Machine ◽  
Cross Validation ◽  
Nearest Neighbor ◽  
Confusion Matrix ◽  
Vector Space Model ◽  
Support Vector ◽  
Bayes Classifier ◽  
K Nearest Neighbor ◽  
Space Model ◽  
Fold Cross Validation

Penelitian ini dilatarbelakangi dengan dibutuhkannya sistem pengklasifikasian untuk memudahkan pihak Jurusan Teknik Elektro khususnya Program Studi PTIK untuk mengklasifikasikan judul skripsi berdasarkan peminatan. Sebelum sistem dibuat diperlukan pertimbangan dari beberapa algoritma klasifikasi yang ada, maka dari itu penelitian ini memilih 3 algoritma dari 10 algoritma terbaik menurut ICDM tahun 2006. Klasifikasi terhadap dokumen teks pendek seperti judul skripsi mahasiswa memiliki kesulitan tersendiri daripada dokumen teks panjang karena semakin sedikit kata semakin sulit diklasifikasi. Sehingga tujuan dari penelitian ini adalah untuk mengetahui algoritma yang paling efektif untuk mengklasifikasi judul skripsi. Penelitian ini terdiri dari beberapa tahap yaitu pengumpulan data, pengelompokan data melalui angket oleh dosen ahli, pre-processing text, pembobotan kata menggunakan vector space model dan tf-idf, evaluasi dengan k-fold cross validation, klasifikasi menggunakan k-nearest neighbor, naïve bayes classifier, dan support vector machine, dan analisis dengan confusion matrix. Percobaan dilakukan dengan menggunakan 266 data judul skripsi mahasiswa PTIK UNJ dari angkatan 2010-2013, dengan data terakhir berasal dari sidang skripsi pada semester 105(semester ganjil 2016/2017). Hasil dari klasifikasi menggunakan algoritma tersebut didapatkan algoritma yang paling efisien yaitu support vector machine dengan akurasi 82% dari 10 kali percobaan.

scholarly journals PREDIKSI HASIL PEMILU LEGISLATIF MENGGUNAKAN ALGORITMA K-NEAREST NEIGHBOR BERBASIS BACKWARD ELIMINATION

2020 ◽  
Vol 3 (1) ◽  
pp. 27-41
Author(s):  
Achmad Saiful Rizal ◽  
Moch. Lutfi
Keyword(s):  
Data Mining ◽  
Nearest Neighbor ◽  
Political Elite ◽  
Data Mining Algorithm ◽  
K Nearest Neighbor ◽  
Nearest Neighbor Algorithm ◽  
Backward Elimination ◽  
K Nearest Neighbor Algorithm ◽  
Fold Cross Validation ◽  
Selection Of

Elections in Indonesia from period to period have undergone some changes. Elections legislative candidates not determined voters, but instead became a political elite authority in accordance with the order of the list of legislative candidates and their number sequence. To perform a prediction one of them with data mining. Data mining can be applied in the political sphere for example to predict the results of the legislative election and others. K-nearest neighbor algorithm is one of the data mining algorithm that performs classification based on learning object against which are closest to the object. Election-related research has been done with the k-nearest neighbor algorithm, but accuracy is obtained that method is still too low, so it takes an additional algorithm to improve accuracy. In this study, the proposed method, namely the method of k-nearest neighbor method combined with backward elimination as a selection of features. The dataset that will be used in the study comes from the KPU Sidoarjo that has special attributes 1 and 13 regular attributes. From the results of the analysis and computation of some methods, it can be concluded that the method of k-nearest neighbor method combined with backward elimination produced some conclusions. First, of the 14 attributes in the dataset, retrieved 8 most influential attribute. Second, the best accuracy are of 96.03% when k = 2 and tested by 10 fold cross validation.

Sign in / Sign up

Export Citation Format

Share Document