Article Per Year (5 Year)
p-Index From 2021 - 2026
7.69
P-Index
This Author published in this journals
All Journal Indonesian Journal of Electronics and Instrumentation Systems ELKHA : Jurnal Teknik Elektro JUITA : Jurnal Informatika Annual Research Seminar Sinkron : Jurnal dan Penelitian Teknik Informatika Jusikom : Jurnal Sistem Komputer Musirawas SELAPARANG: Jurnal Pengabdian Masyarakat Berkemajuan JURNAL TEKNIK INFORMATIKA DAN SISTEM INFORMASI Petir KOMPUTIKA - Jurnal Sistem Komputer Jurnal Teknologi Terpadu EDUMATIC: Jurnal Pendidikan Informatika Jutisi: Jurnal Ilmiah Teknik Informatika dan Sistem Informasi Progresif: Jurnal Ilmiah Komputer Jurnal Ilmiah Betrik : Besemah Teknologi Informasi dan Komputer Algoritme Jurnal Mahasiswa Teknik Informatika Informatics and Enginering Dedication DEVICE : JOURNAL OF INFORMATION SYSTEM, COMPUTER SCIENCE AND INFORMATION TECHNOLOGY MDP Student Conference JRIIN :Jurnal Riset Informatika dan Inovasi Jurnal Ilmiah Betrik : Besemah Teknologi Informasi dan Komputer Applied Information Technology and Computer Science (AICOMS) INOVTEK Polbeng - Seri Informatika JuTISI (Jurnal Teknik Informatika dan Sistem Informasi)
Yohannes, Yohannes
Universitas Multi Data Palembang
Agriculture, Biological Sciences & Forestry Chemical Engineering, Chemistry & Bioengineering Computer Science & IT Control & Systems Engineering Decision Sciences, Operations Research & Management Economics, Econometrics & Finance Education Electrical & Electronics Engineering Energy Engineering Environmental Science Health Professions Industrial & Manufacturing Engineering Languange, Linguistic, Communication & Media Law, Crime, Criminology & Criminal Justice Medicine & Pharmacology Nursing Public Health Social Sciences Other

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

Found 66 Documents
Search

 3   4   5   6   7 
Evaluation of MobileNet-Based Deep Features for Yogyakarta Traditional Batik Motif Classification Muhdhor, Umar; Yohannes
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15668

Abstract

Batik is an Indonesian intangible cultural heritage that embodies profound philosophical, aesthetic, and cultural values. Yogyakarta batik motifs, such as Parang, Kawung, and Truntum, reflect Javanese wisdom and identity through distinctive geometric and floral patterns. In the digital era, artificial intelligence based image processing provides a promising approach to support the preservation and automatic recognition of traditional batik motifs. The objective of this study is to evaluate the effectiveness of MobileNet-based feature extraction combined with Support Vector Machine (SVM) classification for Yogyakarta batik motif recognition. The proposed method employs MobileNet as a convolutional feature extractor and SVM as a decision model to separate motif classes in the feature space. Experiments were conducted on 685 batik images consisting of three motif classes, with class imbalance handled using Synthetic Minority Over-sampling Technique (SMOTE). Model performance was evaluated using weighted accuracy, precision, recall, and F1-score under five-fold cross validation. The results show that MobileNetV3Large achieved the best performance with a weighted accuracy of 98.36%, followed by MobileNetV3Small and MobileNetV4Small. Statistical significance tests using the Friedman test and Wilcoxon signed-rank analysis confirm that the performance differences among the evaluated models are statistically significant. These findings indicate that MobileNetV3 architectures provide robust and discriminative feature representations for batik motif classification on limited yet structured datasets. This study contributes a validated MobileNet–SVM framework for batik recognition and supports ongoing efforts in the digital preservation of Indonesia’s cultural heritage. Future work will explore larger motif sets and cross-dataset evaluation to further improve generalization performance.
Feature-Level Fusion of DenseNet121 and EfficientNetV2 with XGBoost for Multi-Class Retinal Classification Laksana, Jovansa Putra; Yohannes
Sinkron : jurnal dan penelitian teknik informatika Vol. 10 No. 1 (2026): Article Research January 2026
Publisher : Politeknik Ganesha Medan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33395/sinkron.v10i1.15670

Abstract

Accurate and efficient classification of retinal fundus images plays a critical role in supporting the early diagnosis of ocular diseases. However, models relying on a single deep learning backbone often struggle to capture the multi-scale and heterogeneous characteristics of retinal lesions, leading to unstable performance across visually similar disease classes. To address this limitation, this study proposes a novelty feature-level fusion framework that integrates complementary representations from DenseNet121 and EfficientNetV2-s, followed by classification using XGBoost. The fusion pipeline extracts 1024-dimensional features from DenseNet121 and 1280-dimensional features from EfficientNetV2-s, which are concatenated into a unified 2304-dimensional feature vector. Experiments were conducted on a dataset of 10,247 retinal fundus images spanning six categories: Central Serous Chorioretinopathy, Diabetic Retinopathy, Macular Scar, Retinitis Pigmentosa, Retinal Detachment, and Healthy. The proposed fusion model achieved an accuracy of 91.60%, outperforming DenseNet121 XGBoost (91.31%) and EfficientNetV2-s XGBoost (89.70%). Moreover, the fusion strategy demonstrated improved class-level stability, particularly for visually similar retinal disorders where single-backbone models exhibited higher misclassification rates. This study contributes a lightweight yet effective multi-backbone feature-level fusion approach that enhances discriminative representation and classification stability without increasing model complexity. In addition, the use of XGBoost introduces a tree-based decision mechanism that is inherently more interpretable than conventional fully connected layers, offering potential advantages for clinical analysis. Overall, the results highlight the effectiveness of multi-backbone feature fusion as a reliable strategy for automated retinal disease classification.
Performance Analysis of YOLOv11 Integrated with Lightweight Backbones (MobileNetV2, GhostNet, ShuffleNet V2) for Cigarette Detection Andreas, Kevin; Yohannes; Meiriyama
INOVTEK Polbeng - Seri Informatika Vol. 11 No. 1 (2026): February
Publisher : P3M Politeknik Negeri Bengkalis

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35314/0gjq1j10

Abstract

Cigarette object detection in indoor environments plays a vital role for enforcing smoke-free zone regulations and protecting public health from secondhand smoke exposure. This study investigates the performance of YOLOv11n architecture integrated with three lightweight backbone modifications (MobileNetV2, GhostNet, and ShuffleNet V2) for real-time cigarette detection with the aim of achieving efficiency suitable for potential deployment on resource-constrained edge devices. Comprehensive experiments were conducted using the Cigar Detection Dataset comprising 5,333 images, augmented to 8,890 samples through horizontal flipping and brightness adjustment techniques. All models were trained for 100 epochs using the SGD optimizer on an NVIDIA Tesla T4 GPU. The evaluation metrics included detection accuracy (mAP@0.5, mAP@0.5:0.95, precision, recall, and F1-score) and computational efficiency (parameters, model size, GFLOPs, and FPS). Experimental results demonstrate that the pretrained YOLOv11n baseline achieves the highest detection accuracy with mAP@0.5 of 0.8072 and precision of 0.8688. Among lightweight backbone variants, ShuffleNet V2 (0.5x) provides the most compact solution with only 2.28M parameters and a 4.73 MB model size, while ShuffleNet V2 (0.75x) offers an optimal balance between accuracy (mAP@0.5: 0.7430) and efficiency with only 0.95% accuracy degradation compared to the 1.0x variant. These findings provide practical guidance for selecting appropriate model configurations based on deployment constraints in smoke-free area monitoring systems.
Klasifikasi Motif Kain Batik Nitik Menggunakan Support Vector Machine dengan Ekstraksi Fitur EfficientNet-B0 Saputra, Dika; Yohannes, Yohannes
Progresif: Jurnal Ilmiah Komputer Vol 22, No 1 (2026): Januari
Publisher : STMIK Banjarbaru

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35889/progresif.v22i1.3507

Abstract

Nitik Batik is an Indonesian cultural heritage with complex geometric dot patterns, yet its digitalization and preservation efforts remain limited. This study aims to develop an automatic classification system for 60 Nitik Batik motifs using a combination of EfficientNet-B0 as a feature extractor and Support Vector Machine (SVM) as a classifier. The Batik Nitik 960 Dataset was expanded from 960 to 1,920 images with rotation augmentation. Experiments were conducted with 10-fold cross-validation and evaluation on separate test data. Results show that the model without augmentation achieved 55.71% accuracy, 90.06% macro precision, 55.71% recall, and 65.29% F1-score. Blur augmentation with 30% probability reduced accuracy to 49.29% although it decreased overfitting by 6.63%. SVM parameters were set to C=0.3 and gamma=0.01 to improve regularization. This study concludes that the combination of EfficientNet-B0 and SVM is effective for multi-class batik classification, but blur augmentation is unsuitable for detail-rich textile data. Future research recommendations include exploring geometric augmentation and more advanced feature extractor architectures.Kata kunci: Nitik Batik; Image classification; EfficientNet-B0; Support Vector Machine; augmentation. AbstrakBatik Nitik merupakan warisan budaya Indonesia dengan motif geometris berbentuk titik yang kompleks, namun upaya digitalisasi dan pelestariannya masih terbatas. Penelitian ini bertujuan mengembangkan sistem klasifikasi otomatis untuk 60 motif Batik Nitik menggunakan kombinasi EfficientNet-B0 sebagai ekstraktor fitur dan Support Vector Machine (SVM) sebagai klasifikator. Dataset Batik Nitik 960 Dataset diperluas dari 960 menjadi 1.920 citra dengan augmentasi rotasi. Eksperimen dilakukan dengan skema 10-fold cross-validation dan evaluasi pada data uji terpisah. Hasil menunjukkan bahwa model tanpa augmentasi mencapai akurasi 55,71%, precision macro 90,06%, recall 55,71%, dan F1-score 65,29%. Augmentasi blur 30% justru menurunkan akurasi menjadi 49,29% meskipun mengurangi overfitting sebesar 6,63%. Parameter SVM diatur C=0,3 dan gamma=0,01 untuk meningkatkan regularisasi. Penelitian ini menyimpulkan bahwa kombinasi EfficientNet-B0 dan SVM efektif untuk klasifikasi batik multikelas, namun augmentasi blur tidak sesuai untuk data tekstur kaya detail. Rekomendasi penelitian selanjutnya adalah eksplorasi augmentasi geometris dan arsitektur feature extractor yang lebih advance.Kata kunci: Batik Nitik; Klasifikasi citra; EfficientNet-B0; Support Vector Machine; Augmentasi.
KLASIFIKASI MAMALIA MENGGUNAKAN EXTREME GRADIENT BOOSTING BERDASARKAN FITUR HISTOGRAM OF ORIENTED GRADIENT Yohannes; Johannes Petrus
BETRIK Vol. 13 No. 03 (2022): Jurnal Ilmiah BETRIK : Besemah Teknologi Informasi dan Komputer
Publisher : PPPM Institut Teknologi Pagar Alam

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36050/e2t7t733

Abstract

Mammals are one type of animal that has many characteristics and characteristics.The shape of the face in each type of mammal has a similar shape. The faces of mammals in theform of frontal images are a challenge in image classification. In this study, the Histogram ofOriented Gradient (HOG) is used as a feature of the facial shape of mammals. HOG is used as astrengthening feature in the classification process using the eXtreme Gradient Boosting(XGBoost) method. The test was carried out using a dataset of frontal facial imagery ofmammals consisting of 15 species. The results of the tests show that the XGBoost method with theHOG feature is able to provide better classification results for mammals than without the HOGfeature. This is indicated by an increase in the precision value of 0.61; recall of 0.62; and an f1-score of 0.60 on XGBoost with HOG feature which is almost double that of XGBoost withoutHOG feature.
Feature Interaction and Performance Analysis of RankSum-Based Extractive Summarization in Indonesian Scientific Articles Adityya, Verrino; Yohannes, Yohannes
Jurnal Pendidikan Informatika (EDUMATIC) Vol 10 No 1 (2026): Edumatic: Jurnal Pendidikan Informatika
Publisher : Universitas Hamzanwadi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29408/edumatic.v10i1.33443

Abstract

The extractive summarization of Indonesian scientific articles is hindered by a domain mismatch where established methodologies rely on news-corpus assumptions, whereas Indonesian scientific discourse follows rigid, IMRaD-driven structural and lexical patterns. This study aims to systematically analyze feature interaction effects and saturation behaviour in RankSum-based extractive summaries for Indonesian scientific articles. Designed as a controlled comparative experiment, this research evaluates a RankSum framework integrating variables, such as graph-based, semantic-thematic vectors, and structural heuristics. The dataset comprises 2,897 Indonesian journal articles (2021-2025) collected via web scraping from open-access university repositories. Analysis across 31 scenarios demonstrates that for Indonesian scientific articles, the assumption that increasing feature density improves performance is flawed, instead a feature saturation effect occurs. Results show that a 4-feature combination maximizes unigram lexical precision (ROUGE-1 0.3564), whereas the full 5-feature fusion is necessary to preserve global semantic integrity, structural flow, and stable (ROUGE-L 0.2018; BERTScore 0.6977). This study establishes a generalizable principle for domain-aware ATS by demonstrating that overcoming domain mismatch relies on navigating feature saturation through selection aligned with the document’s inherent logic rather than raw feature quantity.
Soybean Seed Quality Classification using Magnitude-Enhanced Multiple Channel LBP and SVM Chandra, Adrian; Yohannes, Yohannes
Jurnal Pendidikan Informatika (EDUMATIC) Vol 10 No 1 (2026): Edumatic: Jurnal Pendidikan Informatika
Publisher : Universitas Hamzanwadi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.29408/edumatic.v10i1.33519

Abstract

Soybean is a major source of plant-based protein The quality of soybean seed affects resulting food. Therefore, image processing for classifying soybean seed quality is needed. Previous studies mainly used handcrafted or deep learning features and not evaluated local texture representations that using magnitude information for multi-class problems with high visual similarity. Traditional texture descriptors such as LBP or GLCM mainly using sign-based or global statistics and have limitations in representing colour-texture variations. This study aims to classify soybean seed quality using SVM with Multiple Channel Local Binary Pattern (MCLBP) and its enhanced variant with magnitude information (MCLBP+M) for feature extraction by utilizing correlations between colour channels through multi-radius approach. The dataset used is Soybean Seeds includes five classes: intact, spotted, immature, broken, and skin-damaged. This research conduct dataset splitting using 10-fold cross validation, data balancing (SMOTE), feature extraction, SVM model training and testing, and performance evaluation. The results show that MCLBP+M with Lab colour space and RBF kernel achieves accuracy of 86.30%, precision of 86.32%, recall of 85.99%, and F1-score of 86.07%. The results show that magnitude information in MCLBP+M consistently stable and improves classification performance across colour spaces and kernels, making it suitable for soybean seed quality classification.
Peningkatan Kompetensi Siswa SMK Melalui Pelatihan Dasar Sistem Operasi Linux Arman, Molavi; Wijaya, Novan; Meiriyama, Meiriyama; Inayatullah, Inayatullah; Al Rivan, Muhammad Ezar; Yohannes, Yohannes; Devella, Siska
FORDICATE Vol 5 No 2 (2026): April 2026
Publisher : Universitas Multi Data Palembang, Fakultas Ilmu Komputer dan Rekayasa

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.35957/fordicate.v5i2.15743

Abstract

Penguasaan sistem operasi Linux menjadi kebutuhan penting dalam dunia teknologi informasi, namun masih banyak siswa SMK yang belum memiliki kompetensi dasar dalam penggunaan command line. Kegiatan pengabdian kepada masyarakat ini bertujuan untuk meningkatkan kompetensi teknis siswa melalui pelatihan dasar Linux. Metode yang digunakan adalah pelatihan berbasis praktik langsung dengan pendekatan hands-on, meliputi materi navigasi file, manajemen proses, jaringan, dan informasi sistem. Hasil kegiatan menunjukkan bahwa peserta mampu memahami dan mengimplementasikan perintah dasar Linux secara mandiri serta menunjukkan peningkatan keterampilan teknis. Pelatihan ini juga memberikan kontribusi dalam mempersiapkan siswa menghadapi kebutuhan industri serta memperkenalkan pemanfaatan teknologi open source. Dengan demikian, kegiatan ini efektif dalam meningkatkan kompetensi siswa di bidang teknologi informasi.
Penerapan Metode Branch and Bound untuk Optimalisasi Rute Wisata Terdekat di Kota Palembang Jaysen Stephanus; Felix Gunawan; Yohannes Yohannes
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/eqadem96

Abstract

This study discusses the application of the Branch and Bound method to optimize the nearest tourist route in Palembang City using the Traveling Salesman Problem (TSP) approach. The problem raised is how to determine the most efficient tourist route from several tourist destinations with minimum travel distance. The study utilizes geographic coordinate data of tourist destinations obtained through OpenStreetMap, then the distance between locations is calculated using the Haversine Formula to obtain an accurate distance estimate based on latitude and longitude. Furthermore, the Branch and Bound Algorithm is used to find the optimal route solution through the process of branching, bounding, and pruning so that the solution search becomes more efficient than the brute force method. The results show that the system successfully produces an optimal circular tourist route with a total minimum distance of 40.47 km and an execution time of 12.84 seconds. The integration of the Haversine Formula and Branch and Bound is proven to be able to provide efficient, accurate, and adaptive tourist route recommendations to help tourists save travel time and transportation costs in Palembang City.
Perbandingan Algoritma Greedy dan Dynamic Programming Pada Optimasi Playlist Spotify Untuk Jogging Fadhel Muhammad; Muhammad Radja Juang Jamemiko; Yohannes Yohannes
Applied Information Technology and Computer Science (AICOMS) Vol 5 No 1 (2026): AICOMS
Publisher : Pengelola Jurnal Politeknik Negeri Ketapang

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.58466/1htfcz49

Abstract

Spotify provides audio metadata that can be utilized to support physical activities such as jogging. This study compares the performance of Greedy and Dynamic Programming algorithms for Spotify playlist optimization modeled as a 0/1 Knapsack Problem. Song duration is treated as weight, while a score derived from popularity and energy is used as value. The dataset was obtained from Spotify Wrapped 2025 Top 50 Songs and Spotify All-Time Top 100 Songs, resulting in 31 candidate songs after preprocessing and filtering. Experiments were conducted on playlist durations of 30, 45, 60, 75, and 90 minutes. The results show that Dynamic Programming consistently achieved higher total scores than Greedy across all scenarios. For the 60-minute playlist, Dynamic Programming obtained a total score of 1897 compared to 1894 achieved by Greedy. However, Greedy required a lower execution time (4.244 ms) than Dynamic Programming (16.196 ms). The average optimality gap between the two methods was 1.89%, indicating that Greedy produced solutions that were close to the optimal solutions generated by Dynamic Programming while requiring less computation time.
Co-Authors Ade Hendri Pandrean Adhytio Mahendra Adityya, Verrino Andreas, Kevin Azarya, Philips Denny Beni Anthony Bobby Jaya Saputra Cahyati, Imelia Dwinora Calvin Oliver Saputra Celvine Adi Putra Cendy Prakarsah Chandra, Adrian Daffa Yudha Musyaffa Dafid Dafid Dandy, Dandy Daniel Udjulawa Daniel Udjulawa Devella, Siska Dody, Muhammad Fadhel Muhammad Famerdi, Farhan Agung Farhan Agung Famerdi Farisi, Ahmad Febbiola Febbiola Felix Gunawan Feristyani, Indah Firda Novia Rahmawati Gerry Jeven Timoti Glen, Billy Hafiz Irsyad Hafiz Irsyad Hartati, Ery Inayatullah, Inayatullah Indah Feristyani Jaysen Stephanus Jendraja Husin Kotan Jericho Jericho Jerry Setiawan Jimmy Aprilyanto Johannes Petrus Jonathan Tanujaya Joseph Eduard Uly Loni Julian Rusli Tee Baldi Juliana Nasution Kelvin Arianto Klaudius Audie Irsansaputra Laksana, Jovansa Putra Leo Chandra Leonardo Leonardo M Dhafa Adjie Saputra M Ezar Al Rivan Marcella, Dewi Meiriyama, Meiriyama Migel Orvin Febryan Molavi Arman Muhammad Farid Athar Muhammad Radja Juang Jamemiko Muhammad Rizky Pribadi Muhammad Yudha Setiawan Muhdhor, Umar Novan Wijaya Nur Rachmat Pandi Pandi Pandi Pandi, Pandi Pandrean, Ade Hendri Philips Denny Azarya Prabowo, Adrianus Prasthio, Rial Putra, Lipi Amanda Ricky Wijaya RR. Ella Evrita Hestiandari Sahpira, Mulia Saputra, Dika Sari, Yulya Puspita Selvie, Selvie Setiawan, Jerry Siska Amelia Siti Fatimah Az Zahrah Sonia Sonia, Sonia Tanuwijaya, William Timoteus Ivan Sariyo Veraldo Wijang Widhiarso William Hadisaputra Yeremia Agung Chandra Yoannita Yoannita Yoannita Yoannita, Yoannita Yulya Puspita Sari