Claim Missing Document
Check
Articles

Found 34 Documents
Search

Implementasi Algoritma MFCC dan CNN dalam Klasifikasi Makna Tangisan Bayi Yusdiantoro, Senli Yusdiantoro; Sasongko, Theopilus Bayu
The Indonesian Journal of Computer Science Vol. 12 No. 4 (2023): The Indonesian Journal of Computer Science (IJCS)
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v12i4.3243

Abstract

Menangis merupakan salah satu usaha bayi dalam berkomunikasi untuk menyampaikan suatu kondisi yang sedang dialaminya, baik itu sedang lelah, sakit perut, rasa tidak nyaman maupun lapar. Bagi sebagian orang tua yang baru memiliki anak tentu tidak selalu mampu untuk memahami apa yang dikehendaki oleh bayi ketika dia menangis, karena suara tangisan yang dihasilkan terdengar hampir sama. Maka, pada penelitian ini dibuat sebuah sistem klasifikasi makna tangisan bayi dengan mengimplementasikan deep learning. Untuk memahami arti tangisan bayi berdasarkan penyebabnya dengan mengimplementasikan metode Mel-Frequency Cepstral (MFCC) sebagai fitur ekstraksi ciri dan CNN sebagai metode klasifikasi. Diantara proses pelatihan dan pengujian yang telah berhasil dilakukan dalam penelitian ini diperoleh hasil akurasi tertinggi terhadap pelatihan yang dilakukan dengan 50 epoch sebesar 93,84% dan model mampu mengklasifikasikan makna tangisan bayi berdasarkan penyebabnya terhadap data baru dengan rata-rata akurasi 88.04%.
Hyperparameter Tuning Algoritma Supervised Learning untuk Klasifikasi Keluarga Penerima Bantuan Pangan Beras Joshua Agung Nurcahyo; Theopilus Bayu Sasongko
The Indonesian Journal of Computer Science Vol. 12 No. 3 (2023): The Indonesian Journal of Computer Science
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v12i3.3254

Abstract

Indonesia memiliki berbagai macam program untuk menekan kemiskinan, salah satunya adalah program bantuan pangan beras. Namun, berdasarkan temuan di lapangan, program bantuan ini tidak tepat sasaran. Melalui klasifikasi supervised learning dengan hyperparameter tuning, penelitian ini bertujuan untuk mengetahui algoritma klasifikasi umum yang paling optimal dan akurat dalam menentukan keluarga penerima bantuan pangan beras. Algoritma Support Vector Machine (SVM), decision tree, naïve bayes, dan K-nearest neighbor (Knn) serta metode hyperparameter tuning grid search, random search, dan optimasi bayesian digunakan dalam penelitian. Data pada penelitian ini bersumber dari IFLS. Berdasarkan hasil analisis, penerapan hyperparameter tuning memiliki dampak yang signifikan dalam meningkatkan kinerja algoritma KNN, decision tree, dan SVM. Algoritma Knn dengan random search serta optimasi bayesian dan SVM dengan optimasi bayesian memberikan nilai akurasi yang sama, yakni sebesar 74%.Oleh karena itu, model tersebut memiliki kinerja yang setara dan sama baiknya dalam mengklasifikasikan keluarga penerima bantuan pangan beras.
Optimasi K-Nearest Neighbor dengan Grid Search CV pada Prediksi Kanker Paru-Paru Kusuma, Satya Tegar; Sasongko, Theopilus Bayu
The Indonesian Journal of Computer Science Vol. 12 No. 4 (2023): The Indonesian Journal of Computer Science (IJCS)
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v12i4.3267

Abstract

Kanker paru-paru adalah salah satu kanker paling mematikan di seluruh. Salah satu penyebab kematian pada penderita kanker paru-paru adalah tidak ada sistem untuk memprediksi kanker paru-paru secara optimal apakah pasien menderita kanker paru-paru atau tidak. Oleh karena itu, penelitian ini bertujuan untuk melakukan optimasi nilai K pada algoritma k-nearest neighbor (KNN) menggunakan metode grid search cv. Algoritma KNN dipilih karena pada berbagai penelitian memiliki tingkat akurasi yang lebih baik dibandingkan dengan algoritma supervised learning lainnya. Data yang digunakan pada penelitian ini bersumber dari data publik yang ada di kaggle. Berdasarkan penelitian dan pembahasan mengenai optimasi nilai K pada algoritma KNN menggunakan metode grid search cv didapatkan nilai K paling optimal yaitu 3 dengan tingkat akurasi 96%. Oleh karena itu, nilai K=3 sangat baik diterapkan pada algoritma KNN untuk memprediksi kanker paru-paru karena memiliki akurasi yang tinggi.
Analisa Perbandingan Algoritma CNN dan LSTM untuk Klasifikasi Pesan Cyberbullying pada Twitter Radjavani, Alifqi; Bayu Sasongko, Theopilus
The Indonesian Journal of Computer Science Vol. 12 No. 4 (2023): The Indonesian Journal of Computer Science (IJCS)
Publisher : AI Society & STMIK Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33022/ijcs.v12i4.3287

Abstract

Dengan meningkatnya penggunaan sosial media, cyberbullying telahmencapai titik puncak sepanjang masa. Anonimitas pada internet membuatcyberbullying sangat merusak, dikarenakan korban akan merasa jika tiadajalan keluar dari pelecehan tersebut. Setiap individu harus selalu waspadaterhadap cyberbullying dan dihimbau untuk selalu melindungi diri sendiribeserta orang lain dari hal ini. Pada kasus ini, penulis membuat model yangsecara otomatis akan menandai tweet yang berpotensi membahayakan sertamemecah pola pesan kebencian tersebut. Dataset yang disediakan olehpenulis berisi sekitar 48.000 tweet yang telah dilabeli sesuai dengan jenis dandata-data tersebut telah diseimbangkan dan berisi sekitar 8000 data.Penelitian ini membandingkan algoritma Convolutional Neural Networkdengan Long Short-Term Memory untuk menentukan algoritma terbaik untukdataset pada penelitian ini. Berdasarkan hasil penelitian yang sudahdilakukan disimpulkan jika Long Short-Term Memory adalah algoritmaterbaik dengan f1-score 83.09%.
Identify the Condition of Corn Plants Using Gray Level Co-occurrence Matrix and Bacpropagation A. Rahim, Abd Mizwar; Sasongko, Theopilus Bayu
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol 24 No 2 (2025)
Publisher : LPPM Universitas Bumigora

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

Abstract

This research aims to increase the accuracy of identifying the condition of corn plants based on leaf features using the GLCM and ANN Backpropagation methods. The GLCM method is used to extract features from corn leaf images, while Backpropagation ANN is used to classify the condition of corn plants based on these features. This classification was carried out using a dataset of corn leaves from four different conditions, namely healthy, leaf-spot, leaf-blight, and leaf-rust. Next, leaf features are extracted using the GLCM method. After that, data normalization was carried out, balancing the dataset, and training was carried out on the Backpropagation ANN model to classify the condition of the corn plants. After training the model, the next model evaluation is carried out using the confusion matrix method. The research results show that the method used can produce quite high accuracy when identifying the condition of corn plants, with an accuracy of 99%. This shows that the use of GLCM and ANN Backpropagation can be a good alternative in identifying the condition of corn plants. This research provides benefits in making it easier to accurately identify the condition of corn plants.
Identify the Condition of Corn Plants Using Gray Level Co-occurrence Matrix and Bacpropagation Abd Mizwar A. Rahim; Theopilus Bayu Sasongko
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 24 No. 2 (2025)
Publisher : LPPM Universitas Bumigora

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

Abstract

This research aims to increase the accuracy of identifying the condition of corn plants based on leaf features using the GLCM and ANN Backpropagation methods. The GLCM method is used to extract features from corn leaf images, while Backpropagation ANN is used to classify the condition of corn plants based on these features. This classification was carried out using a dataset of corn leaves from four different conditions, namely healthy, leaf-spot, leaf-blight, and leaf-rust. Next, leaf features are extracted using the GLCM method. After that, data normalization was carried out, balancing the dataset, and training was carried out on the Backpropagation ANN model to classify the condition of the corn plants. After training the model, the next model evaluation is carried out using the confusion matrix method. The research results show that the method used can produce quite high accuracy when identifying the condition of corn plants, with an accuracy of 99%. This shows that the use of GLCM and ANN Backpropagation can be a good alternative in identifying the condition of corn plants. This research provides benefits in making it easier to accurately identify the condition of corn plants.
Komparasi dan Analisis Kinerja Model Algoritma SVM dan PSO-SVM (Studi Kasus Klasifikasi Jalur Minat SMA) Theopilus Bayu Sasongko
Jurnal Teknik Informatika dan Sistem Informasi Vol 2 No 2 (2016): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v2i2.627

Abstract

Attribute Selection is very important for classification process. This research has been done by doing attribute selection using PSO method (Particle Swarm Optimization) on SVM algorithm (Support Vector Machine). The development of the classification model uses three parameters especially data attribute, influence of the transformation of various kernel function and penalty factor (C) toward the performance of SVM and PSO-SVM classification.  The analysis uses five kernels in mySVM library that existed in Rapidminer application namely dot, radial, polynomial, neural, and anova kernel. The training data used in the first model classification development is student interest data at ABC high school on 2013-2014 year academic.  The first model is evaluated using accuracy, precision, recall, and auc value test. The first result shows that the anova kernel on PSO-SVM is able to work with accuracy level 99.30% using penalty factor 0.1. The second model has been developed to predict student interest in XYZ high school. The second result shows that PSO-SVM with kernel anova is able to classify students interest with 99.29% accuracy level.  Keywords— Optimization, SVM, PSO-SVM, Student Interest. 
Sentiment Analysis on BRImo Application Reviews Using IndoBERT Simarmata, Asyer Aprinando Pratama; Sasongko, Theopilus Bayu
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.8162

Abstract

The advancement of information technology has significantly impacted various sectors, including digital banking. BRImo, a mobile banking application from Bank Rakyat Indonesia (BRI), has been widely used, generating numerous user reviews that reflect their experiences. This study applies IndoBERT, a transformer-based model specifically designed for the Indonesian language, to analyze sentiment in BRImo user reviews. IndoBERT excels in handling the unique characteristics of the Indonesian language, such as informal and mixed-language usage. The dataset was collected from Kaggle and processed through labeling, data balancing, and splitting into 80% training, 10% validation, and 10% testing data. The IndoBERT model was evaluated using a confusion matrix and achieved 90% accuracy, with F1-scores of 0.89 for negative, 0.91 for neutral, and 0.90 for positive sentiments. Sentiment analysis results indicate that a significant portion of negative reviews highlight issues related to login difficulties, transaction failures, and slow customer service response times. These insights can help BRI enhance application reliability and customer support efficiency. This study demonstrates that IndoBERT is effective in sentiment analysis for Indonesian text and can be utilized to enhance BRImo services by providing deeper insights into user feedback.
Identify the Condition of Corn Plants Using Gray Level Co-occurrence Matrix and Bacpropagation A. Rahim, Abd Mizwar; Sasongko, Theopilus Bayu
MATRIK : Jurnal Manajemen, Teknik Informatika dan Rekayasa Komputer Vol. 24 No. 2 (2025)
Publisher : Universitas Bumigora

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

Abstract

This research aims to increase the accuracy of identifying the condition of corn plants based on leaf features using the GLCM and ANN Backpropagation methods. The GLCM method is used to extract features from corn leaf images, while Backpropagation ANN is used to classify the condition of corn plants based on these features. This classification was carried out using a dataset of corn leaves from four different conditions, namely healthy, leaf-spot, leaf-blight, and leaf-rust. Next, leaf features are extracted using the GLCM method. After that, data normalization was carried out, balancing the dataset, and training was carried out on the Backpropagation ANN model to classify the condition of the corn plants. After training the model, the next model evaluation is carried out using the confusion matrix method. The research results show that the method used can produce quite high accuracy when identifying the condition of corn plants, with an accuracy of 99%. This shows that the use of GLCM and ANN Backpropagation can be a good alternative in identifying the condition of corn plants. This research provides benefits in making it easier to accurately identify the condition of corn plants.
Implementasi Metode Forward Selection pada Algoritma Support Vector Machine (SVM) dan Naive Bayes Classifier Kernel Density (Studi Kasus Klasifikasi Jalur Minat SMA) Sasongko, Theopilus Bayu; Arifin, Oki
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 6 No 4: Agustus 2019
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1093.895 KB)

Abstract

Peminatan merupakan kegiatan yang disediakan oleh pihak sekolah yang berguna untuk mengakomodasi pilihan minat, bakat, atau kemampuan peserta didik dengan orientasi pemusatan. Penentuan jalur minat umumnya melibatkan banyak attribute. Klasifikasi maupun prediksi pada data mining menggunakan fitur seleksi sangat penting untuk pemilihan attribute yang tepat, karena berpengaruh pada performansi model, oleh sebab itu perlu metode untuk melakukan seleksi atribut. Penelitian ini membandingkan implementasi metode forward selection pada Algoritma SVM dan Naïve Bayes Kernel Density. Studi kasus yang digunakan adalah jalur minat pada siswa SMA pada dua sekolah yang berbeda. Proses pembentukan model klasifikasi dengan menganalisa perubahan kernel, faktor pinalti (C) SVM, number of kernel Naïve bayes kernel density, dan hasil feature subset forward selection. Digunakan lima buah eksperimen kernel SVM yaitu dot (linear), radial (RBF), polynomial, neural, dan anova. Proses uji coba perubahan parameter menggunakan rentang 0.0-100.0. Hasil dari penelitian ini diantaranya adalah feature subset dataset SMA ABC yang terpilih yaitu nilai IPA, tes akademik, abstrak konseptual, analisa sintesa, dan logika numerik, sedangkan feature subset SMA XYZ yaitu nilai IPA, logika numerik, dan analisa sintesa. Hasil pengujian dataset SMA ABC menggunakan algoritma FS-SVM berbasis kernel anova parameter C=10.0 sebesar 99.29%. Sedangkan hasil pengujian dataset SMA XYZ menggunakan algoritma FS-SVM berbasis kernel anova parameter C=10.0 sebesar 95.17%. AbstractSpecialization is an activity provided by the school that is useful to accommodate the choice of interests, talents, or abilities of students with a concentration of orientation. The determination of interest generally involved many attributes. The classification and prediction on the data mining that use the selection feature is very important for the selection of the right attribute, because it affects the performance of the model, therefore a method is needed to select attributes. This study compares the implementation of the forward selection method in the SVM Algorithm and Naïve Bayes Kernel Density. The case study that is used is the interest of students in high school and compared with two different schools. The process of modelling by studying kernel changes, penalty factors (C) SVM, number of kernel Naïve bayes kernels, and the results of features from subset forward selection. Five SVM kernel experiments ared used, namely dot (linear), radial (RBF), polynomial, neural, and anova. The trial process of changes parameters uses the range 0.0-100.0. The results of this study include features of selected ABC SMA subset datas, which are IPA values, academic tests, conceptual abstracts, synthesis analysis, and numerical logic, while the XYZ SMA subset features are IPA values, numerical logic, and synthesis analysis. The test results of the ABC High School dataset that use the kernel-based FS-SVM algorithm parameter C = 10.0 is 99.29%. While the results of testing the XYZ SMA dataset that use the kernel-based FS-SVM algorithm parameter C = 10.0 for 95.17%.