Reza Maulana
Sekolah Tinggi Teknologi Terpadu Nurul Fikri

Published : 2 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Artikel Implementasi Algoritma Best First Search untuk Pencarian Rute Terpendek pada Aplikasi Cerdas Pendaftaran Santri Baru: Aplikasi Cerdas Pendaftaran Santri Baru Herfandi Herfandi; Ulfatus Soleha; Agung Susilo Yuda Irawan; Kiki Ahmad Baihaqi; Reza Maulana
SYNTAX Jurnal Informatika Vol 11 No 01 (2022): Mei 2022
Publisher : Universitas Singaperbangsa Karawang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35706/syji.v11i01.6398

Abstract

Pesantren in Indonesia is a traditional Islamic educational institution that is able to exist until now. A less structured registration process allows errors and delays in the new santri registration process will be easy to occur. Pondok Pesantren Manbaul Ulum in carrying out the education administration process still uses conventional means this causes the service system used has not been efficient and the problem of dormitory limitations, registration regulations must be made in accordance with the distance zone of residence that has been determined. Therefore this study conducted the implementation of the best first search algorithm for the search of the shortest route on the new registration intelligent application. This research resulted in a new santri registration intelligent application by applying the best first search algorithm. The development method uses waterfall. Testing software with black box testing method with test case equivalence partitioning technique gets successful conclusions from various types of testing. With features for santri namely estimation data, home, instructions, contact us, register, login, fill out registration form, see verification, print proof of pass, and see the shortest tute, for admin setting school year, see registration, see registration accepted and rejected and see reports. As for the superadmin, crud admin data and see the report. This application is expected to help pesantren administration and prospective students see the route and support education in the Industrial 4.0 era.
Classification of Super Air Jet Initial Cabin Crew Candidates Using K-Nearest Neighbor (KNN) Method: Klasifikasi Calon Awak Kabin Awal Super Air Jet Menggunakan Metode K-Nearest Neighbor (KNN) Ahmad Jurnaidi Wahidin; Reza Maulana
SYSTEMATICS Vol 3 No 2 (2021): August 2021
Publisher : Universitas Singaperbangsa Karawang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35706/sys.v3i2.5804

Abstract

At the time of the corona virus outbreak that hit Indonesia and the world which had an impact on various sectors including transportation, optimistically that the Indonesian domestic flight market was still open with strong demand, a new airline, Super Air Jet (SAJ) was created in March 2021. In an effort to improve SAJ services screening qualified human resources, including the process of screening candidates for initial cabin crew. To support this process, it is necessary to have a method used to classify candidates for initial cabin crew at the administrative stage. K-Nearest Neighbor (KNN) which is one method for classifying is expected to provide a solution to the problems discussed. This study uses 10 training data that have 8 criteria to predict categories in 6 test data. From the calculation results using a value of k=5, the same results as the label on the initial test data resulted, which resulted in 2 data with the Stop prediction class and 4 data with the Advanced prediction class. To measure the performance of the KNN method, a test was conducted using a confusion matrix which resulted in a 100% accuracy value, a 100% precision value and a 100% recall value.