p-Index From 2021 - 2026
10.849
P-Index
This Author published in this journals
All Journal Jurnal Ilmu Komputer Teknika Jurnal Informatika Sinergi Telematika Jurnal Informatika dan Teknik Elektro Terapan InfoTekJar : Jurnal Nasional Informatika dan Teknologi Jaringan Sistemasi: Jurnal Sistem Informasi Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) JOURNAL OF INFORMATICS AND TELECOMMUNICATION ENGINEERING Jurnal CoreIT Information Management For Educators And Professionals (IMBI) Informatika Pertanian Jurnal SOLMA JOURNAL OF APPLIED INFORMATICS AND COMPUTING Jurnal Komtika (Komputasi dan Informatika) JTAM (Jurnal Teori dan Aplikasi Matematika) Jurnal Inotera Jurnal Infomedia MATRIK : Jurnal Manajemen, Teknik Informatika, dan Rekayasa Komputer JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) Jurnal Informatika Kaputama (JIK) Jurnal Sistem Informasi Kaputama (JSIK) Jurnal Sains Riset Jurnal Sosial Humaniora Sigli JTIK (Jurnal Teknik Informatika Kaputama) JOURNAL OF INFORMATICS AND COMPUTER SCIENCE G-Tech : Jurnal Teknologi Terapan Jurnal Sistem Komputer dan Informatika (JSON) Medika Teknika : Jurnal Teknik Elektromedik Indonesia Idealis : Indonesia Journal Information System International Journal of Engineering, Science and Information Technology Conten : Computer and Network Technology TECHSI - Jurnal Teknik Informatika Sisfo: Jurnal Ilmiah Sistem Informasi Jurnal Bangun Abdimas Journal Of Artificial Intelligence And Software Engineering Jurnal Malikussaleh Mengabdi Jurnal Komtika (Komputasi dan Informatika)
Claim Missing Document
Check
Articles

Found 8 Documents
Search
Journal : JOURNAL OF APPLIED INFORMATICS AND COMPUTING

Geographic Information System for Mapping Accommodation Locations in Lhokseumawe City Using the AHP Method and Dijkstra's Algorithm Wahdana, Aldi; Nurdin; Sujacka Retno
Journal of Applied Informatics and Computing Vol. 9 No. 3 (2025): June 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i3.9597

Abstract

This study aims to develop a web-based Geographic Information System (GIS) to provide recommendations for the best accommodation and the fastest route to the accommodation location in Lhokseumawe City. The Analytical Hierarchy Process (AHP) method is used to determine the priority of accommodation based on five main criteria, namely price, public facilities, cleanliness, security, and year founded. The Dijkstra algorithm is applied to calculate the shortest path from the user's position to the selected accommodation. This study involved 21 accommodations as study objects. The results of the analysis showed that Hotel Diana obtained the highest value of 0.08873, so it was recommended as the main accommodation. The shortest distance from the Faculty of Engineering, Malikussaleh University to Hotel Diana is 11.53857 km. These results indicate that the combination of the AHP method and the Dijkstra algorithm is effective in supporting location-based decision making, as well as making it easier for users to determine appropriate accommodation and the fastest route efficiently.
Determining Eligibility for Smart Indonesia Program (PIP) Recipients Using the Backpropagation Method Rizkya, Ghinni; Nurdin, Nurdin; Meiyanti, Rini
Journal of Applied Informatics and Computing Vol. 9 No. 4 (2025): August 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i4.9733

Abstract

The government provides financial assistance, educational opportunities, and expands access for students from poor or vulnerable families through the Smart Indonesia Program (PIP). At Madrasah Ibtidaiyah Negeri 20 Bireuen, the selection process for underprivileged students is still carried out manually by homeroom teachers by collecting data on students and their parents. This study aims to design, implement, and evaluate a classification method using the Backpropagation Neural Network to determine the eligibility of PIP scholarship recipients. The dataset consists of 309 entries, comprising 217 training data and 92 testing data, collected from MIN 20 Bireuen students between 2021 and 2023. The attributes used include father's occupation, mother's occupation, father's income, mother's income, number of dependents, number of vehicles, home ownership status, and card ownership status. Prior to training, the data were normalized using Min-Max scaling. The model was built with one hidden layer using a hard-limit activation function and a learning rate of 0.01. The classification results are categorized as "Eligible" and "Not Eligible". The model achieved an accuracy of 98%, precision of 100%, recall of 95%, and F1-score of 97%.
Real-Time Detection of Coffee Cherry Ripeness Using YOLOv11 Ilyana, Anis; Nurdin, Nurdin; Maryana, Maryana
Journal of Applied Informatics and Computing Vol. 9 No. 4 (2025): August 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i4.9735

Abstract

This study aims to develop a real-time coffee fruit ripeness detection system using the YOLOv11 algorithm to assist farmers in determining the optimal harvest time. The dataset comprises 302 images categorized into three ripeness levels: ripe, semi-ripe, and unripe. Model training was conducted on Google Colab with data augmentation to enhance dataset variability and prevent overfitting. After 20 epochs, the model demonstrated strong performance in the ripe category (mAP50: 0.774, Precision: 0.645, Recall: 0.812) and satisfactory results for semi-ripe fruits (mAP50: 0.695, Precision: 0.624, Recall: 0.679). However, detection performance for unripe fruits was lower (mAP50: 0.4). The system achieved an inference time of 183.4 ms per image, with fast preprocessing and postprocessing (0.5 ms each), indicating its suitability for real-time applications. While the model performs well overall, further improvement is needed in detecting unripe coffee fruits for enhanced system effectiveness.
Implementation of Ant Colony Optimization (ACO) Algorithm for Route Optimization of Tourist Paths in Takengon Suryana, Fitra; Nurdin, Nurdin; Hamdhana, Defry
Journal of Applied Informatics and Computing Vol. 9 No. 4 (2025): August 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i4.9706

Abstract

This study aims to design and implement a system for determining the shortest route between tourist destinations in Takengon using the Ant Colony Optimization (ACO) algorithm. The system is developed to assist travelers in obtaining efficient visitation routes based on distance and travel time. Experiments were conducted on 20 tourist locations, resulting in an optimized route with a total travel distance of 40.40 km and an estimated travel time of 81 minutes. The computation process took only 0.024001 seconds with a memory usage of 20.23 KB. The ACO algorithm was executed using 10 ants with key parameters set to alpha (α) = 1, beta (β) = 2, and rho (ρ) = 0.5. ACO demonstrated high effectiveness in exploring route combinations and iteratively generating near-optimal solutions. The chosen parameters were determined through experimentation to balance solution quality and convergence speed. In addition to generating the optimal visitation sequence, the system also provides complete turn-by-turn navigation instructions, including major roads such as Jalan Lintas Tengah Sumatera and Jalan Lebe Kader. The actual estimated travel route based on the generated navigation covers a distance of 97.4 km with a travel duration of approximately 2 hours and 42 minutes. The results indicate that ACO is an effective and efficient approach for solving medium- to large-scale tourist route optimization problems. The developed system can serve as a practical tool in the tourism sector and has the potential to be adapted and implemented in other tourist regions with similar routing challenges.
Development of an IoT-Based Smart Greenhouse with Fuzzy Logic for Chrysanthemum Cultivation Khairina, Jikti; Nurdin, Nurdin; Fikry , Muhammad
Journal of Applied Informatics and Computing Vol. 9 No. 5 (2025): October 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i5.10313

Abstract

Conventional cultivation of Chrysanthemum plants in greenhouses faces serious challenges such as inefficiency, response delays, and errors in temperature and humidity settings due to manual management. These conditions result in unsuitable growing environments that can reduce the quality and quantity of harvests. To overcome these problems, this study developed a smart greenhouse system based on the Internet of Things (IoT) and cloud computing with the application of fuzzy logic. The system is designed to automatically monitor and control temperature, humidity, and light intensity using NodeMCU ESP32, DHT22 and BH1750 sensors, as well as relay-based actuators and mini air conditioners. Environmental data is sent to the cloud and processed using the Sugeno fuzzy method to produce adaptive and precise control decisions. Test results show that the system can maintain stable and optimal environmental conditions with an average temperature control difference of 30.341% and an actuator efficiency of 9.34% against microcontroller commands. This system provides a modern solution to the limitations of traditional methods, and supports smart agriculture in tropical climates such as Lhokseumawe.
Implementation of Clustering Method Using K-Means Algorithm for Grouping BPJS Health Patient Medical Record Data Sapitri, Anggri; Nurdin, Nurdin; Afrilia, Yesy
Journal of Applied Informatics and Computing Vol. 9 No. 5 (2025): October 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i5.10046

Abstract

Clustering medical record data of BPJS Health patients is essential in supporting data-driven decision-making in hospitals. This study aims to implement the K-Means algorithm to cluster patient medical records at RSUD Simeulue based on BPJS class and patient address variables. The data were first normalized using the Z-Score method to standardize variable scales, followed by the iterative application of the K-Means algorithm until convergence was reached at the sixth iteration. The study employed three Cluster, namely Cluster 1 (Very Many), Cluster 2 (Many), and Cluster 3 (Not Many). The final results show that Cluster 1 contains 258 patients from Class 1 and 292 from Class 2; Cluster 2 consists of 296 patients from Class 2; and Cluster 3 includes 101 patients from Class 1, 115 from Class 2, and 148 from Class 3. In addition to classification by BPJS class, clustering based on patient address revealed a dominant distribution from Simeulue Timur, Teluk Dalam, and Teupah Selatan sub-districts. The clustering results were implemented into a web-based information system using the Laravel framework and MySQL database, enabling hospital administrators to visualize and analyze patient data effectively. This study demonstrates that the K-Means algorithm can be effectively applied in classifying medical record data to support healthcare management decision-making.
Z-Score Based Initialization for K-Medoids Clustering: Application on QSAR Toxicity Data Nurdin, Nurdin; Amalia, Nova; Fajriana, Fajriana
Journal of Applied Informatics and Computing Vol. 9 No. 5 (2025): October 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i5.10448

Abstract

The efficiency of clustering algorithms significantly depends on the initialization quality, especially in unsupervised learning applied to complex datasets. This study introduces an enhanced K-Medoids clustering approach using Z-Score-based medoid initialization to improve convergence speed and cluster validity. The method was evaluated using the QSAR Fish Toxicity dataset, consisting of 908 instances and seven numerical features. Initial medoids were selected based on standardized Z-Score values, resulting in a substantial reduction in convergence time from an average of 6 iterations to just 2. Clustering performance was assessed using three internal validation metrics: Davies-Bouldin Index (DBI), Silhouette Coefficient (SC), and Calinski-Harabasz Index (CHI). The DBI score decreased from 1.7328 to 0.8768, indicating improved cluster compactness and separation. In parallel, the SC increased from 0.327 to 0.619, and the CHI rose from 214.75 to 562.43, confirming more coherent and well-separated clusters. These results demonstrate that Z-Score-based initialization significantly boosts the robustness of K-Medoids, offering a simple yet effective strategy for unsupervised partitioning, particularly in toxicological and biochemical data analysis.
Sentiment Analysis of E-Commerce Product Reviews on Tokopedia Using Support Vector Machine Alaiya, Azna; Nurdin, Nurdin; Agusniar, Cut
Journal of Applied Informatics and Computing Vol. 9 No. 5 (2025): October 2025
Publisher : Politeknik Negeri Batam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30871/jaic.v9i5.10977

Abstract

This research aims to analyze the performance of Support Vector Machine (SVM) algorithm in classifying sentiment of e-commerce product reviews on the Tokopedia platform using web scraping data of 571 reviews from the 2024 period. The data includes review text variables, publication dates, and usernames processed through text preprocessing (text cleaning, stopword removal, stemming with Sastrawi), auto-labeling using a lexicon-based approach, and TF-IDF feature extraction with optimal parameters (max_features=5000, ngram_range=(1,2)) resulting in 1,187 features. Data splitting was performed using stratified method with proportions of training (80%) and testing (20%) on 461 reviews from binary classification filtering (positive vs negative). The research results demonstrate that Support Vector Machine with linear kernel achieved excellent performance with accuracy 95.70%, precision 95.89%, recall 95.70%, and F1-score 94.89% on the testing set. Despite the imbalanced dataset characteristics (92.4% positive vs 7.6% negative), SVM effectively handled the classification task by identifying negative sentiment with 100% precision and 42.86% recall, demonstrating its robustness in handling skewed data distribution. TF-IDF feature analysis identified the highest discriminative words such as "suitable", "goods", and "good" that are relevant for classifying consumer sentiment towards e-commerce products. The results indicate that SVM algorithm is highly effective for sentiment classification of e-commerce product reviews, making it suitable for practical implementation in automated sentiment analysis systems for online marketplaces.
Co-Authors - Miranda ., Muthmainah Adi Prasetyo Afrilia, Yesy Aidilof, Hafizh Al Kautsar Al Khaidar Alaiya, Azna Alqhifari, Azka Ama Zanati Amalia, Nova Amin Munthoha Aminsyah, Ansharulhaq Ananda Faridhatul Ulva Andri Alfitra Anggara, Aji Arnawan Hasibuan Aynun, Aynun Aynun, Nur Azzanna, Maghriza bhakti wan khaledy Bustami Bustami Bustami Bustami Cesilia, Yolinda Chaeroen Niesa Chicha Rizka Gunawan Cut Agusniar Dadang Priyanto Dahlan Abdullah Darmansyah, Arif Desky, Muhammad Aulia Dewi Astika Erni Susanti Eva Darnila Fadlisyah Fadlisyah Fadlisyah Fahrozi, Fazar Fajriana Fajriana Fajriana, Fajriana Fasdarsyah Fasdarsyah fatimah Fatimah Fikhri, Aditya Aziz Fikran, Rifzan Fikri Fikri Fikry , Muhammad Gavinda, Virza Ginting, Andriyan gunawan, chicha rizka Gunawan, Chichi Rizka Hafizh Al Kautsar Aidilof Hafizh Al-Kautsar Aidilof Hamdhana, Defry Herman Fithra Hermansyah Hermansyah I Made Ari Nrartha Ilyana, Anis Imanda, Nanda Intan Nuriani Isa, Muzamir Ismun Naufal Jessika, Jessika Jikti Khairina Julia Ulfah Khaidar, Al Khairina, Jikti Khairul Khairul, Khairul Khairuni Khairuni Kurnia, Sri M Farhan Aulia Barus M Rizwan M Suhendri M. Ali, Rahmadi Marleni Marleni Maryana Maryana Maryana Maryana Maryana Maryana Maryana, Maryana Maulita, Maya Maya Juwita Dewi Maysura Meriatna Meriatna Muchlis Abdul Muthalib Muhammad Daud Muhammad Faisal Muhammad fauzan Muhammad Fikry Muhammad Furqan, Muhammad Muhammad Hutomi Muhammad Iqbal Muhammad Johan Setiawan Muhammad Nasir Muhammad Riansyah Muhammad Ridha Mukti Qamal Muliana, Syarifah Munirul Ula Mutammimul Ula Muzakir Nur Nadilla Baimal Puteri NELI SUSANTI, NELI Nunsina, Nunsina Nur, Muzakir Pradita, Cindy Cika Rahmad Rahmad Rahmad Rahmat Rahmat Raihan Putri Rasyada, Reza Dian Reza, Restu Rini Meiyanti Risawandi, Risawandi Riza Mirza Rizal S.Si., M.IT, Rizal Rizki Setiawan Rizki Suwanda Rizky Putra Fhonna Rizkya, Ghinni Robi Kurniawan Rusadi, Athirah salamah salamah Salimuddin, Salimuddin Salsabila, Thifal Samudera, Brucel Duta Sapitri, Anggri Sari, Cut Jora Sayuti, Muhammad Siagian, Tania Annisa Siregar, Widyana Verawaty Sri Kurnia Suci Fitriani, Suci Suhaili Sahibul Muna Sujacka Retno Sultan, Kana Suryana, Fitra Syandriani Harahap Taufik Taufik Taufiq Taufiq Taufiq Taufiq Taufiq Taufiq Taufiq Taufiq Uci Mutiara Putri Nasution Ulva Fitriani Wahdana, Aldi Wan, Syahputra Wawan Wawan Yani, Muhamamd Yeni Yeni Yesy Afrilia Yesy Afrillia Yulisda, Desvina Zahrah, Violita Aditya Zahratul Fitri Zahratul Fitri, Zahratul Zalfie Ardian Zara Yunizar Zuraida Zuraida