Adnan, Adam
Unknown Affiliation

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

Found 2 Documents
Search

Ensemble semi-supervised learning in facial expression recognition Purnawansyah, Purnawansyah; Adnan, Adam; Darwis, Herdianti; Wibawa, Aji Prasetya; Widyaningtyas, Triyanna; Haviluddin, Haviluddin
International Journal of Advances in Intelligent Informatics Vol 11, No 1 (2025): February 2025
Publisher : Universitas Ahmad Dahlan

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26555/ijain.v11i1.1880

Abstract

Facial Expression Recognition (FER) plays a crucial role in human-computer interaction, yet improving its accuracy remains a significant challenge. This study aims to enhance the robustness and effectiveness of FER systems by integrating multiple machine learning techniques within a semi-supervised learning framework. The primary objective is to develop a more effective ensemble model that combines Long Short-Term Memory (LSTM), Convolutional Neural Networks (CNN), Support Vector Classifier (SVC), and Random Forest classifiers, utilizing both labeled and unlabeled data. The research implements data augmentation and feature extraction techniques, utilizing advanced architectures such as VGG19, ResNet50, and InceptionV3 to improve the quality and representation of facial expression data. Evaluations were conducted across three dataset scenarios: original, feature-extracted, and augmented, using various label-to-unlabeled ratios. The results indicate that the ensemble model achieved a notable accuracy improvement of 87% on the augmented dataset compared to individual classifiers and other ensemble methods, demonstrating superior performance in handling occlusions and diverse data conditions. However, several limitations exist. The study’s reliance on the JAFFE dataset may restrict its generalizability, as it may not cover the full range of facial expressions encountered in real-world scenarios. Additionally, the effect of label-to-unlabeled ratios on the model's performance requires further exploration. Computational efficiency and training time were also not evaluated, which are critical considerations for practical implementation. For future research, it is recommended to employ cross-validation methods for more robust performance evaluation, explore additional data augmentation techniques, optimize ensemble configurations, and address the computational efficiency of the model to better advance FER technologies.
K-Means and K-Medoid in Clustering Analysis of Network Congestion Level Darwis, Herdianti; Purnawansyah, Purnawansyah; Umalekhoa, Alfi Syahrin; Adnan, Adam; Salim, Yulita; Umar, Fitriyani; Raja, Roesman Ridwan; Fajar AR, Muh. Aqil
ILKOM Jurnal Ilmiah Vol 17, No 3 (2025)
Publisher : Prodi Teknik Informatika FIK Universitas Muslim Indonesia

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33096/ilkom.v17i3.2083.323-335

Abstract

This research investigates the application of clustering techniques to network congestion data at Universitas Muslim Indonesia, employing a hybrid metric approach based on packet loss and delay. The study utilized two algorithms, K-Means and K-Medoid, applied in a semi-supervised scenario to group 255,147 network data points into 3, 4, and 5 clusters, considering 10 principal variables. During the pre-processing phase, data cleansing was conducted to address missing values, followed by normalization to standardize the scale of numerical variables, thereby preparing the data for the clustering process. Model validation was performed using four cluster evaluation methods: Gap Statistic, Davies-Bouldin Index, and Elbow Method. The evaluation results indicate that both algorithms were capable of forming valid and reliable clusters. However, the K-Means algorithm demonstrated superior performance compared to K-Medoid, particularly when utilizing three Quality of Service variables: throughput, packet loss, and delay. In this configuration, K-Means yielded more stable clusters, a clearer separation between clusters, and a more structured visualization. Consequently, K-Means is considered more optimal for classifying network congestion levels and presents an effective approach for network data segmentation