Muhammad Fathir Aulia
Universitas Islam Negeri Sumatera Utara

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

Found 2 Documents
Search

Klasifikasi Biner Bipolar Pada Data Kusioner Pelamar Asisten Laboratorium Menggunakan Model Hebbian Dan Perceptron Muhammad Fathir Aulia; Armansyah Armansyah
Jurnal Ilmiah ILKOMINFO - Ilmu Komputer & Informatika Vol 8, No 2 (2025): Juli
Publisher : Akademi Ilmu Komputer Ternate

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47324/ilkominfo.v8i2.324

Abstract

Abstrak: Penelitian ini bertujuan untuk mengimplementasikan model Hebbian dan Perceptron untuk klasifikasi data kuesioner pelamar Asisten Laboratorium yang dikonversi ke format biner dan bipolar. Data kuesioner mengukur ketertarikan dan pengetahuan pelamar terkait bidang ilmu komputer guna menganalisis efektivitas, kecepatan, dan akurasi masing-masing model. Hasil implementasi menunjukkan bahwa model Hebbian dengan input biner tidak mengenali pola hingga epoch ke-10, sedangkan dengan input bipolar berhasil pada epoch ke-2. Model Perceptron dengan input biner mengenali pola pada epoch ke-2, sementara dengan input bipolar pada epoch ke-3. Kedua model dilatih dengan bobot dan bias awal = 0, serta parameter Perceptron berupa threshold (θ) = 0.5 dan learning rate (η) = 0.1. Dari empat pelamar, dua berminat mendaftar. Data dianalisis menggunakan model Hebbian dan Perceptron untuk mengevaluasi ketepatan, kecepatan, akurasi, serta efektivitas. Hasilnya, model Perceptron lebih direkomendasikan karena fleksibel dan mampu bekerja dengan format biner serta bipolar. Temuan ini memberikan wawasan dalam memilih model klasifikasi yang tepat untuk seleksi pelamar Asisten Laboratorium.Kata kunci: Klasifikasi, Hebbian, Perceptron, Biner - BipolarAbstract: This research aims to implement the Hebbian and Perceptron models for the classification of Laboratory Assistant applicant questionnaire data converted to binary and bipolar formats. The questionnaire data measures the applicant's interest and knowledge related to the field of computer science to analyze the effectiveness, speed, and accuracy of each model. The implementation results show that the Hebbian model with binary input does not recognize patterns until the 10th epoch, while with bipolar input it succeeds at the 2nd epoch. The Perceptron model with binary input recognized the pattern at the 2nd epoch, while with bipolar input at the 3rd epoch. Both models were trained with initial weight and bias = 0, and Perceptron parameters of threshold (θ) = 0.5 and learning rate (η) = 0.1. Of the four applicants, two were interested in applying. The data was analyzed using Hebbian and Perceptron models to evaluate precision, speed, accuracy, and effectiveness. As a result, the Perceptron model is more recommended as it is flexible and able to work with binary as well as bipolar formats. The findings provide insights in choosing the right classification model for Laboratory Assistant applicant selection.Keywords: Classification, Hebbian, Perceptron, Binary - Bipolar
Implementation of Finite State Automata on Pizza Vending Machine System Muhammad Fathir Aulia; Diky Suryandi; Jesron Nainggolan
JITCoS : Journal of Information Technology and Computer System Vol. 1 No. 1 (2025): Journal of Information Technology and Computer System
Publisher : CV. Multimedia Teknologi Kreatif

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.65230/jitcos.v1i1.3

Abstract

This study aims to implement Finite State Automata (FSA) on a pizza machine. FSA is a theoretical computational model used to describe the behavior of a system that can change discretely from one state to another. A pizza machine is a machine used to make pizza automatically. In this study, we design and implement FSA on a pizza machine to regulate the pizza making process. FSA consists of a number of states and transitions between those states. Each state represents a certain stage in the pizza making process, such as adding ingredients, mixing dough, and baking. The programming language and algorithm used are appropriate for implementing FSA on a pizza machine. When the machine is turned on, it will start in the initial state. Then, based on the input given, the machine will switch between different states according to the specified transition rules. By implementing FSA, this study successfully automated the pizza making process on the machine. This reduces dependence on human intervention and increases production efficiency. By using FSA, the pizza machine can operate automatically and produce pizza with high accuracy and efficiency. This study contributes to the development of automation in the food industry and improves the understanding of how to apply FSA in the context of real-world applications. In this study, FSA is used to control a muffin machine, but the FSA concept can also be used in various other automation applications.