Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Jurnal Algoritma

Evaluasi Performa Proof of Work dan Proof of Stake melalui Uji Stres Beban Tinggi Blockchain Yulianti, Indira; Ardiansyah, Rizka; Yazdi Pusadan, Mohammad; Amriana; Lamasitudju, Chairunnisa
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2500

Abstract

Consensus mechanisms play a crucial role in determining the efficiency and scalability of blockchain systems. The two most commonly used algorithms are Proof of Work and Proof of Stake, each exhibiting distinct performance characteristics under high transaction loads. This study aims to evaluate and compare the performance of both consensus mechanisms through a simulation-based experimental approach. Testing was conducted using the Hardhat framework in a local environment under two primary scenarios: transaction scaling and burst transaction.Four evaluation metrics were employed: throughput, transaction latency, finality time, and mempool congestion. The results indicate that Proof of Stake consistently outperforms across all four metrics, demonstrating high throughput, stable latency and finality time, and controlled mempool congestion. In contrast, Proof of Work shows a significant decline in performance under heavy load due to its static and non-adaptive mining process.The Mann-Whitney U statistical test confirms that the performance differences are statistically significant across nearly all metrics. This research provides deeper insights into the strengths and limitations of each consensus mechanism under high-load conditions using Hardhat, and contributes to a broader understanding of blockchain scalability in real-world applications. The findings suggest that Proof of Stake is more suitable for large-scale blockchain implementations that demand high efficiency and speed.
Optimasi Penjadwalan Rapat Berbasis Web Untuk Mengurangi Konflik Jadwal Menggunakan Kombinasi Algoritma Greedy dan Decision Tree Ahmad, Tjoet Muty; Lamasitudju, Chairunnisa Ar.
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.3080

Abstract

The manual meeting scheduling process has a high potential for scheduling conflicts. These conflicts include delays in information, meeting room clashes, or meeting time clashes. These problems are caused by the absence of a system and visualization for managing meeting schedules. To streamline the scheduling process, a website-based meeting scheduling information system was developed for activities that are carried out routinely with high frequency, using a combination of two algorithms that can overcome these problems. The Greedy algorithm is used to detect conflicts, and the rule-based Decision Tree algorithm is used to provide alternative time or room suggestions when schedule conflicts occur. The results of blackbox testing and usability testing prove that the application of these algorithms makes the system more effective and provides the right workflow for this system. This research contributes to the development of an effective meeting scheduling system and integrates two algorithms as a new solution in managing the scheduling process.
Analisis Sentimen Terhadap Kinerja Awal Pemerintahan Menggunakan IndoBERT Dan SMOTE Pada Media Sosial X Ihalauw, Sahron Angelina; Trezandy Lapatta, Nouval; Wiria Nugraha, Deny; Wirdayanti; Ar Lamasitudju, Chairunnisa
Jurnal Algoritma Vol 22 No 2 (2025): Jurnal Algoritma
Publisher : Institut Teknologi Garut

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33364/algoritma/v.22-2.2957

Abstract

Social media platform X has become a key channel for expressing public opinion on political issues, including evaluating the early performance of the government. The first 100 days of an administration are a strategic period to assess policy direction and public perception. This study aims to apply and evaluate the IndoBERT model for sentiment analysis of Indonesian-language tweets discussing the 100-day performance of the Prabowo–Gibran administration, as well as to assess the impact of using the Synthetic Minority Oversampling Technique (SMOTE) to address data imbalance. A total of 15,027 tweets were collected through API crawling and processed through several stages: preprocessing, labeling using the InSet Lexicon, data splitting, and fine-tuning IndoBERT. Two scenarios were tested — without SMOTE and with SMOTE oversampling. The results show that both models achieved the same overall accuracy of 87%, but performance varied across sentiment classes. The model without SMOTE performed better in the positive class with 93% precision, whereas the SMOTE-applied model improved performance in the neutral class (F1-score increased from 70% to 71%; recall from 69% to 71%) and in the negative class (precision increased from 88% to 90%). Considering the balance across classes, the SMOTE-based model was selected as the final model and implemented into a Streamlit application for interactive sentiment analysis. This study expands the application of IndoBERT in the Indonesian political domain by combining the lexical InSet approach with SMOTE oversampling — a combination rarely applied in Indonesian political sentiment analysis. The findings highlight the importance of data balancing strategies in improving transformer-based model performance on imbalanced datasets. Future research is encouraged to explore alternative balancing methods, expand training data, and test other transformer variants to enhance accuracy and generalization.