Publication Search

Mitra Telur is an egg producer located in Pirakbulus, Sidumulyo, Godean District, Sleman Regency, Special Region of Yogyakarta. So far, Mitra Telur UMKM has not determined a travel route to distribute the eggs. The distribution carried out does not take into account the distance traveled to reach the shop points. This research uses two methods at once, namely saving matrix and nearest neighbor. Based on the calculation results, the initial route has a total distance of 114.9km with 4 delivery routes, while the final route has a total distance of 95.5km with 3 delivery routes. The initial route has a fixed cost of IDR 1,550,000 and a variable cost of IDR 402,150 with a total delivery cost of IDR 1,952,150, while the final route has a fixed cost of IDR 1,550,000 and a variable cost of IDR 334,250 with a total delivery cost of IDR 1,884,250. there was a reduction in distribution routes by 16.9% and a reduction in production costs by 3.5%.

This research relates to predictions of laptop sales in computer shops in Central Aceh, with a focus on laptop brands Acer, Asus, HP and Lenovo. Over the last three years, sales of these laptops have reached 1,629 units, with a monthly average of between 108 and 150 units. Business owners today prefer brands with the highest percentage of sales, but this can lead to dead stock problems. Therefore, the author proposes using data mining techniques, especially the K-Nearest Neighbor (K-NN) method, to make recommendations for the number of products to be purchased by business owners based on past sales data. The K-NN method requires complete, structured and continuous sales data. It is important to choose an appropriate K value, and other factors such as weather, seasons, promotions, and special events also affect laptop sales. K-NN models may need to be combined with other data to improve prediction accuracy. It is hoped that this research will provide academic benefits in expanding knowledge about the use of the K-NN method in sales prediction, as well as practical benefits for business owners in planning their sales strategies. The research conclusions highlight the importance of good data collection, choosing the right K value, and considering external factors in the laptop sales prediction process.      

Fraudsters increasingly exploit unauthorized credit card information for financial gain, targeting un-suspecting users, especially as financial institutions expand their services to semi-urban and rural areas. This, in turn, has continued to ripple across society, causing huge financial losses and lowering user trust implications for all cardholders. Thus, banks cum financial institutions are today poised to implement fraud detection schemes. Five algorithms were trained with and without the application of the Synthetic Minority Over-sampling Technique (SMOTE) to assess their performance. These algorithms included Random Forest (RF), K-Nearest Neighbors (KNN), Naïve Bayes (NB), Support Vector Machines (SVM), and Logistic Regression (LR). The methodology was implemented and tested through an API using Flask and Streamlit in Python. Before applying SMOTE, the RF classifier outperformed the others with an accuracy of 0.9802, while the accuracies for LR, KNN, NB, and SVM were 0.9219, 0.9435, 0.9508, and 0.9008, respectively. Conversely, after the application of SMOTE, RF achieved a prediction accuracy of 0.9919, whereas LR, KNN, NB, and SVM attained accuracies of 0.9805, 0.9210, 0.9125, and 0.8145, respectively. These results highlight the effectiveness of combining RF with SMOTE to enhance prediction accuracy in credit card fraud detection.

The occurrence of scorch during the production of flexible polyurethane is a significant issue that negatively impacts foam products' resilience and generally jeopardizes their integrity. The likelihood of foam product failure can be decreased by optimizing production variables based on machine learning algorithms used to predict the occurrence of scorch. Investigating technology is required because prevention is the best approach to dealing with this problem. Hence, machine learning algorithms were trained to predict the occurrence of scorch using the thermodynamic profile of polyurethane foam, which is made up of recorded production variables. A variety of heuristics algorithms were trained and assessed for how well they performed, namely XGBoost, Decision trees, Random Forest, K-nearest neighbors, Naive Bayes, Support Vector Machines, and Logistic Regression. The XGboost ensemble was found to perform best. It outperformed others with an accuracy of 98.3% (i.e., 0.983), followed by logistic regression, decision tree, random forest, K-nearest neighbors, and naïve Bayes, yielding a training accuracy of 88.1%, 66.7%, 84.2%, 87.5%, and 67.5% respectively. The XGBoost was finally used, yielding 2-distinct cases of non(occurrence) of scorch. Ensemble demonstrates that it is quite capable and is an effective way to predict the occurrence of scorch.

This research is intended to design a waste bank information system through an action research approach. The object in this study is a group of waste banks under the auspices of the Guwosari Training Center, Bantul Regency. The new system built will strengthen ease of use (easy to use). Two things are proposed in this study, namely improvements to the waste bank manual information system that is already running as an initial diagnosis and the transition from the manual recording system to digital recording through computer devices (applications) with centralized data in one database.

Rice plays a vital role as the main food source for almost half of the global population, contributing more than 21% of the total calories humans need. Production predictions are important for determining import-export policies. This research proposes the XGBoost method to predict rice harvests globally using FAO and World Bank datasets. Feature analysis, removal of duplicate data, and parameter tuning were carried out to support the performance of the XGBoost method. The results showed excellent performance based on which reached 0.99. Evaluation of model performance using metrics such as MSE, and MAE measured by k-fold validation show that XGBoost has a high ability to predict crop yields accurately compared to other regression methods such as Random Forest (RF), Gradient Boost (GB), Bagging Regressor (BR) and K-Nearest Neighbor (KNN). Apart from that, an ablation study was also carried out by comparing the performance of each model with various features and state-of-the-art. The results prove the superiority of the proposed XGBoost method. Where results are consistent, and performance is better, this model can effectively support agricultural sustainability, especially rice production.

The purpose of writing this article is to determine the application of the nearest neighbor classification algorithm in diabetes detection. This nearest neighbor classification algorithm is a classification method often used to classify objects based on available data. This method works by searching for the closest objects in the dataset and classifying the new objects based on the closest object category. The application of the KNN algorithm can be carried out in various fields, such as analyzing the feasibility of credit granting, classifying online news materials or diagnosing diabetes. In this article, the researcher uses a literature review research method assisted by a descriptive analysis approach, to analyze the data and by describing the data that has been previously collected where the author describes data that has been obtained from various literary sources such as journals, data and others. The data obtained will be analyzed and interpreted in accordance with the objective of this research, which is to determine the application of nearest neighbor classification to detect diabetes.

Pabrik Roti Bakar Azhari adalah perushaan industri yang bergerak dibidang roti bakar. Perusahaan ini masih terdapat permasalahan dalam distribusinya, adanya pengiriman yang tidak terjadwal dan tidak memaksimalkan kapasitas angkut kendaraan mengakibatkan jarak pengiriman semakin panjang. Penentuan rute distribusi merupakan hal yang penting bagi perusahaan untuk meminimalkan biaya distribusi. Sebagai pabrik produsen roti bakar , pemilihan rute yang optimal perlu menjadi perhatian Pabrik Roti Bakar Azhari karena mempengaruhi biaya pengiriman produk tersebut. Saving Matrix dan Nearest Neighbor adalah kombinasi metode yang digunakan untuk penentuan rute distribusi yang optimal. Metode saving matrix dapat menentukan rute gabungan yang optimal dengan mempertimbangkan kapasitas kendaraan distribusi selanjutnya algoritma nearest neighbor dapat menentukan urutan jarak pengiriman terpendek pada kelompok rute yang terbentuk. Penelitian ini berhasil mendapatkan rute distribusi menggunakan metode saving matrix dan nearest neighbor yang lebih baik dari segi jarak tempuh pengiriman dan biaya dsitribusi. Hasil yang diperoleh adalah pengelompokan 4 rute distribusi dari jarak rute awal adalah 139,3 km dan jarak rute akhir adalah 109,2 km. Hasil  biaya distribusi rute awal sebesar Rp Rp 4.751.233 / bulan dan biaya distribusi rute akhir sebesar Rp 4.521.058 / bulan. Dengan metode saving matrix dan  algoritma nearest neighbor adalah penghematan jarak sebesar 21,61%, dan penghematan biaya distribusi sebesar 4,85%.

Scholarships are a form of assistance in the form of educational expenses provided by the government or foundations to students or students who are categorized as from underprivileged families. However, in datermining scholarship recipients, there are still many scholarship recipients who come from wealthy families, while those from less fortunate families do not receive this assistance. This may be due to calculations and data processing that still use manual methods, causing scholarship recipients to not be on target. The purpose of this research is to simplify and minimize calculation errors in determining scholarship recipients for the Smart Indonesia Program (PIP) at SMK Karya Medika. Therefore, for calculating and processing PIP scholarship recipients data, data mining techniques can use the calssification method using the K-NN algprithm. K-Nearest Neighbor is a data classification method that will be used for data objects based on learning data that is closer to the object. In this study using the Confusion Matrix test so as to obtain an accuracy value of 80.00%.     

The main problem of the Traveling Salesman Problem is that a salesman travels to several places to go with a known distance and then returns to his original place by using the shortest route from his journey, and all the places the salesman goes to are only allowed once. This research focuses on the problem of distributing goods at PT. The Medan Nugraha Ekakurir (JNE) route with the destination delivery address in the Medan area. The Cheapest Insertion Heuristic Algorithm is an algorithm used to form tours (travels) by gradually building the shortest path route with minimal weight, by adding new points one at a time. One. The Nearest Neighbor Algorithm is a simple and fast algorithm to build a feasible initial tour length from TSP where the technique takes the shortest distance from the initial position regardless of other distances. This study resulted in the conclusion that the application of the cheapest insertion heuristic and nearest neighbor algorithms in terms of finding the distance to the problem of shipping goods at PT. The Medan Nugraha Ekakurir (JNE) route starts with finding the distance between addresses with the help of google maps, then continues with the help of the WinQSB software. Based on the research results obtained using the cheapest insertion heuristic and nearest neighbor algorithms, it is obtained that the search for the shortest route distance for shipping goods at PT. The smaller Medan Nugraha Ekakurir (JNE) route is generated by the nearest neighbor algorithm. This shows that the nearest neighbor algorithm is more effective in terms of finding the traveling distance on the Traveling Salesman Problem problem of shipping goods at PT. Medan's Nugraha Ekakurir (JNE) Line.

Phishing is a crime that uses social engineering techniques, both in deceptive statements and technically, to steal consumers' personal identification data and financial account credentials. With the new Phishing machine learning approach, websites can be recognized in real-time. K-Nearest Neighbor(KNN) and Naïve Bayes (NB) are popular machine learning approaches. KNN and NB have their own strengths and weaknesses. By combining the two, deficiencies can be covered. So this study proposes to combine K-Nearest Neighbor with Naïve Bayes to classify phishing websites. Based on the results of the accuracy test of the combination of KNN with k=8 and Naïve Bayes, a maximum accuracy of 93.44% is produced. This result is 6.25% superior compared to using only one classifier.

Skin is the largest organ in humans, it functions as the outermost protector of the organs inside. Therefore, the skin is often attacked by various diseases, especially cancer. Skin cancer is divided into two, namely benign and malignant. Malignant has the potential to spread and increase the risk of death. Skin cancer detection traditionally involves time-consuming laboratory tests to determine malignancy or benignity. Therefore, there is a demand for computer-assisted diagnosis through image analysis to expedite disease identification and classification. This study proposes to use the K-nearest neighbor (KNN) classifier and Gray Level Co-occurrence Matrix (GLCM) to classify these two types of skin cancer. Apart from that, the average filter is also used for preprocessing. The analysis was carried out comprehensively by carrying out 480 experiments on the ISIC dataset. Dataset variations were also carried out using random sampling techniques to test on smaller datasets, where experiments were carried out on 3297, 1649, 825, and 210 images. Several KNN parameters, namely the number of neighbors (k)=1 and distance (d)=1 to 3 were tested at angles 0, 45, 90, and 135. Maximum accuracy results were 79.24%, 79.39%, 83.63%, and 100% for respectively 3297, 1649, 825, and 210. These findings show that the KNN method is more effective in working on smaller datasets, besides that the use of the average filter also has a significant contribution in increasing the accuracy.

Penelitian ini bertujuan untuk menerapkan algoritma K-Nearest Neighbor (KNN) dalam pengenalan pola tulisan tangan angka 0-9. Penelitian ini menggunakan data sekunder berupa gambar angka 0-9 dalam bentuk bitmap yang diunduh dari internet. Setiap gambar angka diubah menjadi fitur numerik menggunakan metode ekstraksi fitur Zoning. Selanjutnya, data fitur numerik tersebut diuji menggunakan metode KNN untuk memprediksi angka yang ditulis.

Accurate weather prediction information is important for various fields that are closely related to weather forecasting, such as agriculture, fisheries and many more. Because precise weather forecasts are very useful for various fields of carrying out various activities. Because of that, it is necessary to make an application to find weather or rainfall prediction information, so that the information can be utilized optimally by the community. In this journal the authors apply the k-nearest neighbors (k-NN) method based on rainfall data obtained from the Bogor climatology station from 2016-2017 and the test results show that the predicted rainfall for the Bogor area with the K-Nearest Neighbor algorithm obtained a value of 0, 93148.  

Di Indonesia jagung sering digunakan sebagai komoditas utama makanan pokok selain nasi. Tanaman jagung memiliki potensi terkena penyakit ataupun serangan hama kapan saja yang menyebabkan gagal panen. Penyakit yang dapat menyerang tanaman jagung bisa dilihat dari perubahan daun. Deteksi dini terhadap penyakit dapat mencegah penyakit menyebar lebih luas, salah satunya dengan perubahan yang terjadi pada daun jagung. Penelitian ini mencoba melakukan identifikasi daun yang tidak sehat dengan cara ekstraksi ciri dan warna pada citra untuk mendeteksi penyakit daun tanaman jagung yaitu hawar, bercak dan karat. Proses klasifikasi citra dilakukan melalui akusisi citra menjadi data latih dan uji, kemudian menghitung nilai hasil fitur ekstraksi warna dan ekstraksi ciri. GLCM (Gray-Level Cooccurrence Matrix) sebagai ekstraksi ciri dan HSV sebagai ekstraksi warna. KNN (K Nearest Neighbors) dengan jarak Euclidean untuk klasifikasi. Dari 160 data citra latih dan 40 citra uji menggunakan algoritma KNN-HSV-GLCM didapatkan hasil akurasi terbaik.yaitu 85% dengan menggunakan dengan nilai k adalah 3 dan jarak piksel 1 dan akurasi terendah dengan nilai k adalah 3 dan jarak piksel 3 sebesar 70%.

With the increasing development of technology the more variety of books circulating on the internet. As is the recommendation system on online book sites that provide books relevantly and as needed with one's preferences. One alternative is GoodReads, a social networking site that specializes in cataloging books and users can share reading book recommendations with each other by rating, reviewing, and commenting. As a large book recommendation site, it has a lot of data that can be processed by applying machine learning methods, but still not known as the most accurate model. By using the right model, we can provide more accurate recommendations. Therefore, this study will analyze the data obtained from the www.kaggle.com namely the goodreads-books dataset. This study proposed a data mining classification model to get the best model in recommending books on GoodReads. The algorithms used are Decision Tree, K-Nearest Neighbor, Naïve Bayes, Random Forest, and Support Vector Classifier, then for model evaluation using accuracy, precision, recall, f1-score, confusion matrix, AUC, and Mean Error Absolute. The test results of several classification algorithms found that Decision Tree has the highest accuracy among the methods presented by 99.95%, precision by 100%, recall by 96%, f1-score of 98% with MAE of 0.05 and AUC of 99.96%. This is proof that decision tree algorithms can be used as book recommendations based on book categories on GoodReads.

Hepatitis merupakan penyakit yang diderita oleh banyak orang, bahkan bisa menyebabkan kematian. Prediksi awal dapat mencegah kematian tersebut yaitu denganmengumpulkan data pasien hepatitis yang dilihat dari faktor - faktornya. Faktor-faktor tersebut antara lain Protime, Alk Phosphat, Albumin, Bilirubin dan Usia. Untuk mengolah datatersebut, dibutuhkan Data Mining. Salah satu metode data mining yang digunakan pada penelitian ini adalah klasifikasi.Tujuan penelitian ini yaitu bagaimana memprediksi hidup atau meninggalnya pasien penyakit hepatitis dengan tingkat akurasi dan mencari atribut paling berpengaruh terhadapprediksi hidup atau meninggalnya pasien penyakit hepatitis dengan menggunakan algoritma Algoritma K-Nearest Neighbor, Naïve Bayes Dan Neural Network dan kemudianmembandingkan ketiga hasil analisis dari ketiga algoritma tersebut.Dari hasil analisis 20 atribut dilakukan 3 kali percobaan dengan algoritma Naïve Bayes didapat model klasifikasi dengan tingkat akurasi yang terbaik yaitu 76.92 %, tingkat error23.01% dan atribut Acites dan Spider merupakan atribut yang berpengaruh terhadap keputusan hidup atau meninggalnya pasien yang terkena penyakit hepatitis.Dengan menggunakanAlgoritma Neural Network didapat model klasifikasi dengan tingkat akurasi yang terbaik yaitu 82,97%, tingkat error 17.03% dan atribut yang paling berpengaruh yaitu anorexia, spiders dan protime. Dengan menggunakan algoritma K-Nearest Neighbor didapat model klasifikasi dengan tingkat akurasi terbaik yaitu 93%, tingkat error 7% dan atribut yang paling berpengaruh terhadap penderita penyakit hepatitis yaitu Albumin.

Data akademik perguruan tinggi bertambah setiap tahunnya sejalan dengan bertambahnya jumlah mahasiswa. Data yang berlimpah menyimpan informasi yang berlimpah juga.. Teknologi data mining merupakan alat bantu untuk penambangan informasi pada basis data berukuran besar dan telah banyak digunakan pada banyak domain. Memprediksi kinerja (evaluasi belajar) mahasiswa adalah suatu kegiatan untuk menentukan suatu kondisi dimasa depan berdasarkan data yang telah ada. SLIQ merupakan algoritma yang dikembangkan oleh tim proyek IBM’s Quest pada tahun 1996 dapat digunakan untuk dataset yang besar. Penggunaan algoritma SLIQ untuk mengklasifikasikan dan memprediksi kinerja mahasiswa sudah digunakan pada penelitian sebelumnya dengan hasil tingkat akurasi yang masih rendah dikarenakan banyaknya pembatasan. Selanjutnya dilakukan implementasi algoritma Nearest Neighbor yang menggunakan pendekatan untuk mencari kasus dengan menghitung kedekatan antara kasus baru dengan kasus lama, yaitu berdasarkan pada pencocokan bobot dari sejumlah fitur yang ada. Dari hasil penelitian ini kemudian dibandingkan tingkat akurasi dari hasil prediksi tersebut. Dari sistem yang dihasilkan dapat disimpulkan bahwa algoritma SLIQ dengan teknik pohon keputusan mempunyai tingkat akurasi prediksi yang lebih rendah dibandingkan dengan tingkat akurasi dari penggunaan algoritma nearest neighbor. Kata kunci : SLIQ, Nearest Neighbor, prediksi kinerja, akurasi