Article Per Year (5 Year)
p-Index From 2021 - 2026
3.562
P-Index
This Author published in this journals
All Journal Information Management For Educators And Professionals (IMBI) Jurnal Informasi dan Komputer JURSIMA (Jurnal Sistem Informasi dan Manajemen) Jurnal Informatika Teknologi dan Sains (Jinteks) Prosiding Seminar Nasional Sisfotek (Sistem Informasi dan Teknologi Informasi) Journal of Artificial Intelligence and Engineering Applications (JAIEA) Journal of Student Research JURSIMA Journal of Computation Science And Artificial Intelligence
Arif Rinaldi Dikananda
Unknown Affiliation
Humanities Automotive Engineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Engineering Library & Information Science Mathematics Neuroscience Public Health Social Sciences Other

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

Found 9 Documents
Search
Journal : Journal of Artificial Intelligence and Engineering Applications (JAIEA)

 1 
Improving the School Type Clustering Model on the Foundation Using the K-Means Algorithm (Case Study: Kebon Kelapa Al-Ma'rifah, Cirebon Regency) Hanifah Nur Aulia; Martanto; Arif Rinaldi Dikananda; Mulyawan
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.739

Abstract

This study aims to improve the school type grouping model at the Kebon Kelapa Al-Ma'rifah Foundation, Cirebon Regency, using the K-Means algorithm. Data-based grouping is very important in supporting efficient education management, especially in environments that have various types of schools such as Madrasah Aliyah (MA), Vocational High School (SMK), Madrasah Tsanawiyah (MTs), and Madrasah Ibtidaiyah (MI). The data used comes from the New Student Registration (PPDB) dataset for the 2023–2024 school year, with demographic attributes such as name, place of birth, gender, and time of school entry. The evaluation of clustering quality was carried out using the Davies-Bouldin Index (DBI) to determine the optimal number of clusters. The results show that the optimal number of clusters is K=5 with the lowest DBI value of 0.201, which results in compact and well-separated clusters. The implementation of the K-Means algorithm helps the foundation understand the distribution pattern of students based on attributes such as gender, region, and entry time. This research provides practical benefits, including more targeted resource allocation, improved quality of education, and efficiency in school management. In addition, this research contributes to the development of data mining models in the education sector and opens up opportunities for the exploration of additional attributes such as academic achievement and socioeconomic conditions. Further research is suggested to use alternative algorithms such as K-Medoids or DBSCAN.
Improvement of Students' Academic Achievement Classification Model Through the Analytical Hierarchy Process Algorithm in Elementary School Burujul Kulon III Candra, Candra Rahmawati; Martanto; Arif Rinaldi Dikananda; Dede Rohman
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.764

Abstract

This study aims to improve the classification model of students' academic achievement at SD Negeri Burujul Kulon III using the Analytical Hierarchy Process (AHP) algorithm. This method is applied to analyze various student assessment criteria, including knowledge, skills, spiritual attitudes, and social attitudes, in order to create an objective and systematic evaluation system. The Knowledge Discovery in Databases (KDD) approach is used to ensure structured data management, including the stages of data collection, selection, transformation, analysis, and evaluation. The population of this study was all students of SD Negeri Burujul Kulon III with a sample size taken using the Stratified Random Sampling method, which ensures accurate representation of all grade levels. Data were collected through documentation studies, including exam result reports, skill assessments, and student behavior records observed by teachers. The analysis was carried out by applying the AHP algorithm to determine the priority weight of each assessment criterion through pairwise comparisons. The weights obtained are used to calculate the final grade which is the basis for classifying student achievement. The results of the study indicate that the AHP algorithm is able to produce a more accurate and relevant classification model to identify students with superior achievement, which is not only based on academic exam results but also includes student skills and attitudes. The resulting system provides significant benefits in academic decision-making, such as awarding outstanding students, identifying students who need special attention, and developing more effective learning strategies. This research also contributes to the development of data-based technology for educational evaluation, and can be an important reference for other educational institutions that want to improve the quality of evaluation, learning effectiveness, and student data management comprehensively, systematically, and sustainably in the future.
The Improvement of Indonesian Film Genre Clustering Model Using the K-Means Algorithm in Film Production Decision-Making Wiratriyana; Martanto; Arif Rinaldi Dikananda; Mulyawan
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.765

Abstract

The Indonesian film industry is expanding rapidly, but understanding audience preferences remains a significant challenge for producers. This study aims to cluster Indonesian films by genre and synopsis using the K-Means algorithm to aid in marketing strategies and content development. The dataset comprises 1,271 Indonesian film entries, including attributes like release year, genre, synopsis, and user ratings. The research follows the Knowledge Discovery in Databases (KDD) framework, which involves data selection, preprocessing, transformation, clustering with K-Means, and evaluation using the Elbow method to identify the optimal number of clusters. The results show that the K-Means algorithm successfully grouped the films into three clusters: drama, horror, and others. The analysis indicates that drama films dominate the high-rating cluster, while horror films are more commonly found in the low-rating category. The use of Principal Component Analysis (PCA) in the visualization aids in interpreting the clustering results, providing a clearer view of the data distribution. These findings highlight the potential for improving film production strategies by aligning content with audience preferences. By understanding genre patterns and ratings, producers can make more informed decisions in marketing and content development.
Use of K-Means Algorithm in Model Improvement Production Data Grouping for Determination Convection Production Strategy Ica, Ica Pandia; Martanto; Arif Rinaldi Dikananda; Dede Rohman
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.775

Abstract

This research was conducted to implement the K-Means Clustering algorithm in grouping convection production data to support the improvement of efficiency and effectiveness of production strategies. The data used is PT ABC's production data, which consists of important attributes, such as Production ID, Production Date, Product Name, Product Type, Color, Size, Raw Materials, and Order. The research method follows the stages of Knowledge Discovery in Database (KDD), which includes selection, preprocessing, transformation, data mining, and evaluation, so as to ensure that the data processed is relevant and ready to be analyzed. The grouping process is carried out using the K-Means algorithm, which groups data based on attribute similarity by determining the optimal number of clusters. The evaluation of the clustering results was carried out using the Silhouette Score and Davies-Bouldin Index metrics, where the results showed values that represented good cluster quality. A high Silhouette Score indicates that the data in the cluster has good uniformity, while a low Davies-Bouldin Index indicates a clear distance between clusters. The results of the grouping produce three main clusters that illustrate different production patterns, such as clusters with high, medium, and low order quantities. This analysis of the cluster provides important insights in supporting strategic decision-making, such as prioritizing resource management in high-order clusters and evaluating production efficiency in low-order clusters. This research is in line with previous literature that shows that the K-Means algorithm can be used effectively in big data grouping to support strategic planning. The practical contribution of this research is to help convection companies in understanding production patterns, so that production strategies can be designed more efficiently, responsively, and directionally. For further research, it is recommended to add new variables, such as production costs or work duration, as well as test other clustering algorithms to obtain more comprehensive results.
Application of the K-Means Algorithm in Enhancing the Clustering Model for Job Seekers in Cirebon City Laylatunna'imah; Martanto; Arif Rinaldi Dikananda; Ahmad Rifa’i
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.785

Abstract

The development of information technology opens up opportunities to improve the efficiency of job search through the grouping of job seekers based on specific characteristics. This study uses the K-Means algorithm to analyze data on job seekers in Cirebon City for 2018–2022, focusing on education level and gender. The stages of the research include (1) data selection, (2) data preprocessing, (3) transformation of attributes into numerical format, (4) data grouping using RapidMiner, and (5) evaluation of clustering results using the Davies-Bouldin Index (DBI). The results showed that the optimal number of clusters was two (K=2), with a DBI value of 0.608 which indicates good cluster separation. The first cluster consists of job seekers with a higher level of education, while the second cluster has a lower level of education. Gender did not show a significant influence. These findings provide strategic insights for governments and companies in developing data-driven policies, such as more effective training or recruitment programs. The K-Means algorithm has proven its potential in supporting strategic decision-making in workforce management and being adaptable to other regions.
Optimizing Naïve Bayes Algorithm Through Principal Component Analysis To Improve Dengue Fever Patient Classification Model Santi Nurjulaiha; Rudi Kurniawan; Arif Rinaldi Dikananda; Tati Suprapti
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.798

Abstract

Dengue fever is an infectious disease that has a significant impact on public health in tropical regions, including Indonesia. Early detection and proper classification of DHF patients is essential to reduce severity and mortality. For this reason, a method that can improve the accuracy in diagnosing this disease is needed. Principal Component Analysis (PCA) and Naïve Bayes (NB) are two commonly used techniques in medical data analysis. PCA is used to reduce the dimensionality of data to reduce complexity, while Naïve Bayes is used for classification of data based on probability. This study aims to optimize the use of PCA and Naïve Bayes in improving the accuracy of the dengue patient classification model. The method used in this study involves processing a medical dataset of dengue patients containing various clinically relevant attributes. The dataset was then processed using PCA to reduce dimensionality and identify key features that affect classification. Next, Naïve Bayes was applied to classify the data based on the selected features. This study compares the performance of classification models that use a combination of PCA and Naïve Bayes with models that only use Naïve Bayes without dimensionality reduction. The results show that the use of PCA in data processing significantly improves the accuracy of the classification model compared to the model that only uses Naïve Bayes. The combination of PCA and Naïve Bayes produces a more efficient model and has a higher accuracy rate in identifying patients with DHF risk. Thus, the application of PCA and Naïve Bayes in the classification of DHF patients can be an effective tool in assisting the medical diagnosis process, which in turn can reduce misdiagnosis and improve patient recovery rates. This research contributes to the development of artificial intelligence technology in the medical field, especially to improve the accuracy of dengue disease diagnosis, and serves as a basis for further research in the use of machine learning techniques in healthcare. This study analyzes the performance of the Naïve Bayes algorithm in classifying dengue fever patient data, by comparing models that use Principal Component Analysis (PCA) as a dimension reduction method and models that do not use it. The results show that the Naïve Bayes model without PCA has an accuracy of 49.96%, which is close to the random guess rate. This finding indicates that the model is less effective in recognizing patterns in the data. In contrast, the application of PCA successfully increased the model's accuracy to 50.03%
Sales Data Analysis using Linear Regression Algorithm on Raw Water Sales Rohayati, Eti; Martanto; Arif Rinaldi Dikananda; Dede Rohman
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 4 No. 2 (2025): February 2025
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v4i2.809

Abstract

This study aims to assess the effectiveness of linear regression algorithm in predicting raw water demand by considering customer transaction data, raw water volume, and seasonal variables. The method used is Knowledge Discovery in Databases (KDD), including data selection, preprocessing, transformation, data mining, and result evaluation. The dataset is divided 80% for training and 20% for testing. The analysis results show that the linear regression model has a coefficient of determination (R²) of 0.77, which means that the model can explain 77% of the data variability. The prediction error value is low, with Mean Absolute Error (MAE) 0.06, Mean Squared Error (MSE) 0.01, and Root Mean Squared Error (RMSE) 0.08, indicating good accuracy. In the comparison between actual and predicted values, for actual data of 7,000 liters, the model predicts 7,984.70 liters. The variable number of customer transactions has the greatest influence on raw water demand, with a coefficient of 16,940.46, while seasonal factors have less influence. Based on these findings, it can be concluded that the linear regression algorithm is effective in predicting raw water demand, however further development is required to improve accuracy at extreme values, by adding variables or using more complex algorithms.
Application of the K-Means Algorithm in the Segmentation of 3kg Lpg Customers Ananda, Ginaselvia; Suarna, Nana; Bahtiar, Agus; Arif Rinaldi Dikananda; Faturrohman
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 5 No. 2 (2026): February 2026
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v5i2.1853

Abstract

This research was motivated by PT Sumber Perkasa Mandiri's need to understand the purchasing patterns of 3 kg LPG gas customers more accurately in order to improve the effectiveness of its marketing strategy. The purpose of this study was to apply the K-Means Clustering algorithm to form customer segmentation based on transaction behavior. The method used is a quantitative approach with sales data analysis of 850 records through the stages of data selection, preprocessing, attribute transformation, and modeling using RapidMiner Studio. Model evaluation was carried out using the Davies-Bouldin Index to determine the optimal number of clusters. The results of the study show the formation of two main clusters, namely the premium customer cluster with high purchase frequency and high loyalty, and the low-activity customer cluster that only makes purchases when necessary. The best DBI value at K=2 of 0.057 indicates excellent cluster separation quality. These findings conclude that K-Means Clustering is effective in identifying differences in consumption behavior, and its implications provide a strategic basis for companies to design loyalty programs for high-value customers and more intensive promotions for low-activity customers.
Comparative Analysis of Serverless Container Service Performance Between Google Cloud Run and AWS App Runner in Cross-Cloud Architecture Muhammad Adithya Pratama; Odi Nurdiawan; Arif Rinaldi Dikananda; Denni Pratama; Dian Ade Kurnia
Journal of Artificial Intelligence and Engineering Applications (JAIEA) Vol. 5 No. 2 (2026): February 2026
Publisher : Yayasan Kita Menulis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.59934/jaiea.v5i2.1919

Abstract

Research on the performance of serverless container services is becoming increasingly important as the need for modern distributed and cross-cloud architectures grows. This study analyzes the performance of two leading serverless services, Google Cloud Run and AWS App Runner, in a cross-cloud architecture scenario. Testing was conducted using identical parameters, including container configuration, region, memory, vCPU, and concurrency. Performance testing included p95 latency, throughput, and error rate metrics using loads of up to 1000 virtual users. The results showed that Google Cloud Run provided more stable performance with p95 latency of 47–71 ms, throughput of 436–438 RPS, and 0% error rate. In contrast, AWS App Runner showed p95 latency of 490–651 ms with throughput variation of 388–410 RPS and an error rate of 2–4.41%. The difference in performance was due to autoscaling mechanisms, cross-cloud communication overhead, and resource contention. This study provides empirical evidence for selecting the optimal serverless service for distributed architectures.
Co-Authors Ade Irma Purnamasari Afifah, Azah Ahmad Faqih Ananda, Ginaselvia Aria Pratama Candra, Candra Rahmawati Dadang Sudrajat Dede Rohman Denni Pratama Dian Ade Kurnia Dyana Fitri Ega Salsa Nugraha Eka Wisnu Ramadhona Fachry Abda El Rahman Fahmi Naufal Fathurrohman, Fathurrohman Fatihanursari Dikananda Faturrohman Fauziah Noor Musid Gifthera Dwilestari Hanifah Nur Aulia Ica, Ica Pandia Irfan Ali Laylatunna'imah Martanto Moch Feri Izulhaq Muhammad Adithya Pratama Mulyawan Mulyawan Mulyawan Musofi Musofi Nana Suarna nur syarief abdullah Nurjana Adi Wijaya Odi Nurdiawan Rohayati, Eti Rohman, Dede Rudi Kurniawan Saeful Anwar Saefullah Fasa Santi Nurjulaiha Shofian Yunus Suarna, Nana Tati Suprapti Tio Prasetya Wiratriyana