p-Index From 2021 - 2026
10.868
P-Index
This Author published in this journals
All Journal Techno.Com: Jurnal Teknologi Informasi Jurnal Buana Informatika Jurnal Informatika Jurnal Teknologi Informasi dan Ilmu Komputer JUITA : Jurnal Informatika Jurnas Nasional Teknologi dan Sistem Informasi POSITIF Edu Komputika Journal Sistemasi: Jurnal Sistem Informasi Jurnal Pendidikan Informatika dan Sains Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Computatio : Journal of Computer Science and Information Systems RABIT: Jurnal Teknologi dan Sistem Informasi Univrab Jurnal Khatulistiwa Informatika JIKO (Jurnal Informatika dan Komputer) JURNAL MEDIA INFORMATIKA BUDIDARMA Jurnal Pilar Nusa Mandiri JTERA (Jurnal Teknologi Rekayasa) Jurnal Sains dan Informatika INOVTEK Polbeng - Seri Informatika Matrix : Jurnal Manajemen Teknologi dan Informatika JURNAL REKAYASA TEKNOLOGI INFORMASI SINTECH (Science and Information Technology) Journal Jurnal Informatika Universitas Pamulang Jurnal Teknoinfo Jurnal Sisfokom (Sistem Informasi dan Komputer) KACANEGARA Jurnal Pengabdian pada Masyarakat MATRIK : Jurnal Manajemen, Teknik Informatika, dan Rekayasa Komputer Indonesian Journal of Applied Informatics KOMPUTIKA - Jurnal Sistem Komputer KOMPUTA : Jurnal Ilmiah Komputer dan Informatika JIPI (Jurnal Ilmiah Penelitian dan Pembelajaran Informatika) Jurnal Teknologi Terapan Jurnal Teknologi Terpadu EDUMATIC: Jurnal Pendidikan Informatika JISICOM (Journal of Information System, Infomatics and Computing) EVOLUSI : Jurnal Sains dan Manajemen Building of Informatics, Technology and Science JASIEK (Jurnal Aplikasi Sains, Informasi, Elektronika dan Komputer) JISKa (Jurnal Informatika Sunan Kalijaga) Jurnal Teknologi Informasi dan Multimedia Jurnal JTIK (Jurnal Teknologi Informasi dan Komunikasi) JUSTINDO (Jurnal Sistem dan Teknologi Informasi Indonesia) JISA (Jurnal Informatika dan Sains) International Journal of Engineering, Technology and Natural Sciences (IJETS) JOURNAL OF INFORMATION SYSTEM RESEARCH (JOSH) Jurnal Sistem Komputer dan Informatika (JSON) TIN: TERAPAN INFORMATIKA NUSANTARA Jurnal Teknik Informatika (JUTIF) Jurnal Digit : Digital of Information Technology Jurnal FASILKOM (teknologi inFormASi dan ILmu KOMputer) Science in Information Technology Letters Journal of Soft Computing Exploration Jurnal Indonesia : Manajemen Informatika dan Komunikasi Bulletin of Computer Science Research KLIK: Kajian Ilmiah Informatika dan Komputer International Journal Software Engineering and Computer Science (IJSECS) Jurnal Sains dan Teknologi Jurnal Sains dan Teknologi International Journal Science and Technology (IJST) Malcom: Indonesian Journal of Machine Learning and Computer Science Journal of Scientific Research, Education, and Technology Jikom: Jurnal Informatika dan Komputer Journal of Data Science Theory and Application NERO (Networking Engineering Research Operation) SmartComp Jurnal Ilmu Komputer dan Sistem Informasi Jurnal Indonesia : Manajemen Informatika dan Komunikasi Emitor: Jurnal Teknik Elektro IJISCS (International Journal of Information System and Computer Science)
Claim Missing Document
Check
Articles

Implementasi Convolutional Neural Network Untuk Pengenalan Tulisan Tangan Akasara Sunda Ngalangéna Azizah, Rahma Nur; Avianto, Donny
TIN: Terapan Informatika Nusantara Vol 6 No 7 (2025): December 2025
Publisher : Forum Kerjasama Pendidikan Tinggi (FKPT)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/tin.v6i7.8703

Abstract

Efforts to preserve the Sundanese script as a cultural heritage face challenges in the digital era, one of which is the limited resources for pattern recognition. This research aims to develop an effective custom Convolutional Neural Network (CNN) model for the classification of handwritten Sundanese script. Facing the constraint of no available public dataset, this study utilizes a primary dataset (Swaraksara Dataset) created by the author, consisting of 6,500 handwritten images evenly distributed across 13 classes (combinations of the "Na" script with rarangkén). The methodology applied includes a comprehensive data preprocessing stage, covering grayscale conversion, resizing to 200x200 pixels, normalization, and data augmentation techniques to prevent overfitting. The custom CNN architecture was designed with five convolutional layers (filters 32 to 512) and the Adam optimizer. The experimental results show that the optimal configuration was achieved with a learning rate of 0.001 and 50 training epochs, resulting in very high model performance. In the evaluation using test data, the model achieved an accuracy of 99.54% with a loss value of 0.0175. The optimal performance of this model is driven by the quality of the primary dataset supported by comprehensive image preprocessing stages, thus ensuring clean, uniform, and significantly noise-free data input. Analysis of the confusion matrix and learning curves also confirmed the model's excellent generalization ability with no indications of overfitting. This model has been successfully implemented in the "Swaraksara" web application as a Sundanese script recognition system.
Global Horizontal Irradiance Prediction using the Algorithm of Moving Average and Exponential Smoothing Syahab, Alfin Syarifuddin; Hermawan, Arief; Avianto, Donny
JISA(Jurnal Informatika dan Sains) Vol 6, No 1 (2023): JISA(Jurnal Informatika dan Sains)
Publisher : Universitas Trilogi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.31326/jisa.v6i1.1649

Abstract

To reduce the discrepancy between the results of the expected data and the actual data, prediction is a procedure that is calculated systematically based on owned historical and present information. For the creation of solar energy projects and for decision-making in other connected domains, solar radiation intensity prediction is essential. This study aims to create a predictive model on monthly global horizontal irradiance data. The method used is the Simple Moving Average algorithm, Exponentially Weighted Moving Average and Single Exponential Smoothing. The stages carried out in this study include data collection, data preprocessing, testing of predictive models, interpretation of data visualization, and performance evaluation. The results of calculating the error value and correlation produce an evaluation of the performance of the prediction model. The SES method, which obtained an MAE value of 7.13, a MAPE of 0.02%, an MSE of 88.07, an RMSE of 9.38, and an R2 of 0.94, was determined to be the best prediction model by the calculation of the prediction model performance evaluation. A MAE value of 9.45, a MAPE of 0.02%, an MSE of 150.16, an RMSE of 12.25, and an R2 of 0.91 were obtained by the EWMA method, which is also the method that produced the second-best result. A MAE value of 14.38, a MAPE of 0.04%, an MSE of 367.59, an RMSE of 19.17, and an R2 of 0.77 were obtained by the SMA method, which is the third-best result.
Learning Accuracy with Particle Swarm Optimization for Music Genre Classification Using Recurrent Neural Networks Muhammad Rizki; Arief Hermawan; Donny Avianto
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 23 No. 2 (2024)
Publisher : Universitas Bumigora

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30812/matrik.v23i2.3037

Abstract

Deep learning has revolutionized many fields, but its success often depends on optimal selection hyperparameters, this research aims to compare two sets of learning rates, namely the learning set rates from previous research and rates optimized for Particle Swarm Optimization. Particle Swarm Optimization is learned by mimicking the collective foraging behavior of a swarm of particles, and repeatedly adjusting to improve performance. The results show that the level of Particle Swarm Optimization is better previous level, achieving the highest accuracy of 0.955 compared to the previous best accuracy level of 0.933. In particular, specific levels generated by Particle Swarm Optimization, for example, 0.00163064, achieving competitive accuracy of 0.942-0.945 with shorter computing time compared to the previous rate. These findings underscore the importance of choosing the right learning rate for optimizing the accuracy of Recurrent Neural Networks and demonstrating the potential of Particle Swarm Optimization to exceed existing research benchmarks. Future work will explore comparative analysis different optimization algorithms to obtain the learning rate and assess their computational efficiency. These further investigations promise to improve the performance optimization of Recurrent Neural Networks goes beyond the limitations of previous research.
Penerapan Metode Fuzzy Tsukamoto untuk Perhitungan Gaji Karyawan Bimantoro, Nazar Iqbal; Avianto, Donny
Smart Comp :Jurnalnya Orang Pintar Komputer Vol 12, No 4 (2023): Smart Comp: Jurnalnya Orang Pintar Komputer
Publisher : Politeknik Harapan Bersama

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30591/smartcomp.v12i4.6032

Abstract

Upah gaji adalah kompensasi yang diberikan kepada setiap perusahaan, instansi, organisasi, atau badan usaha untuk karyawan yang telah bekerja selama sebulan. Namun, untuk memberikan kompensasi yang adil kepada seluruh karyawan, perusahaan harus mempertimbangkan faktor-faktor seperti absensi, tingkat pendidikan, dan tanggungan dalam pemberian kompensasi. Kriteria ini biasanya digunakan oleh perusahaan besar. Sebenarnya, pengolahan ini sudah ada sejak lama, tetapi sistem yang telah dibuat masih sederhana dan hanya bisa menangani masalah perhitungan yang sederhana. Perhitungan yang lebih kompleks dapat ditentukan menggunakan logika fuzzy melalui beberapa langkah agar mendapatkan hasil yang akurat. Metode Tsukamoto adalah salah satu metode yang menggunakan logika fuzzy dan menghasilkan nilai tegas. Pengambilan data yang tepat dilakukan untuk menentukan gaji dengan kriteria seperti tingkat pendidikan, absensi bulanan, dan tanggungan. Dengan bantuan penelitian ini, organisasi dapat menggunakan perhitungan yang ditemukan dalam penelitian ini untuk menentukan gaji karyawan dengan cepat, baik, dan tepat, sehingga masalah penentuan gaji dapat diselesaikan dengan baik.
Implementasi Speech Recognition Menggunakan Long Short-Term Memory untuk Software Presentasi Satriya Adhitama; Donny Avianto
Jurnal Sistem Komputer dan Informatika (JSON) Vol. 5 No. 2 (2023): Desember 2023
Publisher : Universitas Budi Darma

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30865/json.v5i2.6950

Abstract

Presentation is one of the methods for delivering thoughts, ideas, and concepts to an audience verbally. Presentation activities can be supported by presentation software that can be used to organize the sequence of material to be presented with visually appealing visuals. Operating presentation software requires technical assistance such as a remote, mouse, keyboard, and even a personal assistant, which can be distracting to the presenter as it limits their freedom in delivering the material. This distraction can be addressed through the implementation of speech recognition as a command to operate presentation software, making it easier for the presenter. A speech recognition system is developed using Long Short-Term Memory (LSTM), which can handle the issues of long-term dependency and vanishing gradient associated with Recurrent Neural Networks (RNN). There are 10 command words used to operate the presentation software. LSTM demonstrates superior performance when compared to alternative techniques like DNN, CNN, and SimpleRNN, achieving a training accuracy of 96.5%, a validation accuracy of 94.8%, and a testing accuracy of 94%. The LSTM method can be effectively used for sequential data to recognize real-time speech.
Penggunaan Metode DTW Pada K-Means Dalam Menganalisis Tren Penjualan Produk Laode Izat Trianto Haradin; Arief Hermawan; Donny Avianto
Jurnal Informatika dan Komputer Vol 16 No 1 (2026): April
Publisher : Sekolah Tinggi Ilmu Komputer PGRI Banyuwangi

Show Abstract | Download Original | Original Source | Check in Google Scholar

Abstract

Data is a collection of raw information that can be in the form of symbols, numbers, or words. Supermarkets are a type of modern market that functions as an intermediary between producers and consumers. Along with the increasing convenience of services and payment systems, sales transaction volumes have also increased. Based on this, this study proposes the use of the K-Means algorithm combined with Dynamic Time Warping (DTW) to cluster sales trend patterns. The main purpose of using DTW is to enable the comparison of sales time series that have shifting patterns, thus resulting in a more representative clustering process. The results of the clustering evaluation show that the K-Means configuration with the number of clusters K = 3 produces a Davies-Bouldin Index (DBI) value of 3.119, which indicates a relatively good level of cluster separation and compactness. This finding has important significance because it shows that the DTW-based K-Means approach is able to reveal meaningful sales trend patterns and can be used as a basis for strategic decision-making, such as stock planning, promotions, and more optimal supermarket sales management. Thus, the results of this study imply that the DTW-based K-Means approach can be used as an alternative method for analyzing sales patterns in the retail sector. These findings are expected to assist supermarket management in understanding sales behavior, supporting strategic decision-making, and improving the effectiveness of future inventory and promotional planning.
Optimization of Hyperparameter K in K-Nearest Neighbor Using Particle Swarm Optimization Muhammad Rizki; Arief Hermawan; Donny Avianto
JUITA: Jurnal Informatika JUITA Vol. 12 No. 1, May 2024
Publisher : Department of Informatics Engineering, Universitas Muhammadiyah Purwokerto

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.30595/juita.v12i1.20688

Abstract

This study aims to enhance the performance of the K-Nearest Neighbors (KNN) algorithm by optimizing the hyperparameter K using the Particle Swarm Optimization (PSO) algorithm. In contrast to prior research, which typically focuses on a single dataset, this study seeks to demonstrate that PSO can effectively optimize KNN hyperparameters across diverse datasets. Three datasets from different domains are utilized: Iris, Wine, and Breast Cancer, each featuring distinct classification types and classes. Furthermore, this research endeavors to establish that PSO can operate optimally with both Manhattan and Euclidean distance metrics. Prior to optimization, experiments with default K values (3, 5, and 7) were conducted to observe KNN behavior on each dataset. Initial results reveal stable accuracy in the iris dataset, while the wine and breast cancer datasets exhibit a decrease in accuracy at K=3, attributed to attribute complexity. The hyperparameter K optimization process with PSO yields a significant increase in accuracy, particularly in the wine dataset, where accuracy improves by 6.28% with the Manhattan matrix. The enhanced accuracy in the optimized KNN algorithm demonstrates the effectiveness of PSO in overcoming KNN constraints. Although the accuracy increase for the iris dataset is not as pronounced, this research provides insight that optimizing the hyperparameter K can yield positive results, even for datasets with initially good performance. A recommendation for future research is to conduct similar experiments with different algorithms, such as Support Vector Machine or Random Forest, to further evaluate PSO's ability to optimize the iris, wine, and breast cancer datasets.
ANALISIS KLASIFIKASI KEPUASAN PELANGGAN TERHADAP PELAYANAN CUSTOMER SERVICE UNTUK PENINGKATAN LAYANAN MENGGUNAKAN DATA MINING DENGAN DECISION TREE Lidya Nurmala Eva; Arief Hermawan; Donny Avianto
Journal of Information System, Informatics and Computing Vol 10 No 1 (2026): JISICOM (June 2026)
Publisher : Sekolah Tinggi Manajemen Informatika dan Komputer Jayakarta

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.52362/jisicom.v10i1.2404

Abstract

This study analyzes customer satisfaction with customer service using data mining techniques and the Decision Tree algorithm. The data was obtained from customer questionnaires completed after transactions and were processed through pre-processing, attribute labeling, and missing value handling. The dataset was split into 80% training data and 20% testing data to build and evaluate a classification model with two target categories: satisfied and dissatisfied. The modeling results show that the Consideration Label is the most dominant factor in determining customer satisfaction, while the Suggestion Label serves as a supporting attribute. Model evaluation produced an accuracy of 58%, with precision, recall, and F1-score for the dissatisfied class of 0.62, 0.66, and 0.64, respectively, and for the satisfied class of 0.53, 0.49, and 0.51, respectively. Based on these results, the Decision Tree method can be used to classify customer satisfaction, although further improvement in model performance is still needed to obtain more optimal predictions.
Segmentation-Aware Recommendation with Cluster-Specific Item Graphs Using Pointwise Mutual Information for Market Basket Analysis Khalifatur Rauf; Arief Hermawan; Donny Avianto
Building of Informatics, Technology and Science (BITS) Vol 8 No 1 (2026): June 2026
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v8i1.9707

Abstract

Traditional Association Rule-based recommendation methods often exhibit limited coverage and high redundancy when applied to sparse transactional data, thereby constraining their effectiveness for product discovery in e-commerce systems. This study proposes a hybrid recommendation framework that integrates customer behavioral segmentation with graph-based item representation learning to address these limitations. Customers are first grouped into behaviorally homogeneous clusters using historical transaction features. For each cluster, an item co-occurrence graph is constructed and weighted using pointwise mutual information to mitigate sparsity bias and emphasize informative associations. Graph-based representation learning is then applied using Node2Vec to generate low-dimensional product embeddings that capture both local structural proximity and higher-order relational patterns. The proposed framework explicitly restricts the candidate item space to the Top 100 most frequent products within each behavioral cluster, thereby focusing the recommendation task on improving localized discovery within high-frequency product segments rather than global catalog exploration. The objective of this research is to assess whether segmentation-aware graph embeddings can outperform traditional FP-Growth association rules under a strict temporal split between the Historical Training Set and the Hold-out Evaluation Set, ensuring realistic and leakage-free evaluation. Model performance is evaluated using precision, recall, normalized discounted cumulative gain, and intra-list diversity on the Hold-out Evaluation Set. Experimental results indicate that the proposed graph-based approach improves ranking quality and diversity within constrained high-frequency item spaces, demonstrating more effective localized discovery within Top 100 product segments compared to FP-Growth. These results demonstrate that graph-based embeddings are more robust to sparse behavioral patterns within high-frequency product segments and better suited for exploratory recommendation scenarios within dense product subsets. The proposed framework offers a scalable and temporally valid foundation for knowledge-driven recommender systems.
Analisis Pengelompokan Tingkat Pemahaman Materi Siswa Berdasarkan Nilai Ujian Menggunakan Algoritma K-Means Cahaya Muzaddidah; Arief Hermawan; Donny Avianto
Jurnal Ilmu Komputer dan Sistem Informasi Vol. 5 No. 2 (2025): Mei 2026
Publisher : LKP Unity Academy

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.70340/jirsi.v5i2.353

Abstract

Student understanding of learning content is an important indicator of educational success. This study aims to group student understanding based on their exam results in mathematics, English, science, social studies, and Arabic using the K-means Clustering algorithm. The data used consisted of 60 rows of student performance data, which were processed and standardized using Google Colab. The number of clusters was limited to two groups (K=2) to categorize students as having a high level of understanding or a basic level of understanding. The results showed that the K-means algorithm successfully identified groups of students with different levels of understanding based on their average exam scores. The group with a high level of understanding achieved an average score of more than 87.4. Teachers can use these Clustering results as a basis for developing more individualized and effective learning strategies for each group of students.
Co-Authors Adicahya, Bina Sukma Adityo Permana Wibowo Alwani, Adie G. Amalia Rizki Wulandari Andri Yudha Pratama Apriansyah, Ferryma Arba Ardiansyah, Diky Aribowo Aribowo Arief Hermawan Arieska Restu Harpian Dwika Ashari, Nadia Asrul Gunawan Aziz Perdana Baiq Nurul Azmi Bayu Tri Nugroho, Bayu Tri Bimantoro, Nazar Iqbal Bowo Hirwono Budiyanto, Irfan Cahaya Muzaddidah Dewi, Amelia Citra Dian Wijayanti Dimas Dwi Kurniawan Dimas Rizqi Kurniawan Dwi Ratnawati, Dwi Edi Priyanto Enggar Novianto Enggar Novianto Erfin Nur Rohma Khakim Fadhila, Arifa Farras Fadilah, Faiz Fahri Putra Herlambang Fakharudin, Panji Rangga Adzan Fajar Faqih, Allan Bil Febiansyah Annaufal Ahnaf Fauzi Ferdinandus Edwin Penalun Gumilang, Muhammad Satrio Gunawan, Asrul Hanif, Rifqi Fadhlurrahman Hardiyantari, Oktavia Ida Kumala Sari Iin Rohmatika Aulia Ilmy Eka Handayani Imantoko Imantoko Indra Maulana Iqbal, Muhammad Izza Irfan Budiyanto Jagad Raya Ramadhan Khalifatur Rauf Kusumastuti, Asriana Dyah Laode Izat Trianto Haradin Lidya Nurmala Eva Maulana, Adha Muh Arifandi Muhammad Irsyad Indra Fata Muhammad Kusban Muhammad Rizki Muhammad Rizki Nasmah Nur Amiroh Novaldy, Olwin Kirab Nur Widiastuti Nurazila, Siti Octavianus, Yonathan Perdana, Aziz Purba, Yurjaa Ghoniyyan Putra, Kristianto Pratama Dessan Rahma Nur Azizah Reski Noviana Rian Oktafiani Rian Oktafiani Rianto Rianto Risnanto, Ari Rizarta, Rusma Eko Fiddy Rizki Purnomo Pratama Rizky Samudra Falasyfa Roselilie Simbulan Roy Fasti Rubangi Rubangi Rudi, Rudiono Rusma Eko Fiddy Rizarta Saputra, Candra Heru Satriya Adhitama Setiawan, Muhhamad Ajun Siti Rokhanah Soraya Fatmawati Sri Wulandari SRI WULANDARI Sutarman Sutarman Syafrudin, Teguh Syahab, Alfin Syarifuddin Teguh Syafrudin Tri Untoro, Iwan Hartadi Tri Widodo Vivianti Wahid, Ach. Nur Aqil Wayan Praka