Student graduation is very important for world education achievement, student graduation also influences the value of accreditation of an educational unit itself, therefor research on graduation prediction becomes a very interesting thing... more
Student graduation is very important for world education achievement, student graduation also influences the value of accreditation of an educational unit itself, therefor research on graduation prediction becomes a very interesting thing study, this study proposes the use of the K-Nearest Neighbor method to do predict student graduation at Anak Bangsa Private Vocational School. The result of the research is the value of k=5 with an accuracy rate of 93.55% which is determined as K-Optimal. The value of k=5 is applied to the K-NN algoritma to predict student graduation based on attendance, attitude, and value of knowledge.
Metode Greedy adalah salah satu cara atau teknik merancang suatu algoritma. Metode Greedy digunakan untuk mendapatkan solusi optimal dari suatu permasalahan. Salah satu permasalahan yang dapat diselesaikan dalam metode Greedy adalah... more
Metode Greedy adalah salah satu cara atau teknik merancang suatu algoritma. Metode Greedy digunakan untuk mendapatkan solusi optimal dari suatu permasalahan. Salah satu permasalahan yang dapat diselesaikan dalam metode Greedy adalah masalah Coloring Graph atau pewarnaan graf. Pewarnaan graf adalah proses pelabelan setiap simpul dalam graf dengan label tertentu (warna) sehingga tidak ada dua simpul bertetanggan yang memiliki warna yang sama. Pewarnaan graf dapat diaplikasikan dalam berbagai bidang atau masalah. Salah satu aplikasi pewarnaan graf adalah dalam masalah pewarnaan lampu lalulintas. Dalam pewarnaan lampu lalulintas, setiap jalur dinyatakan sebagai simpul dan sisi menggambarkan bahwa kedua jalur yang terhubung oleh sisi tersebut berjalan secara bersamaan sehingga terjadi konflik. Tujuan dari penerapan graf pada masalah pewarnaan lampu lalulintas adalah agar mengetahui jalur-jalur mana yang terjadi konflik dan jalur mana saja yang diperbolehkan. Adapun tantangan dari proble...
In a large city, there are many congestion problems, so the selection of the fastest route to reach the destination is needed. The city of Bandung is one of the big cities in Indonesia which has a fairly crowded traffic density and tends... more
In a large city, there are many congestion problems, so the selection of the fastest route to reach the destination is needed. The city of Bandung is one of the big cities in Indonesia which has a fairly crowded traffic density and tends to be a lot of congestion in it. So we need a study that can discuss the path of independence. In the study to determine the shortest path there are several algorithm options to solve it. This research was conducted using the Bellman Ford algorithm to try to solve the problem of selecting the fastest path. The case that will be focused on in this study covers the route that starts from Ir. H. Juanda street and ends at the Leuwipanjang bus terminal. The road node that will be passed is taken from several main points that will be passed. Calculation of coordinates will be calculated using the concept of graph and haversine formula. The impact of this research is that it can be known the fastest path needed using the Bellman Ford algorithm. Keywords:...
