Article Per Year (5 Year)
p-Index From 2021 - 2026
0.408
P-Index
This Author published in this journals
All Journal Jurnal MEKOM: Media Komunikasi Pendidikan Kejuruan Journal of Digital Technology and Computer Science
Andi Sitti Dwi Auliyani
Universitas Negeri Gorontalo
Computer Science & IT Decision Sciences, Operations Research & Management Electrical & Electronics Engineering Engineering

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

Found 2 Documents
Search

 1 
Comparative Analysis of Structural-Based Reduction and Brute Force Algorithms for Determining Metric Dimensions in Tree Graphs Afifah Farhanah Akadji; Abdul Gani F. S. H. Lihawa; Maharani Eka; Karina A. Sasmito; Hendy Prasetyo; Andi Sitti Dwi Auliyani
Journal of Digital Technology and Computer Science Vol. 3 No. 2 (2026): April 2026
Publisher : Academic Bright Collaboration

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.61220/dtcs.v3i2.696

Abstract

Purpose – This study aims to overcome the computational inefficiency of the Brute Force method in determining the metric dimension of tree graphs by evaluating the performance of a Structural-Based Reduction Algorithm. The study addresses the high computational cost of exhaustive search approaches and proposes a more efficient structural alternative. Methods – This research applies a comparative computational experimental approach by implementing both the Brute Force method and the proposed reduction algorithm on non-isomorphic tree graphs obtained from the McKay dataset. The algorithm is based on Slater’s theorem regarding leaves and stem vertices in tree graphs. Instead of testing all possible vertex combinations, the algorithm utilizes structural relationships to determine the metric dimension more efficiently. The comparison focuses on result consistency and computational execution time. Findings – Experimental results show that the proposed reduction algorithm achieves 100% accuracy, producing metric dimension values identical to those generated by the Brute Force method for all tested graphs. In terms of efficiency, the proposed method performs significantly better. For a tree graph with 20 vertices, the Brute Force method requires approximately 79 seconds, while the reduction algorithm completes the computation in only 0.005 seconds. Research implications – The findings indicate that structural analysis can reduce computational complexity in determining metric dimensions of tree graphs. However, the current approach is limited to acyclic graph structures and may require modification for cyclic graphs. Originality – This study introduces a deterministic and scalable alternative for determining metric dimensions in tree graphs through structural reduction principles.
Comparing K-Means and Fuzzy C-Means for Student Academic Risk Mapping and Early Warning in a Basic Mathematics Course Hendy Prasetyo; Wildan; Afifah Farhanah Akadji; Andi Sitti Dwi Auliyani; Rahmad Hidayat Dongka
Jurnal MEKOM (Media Komunikasi Pendidikan Kejuruan) Volume 13, Issue 1, February 2026
Publisher : Fakultas Teknik, Universitas Negeri Makassar

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.26858/mekom.v13i1.261

Abstract

Purpose – This study compares the K-Means and Fuzzy C-Means (FCM) algorithms for mapping student academic risk using in-course academic performance data. Methods – The dataset consisted of 35 students and included assignment scores, quiz scores, midterm examination scores, attendance, learning participation, employment status, and language variables. The data were preprocessed through cleaning, identity anonymization, and min-max normalization to ensure that all attributes were measured on a comparable scale. The experiments were conducted under two clustering scenarios, namely K=2 and K=3. Findings – In the K=2 scenario, both methods produced the same separation between low-risk and high-risk student groups. After the clustering results were mapped to the actual Pass/Fail labels using a majority-vote approach, 27 students who passed and 7 students who failed were correctly identified, with no false positives and 1 false negative. These results yielded 97.14% accuracy, 100% precision, 96.43% recall, and a 98.18% F1-score. In the K=3 scenario, K-Means formed three distinct groups containing 27, 4, and 4 students, whereas FCM produced a more gradual distribution of 13, 14, and 8 students. Research implications – These findings indicate that K-Means is suitable as a fast baseline for binary risk screening, whereas FCM is more informative for gradual risk interpretation in academic early warning systems. Originality – This study contributes by showing the different practical value of hard and soft clustering for identifying clearly at-risk and borderline students using routinely available in-course academic indicators.
Co-Authors Abdul Gani F. S. H. Lihawa Afifah Farhanah Akadji Hendy Prasetyo Karina A. Sasmito Maharani Eka Rahmad Hidayat Dongka Wildan Wildan