Solikhun
STIKOM Tunas Bangsa

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

Found 2 Documents
Search

Application of Neural Network Variations for Determining the Best Architecture for Data Prediction Mochamad Wahyudi; Firmansyah; Lise Pujiastuti; Solikhun
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 6 No 5 (2022): Oktober 2022
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (943.184 KB) | DOI: 10.29207/resti.v6i5.4356

Abstract

This study focuses on the application and comparison of the epoch, time, performance/MSE training, and performance/MSE testing of variations of the Backpropagation algorithm. The main problem in this study is that the Backpropagation algorithm tends to be slow to reach convergence in obtaining optimum accuracy, requires extensive training data, and the optimization used is less efficient and has performance/MSE which can still be improved to produce better performance/MSE in this research—data prediction process. Determination of the best model for data prediction is seen from the performance/MSE test. This data prediction uses five variations of the Backpropagation algorithm: standard Backpropagation, Resistant Backpropagation, Conjugate Gradient, Fletcher Reeves, and Powell Beale. The research stage begins with processing the avocado production dataset in Indonesia by province from 2016 to 2021. The dataset is first normalized to a value between 0 to 1. The test in this study was carried out using Matlab 2011a. The dataset is divided into two, namely training data and test data. This research's benefit is producing the best model of the Backpropagation algorithm in predicting data with five methods in the Backpropagation algorithm. The test results show that the Resilient Backpropagation method is the best model with a test performance of 0.00543829, training epochs of 1000, training time of 12 seconds, and training performance of 0.00012667.
Comparison of Madaline and Perceptron Algorithms on Classification with Quantum Computing Approach Taufik Baidawi; Solikhun
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi) Vol 8 No 2 (2024): April 2024
Publisher : Ikatan Ahli Informatika Indonesia (IAII)

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29207/resti.v8i2.5502

Abstract

The fundamental problem in this research is to explore a more profound understanding of both performance and efficiency in quantity computing. Successful implementation of algorithms in computational computing environments can unlock the potential for significant improvements in information processing and neural network modeling. This research focuses on developing Madaline and Perceptron algorithms using a quantum approach. This study compares the two algorithms regarding the accuracy and epoch of the test results. The data set used in this study is a lens data set. There are four attributes: 1) patient age: young, prepresbyopia, presbyopia 2) eyeglass prescription: myopia, hypermetropia, 3) astigmatic: no, yes. 4) tear production rate: reduced, normal. There are three classes: 1) patients must have hard contact lenses installed, 2) patients must have soft contact lenses installed, and 3) patients cannot have contact lenses installed. The number of data is 24 data. The result of this research is the development of the Madaline and Perceptron algorithms with a quantum computing approach. Comparing these algorithms shows that the best accuracy is the Perceptron algorithm, namely 100%. In comparison, Madaline is 62.5%, and the smallest epoch is the Madaline algorithm, namely 4 epochs, while the smallest Perceptron epoch is 317. This research significantly contributes to the development of computing and neural networks, with potential applications extending from data processing to more accurate modeling in artificial intelligence, data analysis, and understanding complex patterns.