Jonathan Tanujaya
Universitas Multi Data Palembang

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

Found 2 Documents
Search

Analisis Sentimen Masyarakat terhadap Kenaikan Harga BBM Non-Subsidi Akibat Penutupan Selat Hormuz Menggunakan IndoBERT Jaysen Stephanus; Jonathan Tanujaya; Muhammad Rizky Pribadi
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/kx4xgz78

Abstract

Public discussions regarding the potential increase in non-subsidized fuel prices resulting from the closure of the Strait of Hormuz on the X platform between January 1, 2026, and May 17, 2026, were highly intensive and generated diverse public responses to the global economic impacts triggered by the geopolitical conflict between Iran and Israel. The primary issue addressed in this study is the growing public concern over the possibility of rising non-subsidized fuel prices, which may affect transportation costs, logistics distribution, and daily living expenses. This study aims to analyze public sentiment toward this issue using the IndoBERT deep learning model to obtain a more accurate understanding of public opinion trends. Data were collected through a scraping process on the X platform using keywords related to non-subsidized fuel and the Strait of Hormuz. The collected data were then processed through several preprocessing stages, including case folding, noise removal, tokenization, stopword removal, and stemming, before being classified into positive, neutral, and negative sentiment categories. Out of 412 analyzed tweets, negative sentiment emerged as the dominant category at 49.8%, followed by neutral sentiment at 48.5%, while positive sentiment accounted for only 1.7%. The findings indicate that the majority of the public expressed concern regarding the potential increase in non-subsidized fuel prices and its impact on economic conditions and household expenditures.
Perbandingan Kinerja Algoritma Greedy dan Dynamic Programming dalam Optimasi Diskon Keranjang Belanja E-Commerce Menggunakan Dataset Online Retail UCI Jonathan Tanujaya; Daffa Yudha Musyaffa; 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/f0fdve41

Abstract

E-commerce platforms heavily rely on automated promotional strategies, such as tiered discounts, to enhance customer loyalty. Therefore, this study aims to analyze the performance of computational algorithms in determining item priorities within a shopping cart under promotional budget constraints. The 0/1 Knapsack Problem was addressed by comparing two computational approaches: Dynamic Programming (DP) and the Greedy Algorithm. Transaction data from the UCI Online Retail dataset were cleaned and aggregated into 3,746 unique product catalogs, then simulated using a promotional budget limit of £499.40 with a 10% discount policy. Computational experiments revealed contrasting trade-off characteristics between the two approaches. The DP algorithm guaranteed an absolute optimal solution with a total profit of £2,725,575.77 but required 28.10 seconds of computation time. In contrast, the Greedy algorithm completed the selection process in a fraction of a second (0.17 seconds) while incurring only a marginal profit deficit of 0.01%. The Greedy heuristic approach proved to be highly practical and efficient for integration into real-time user interface systems, whereas the superior accuracy of DP makes it more suitable for offline database processing and inventory analytics research.