Claim Missing Document
Check
Articles

Found 2 Documents
Search

Klasifikasi Emosi pada Data Teks Pidato Politik Menggunakan Metode RoBERTa Saputro, Safitri Ramadhayanti; Ramadhayanti Saputro, Safitri; Arifianto, Deni; Adi Cahyanto, Triawan
Jurnal Teknologi Informasi dan Ilmu Komputer Vol 13 No 1: Februari 2026
Publisher : Fakultas Ilmu Komputer, Universitas Brawijaya

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.25126/jtiik.2026131

Abstract

Analisis emosi dalam teks merupakan salah satu cabang penting dalam Natural Language Processing (NLP), khususnya dalam memahami pesan tersirat pada pidato politik. Pidato politik tidak hanya menyampaikan informasi, tetapi juga emosi yang bertujuan membentuk opini publik. Penelitian ini memanfaatkan model RoBERTa untuk mengklasifikasikan emosi dalam pidato Presiden Joko Widodo selama periode 2014–2024. Data diperoleh dari transkrip video resmi, menghasilkan 2952 paragraf yang telah dilabeli secara otomatis menggunakan model pre-trained `Indonesian-roberta-base-emotion-classifier`. Langkah praproses dilakukan melalui tahapan cleaning, lowercasing, tokenisasi, dan one-hot encoding. Selanjutnya, model RoBERTa dilakukan fine-tuning menggunakan batch size 16, learning rate 1e-5, dan 3 epoch. Evaluasi performa dilakukan dengan confusion matrix dan metrik akurasi, presisi, recall, dan F1-score. Hasil menunjukkan model mampu mengklasifikasikan lima emosi (anger, fear, happy, love, dan sadness) dengan akurasi 90%, presisi 91%, recall 90%, dan F1-score 0,91. Temuan ini menunjukkan bahwa RoBERTa efektif digunakan untuk klasifikasi emosi dalam teks pidato politik berbahasa Indonesia dan memberikan kontribusi terhadap pengembangan NLP dalam konteks komunikasi politik.   Abstract Emotion analysis in texts is a significant branch of Natural Language Processing (NLP), particularly in understanding implicit messages in political speeches. Political speeches not only convey information but also express emotions to shape public opinion. This study utilizes the RoBERTa model to classify emotions in the speeches of President Joko Widodo during the 2014–2024 period. The dataset was obtained from official video transcripts, resulting in 2952 paragraphs labeled automatically using the pre-trained model `Indonesian-roberta-base-emotion-classifier`. The preprocessing stages included text cleaning, lowercasing, tokenization, and one-hot encoding. The RoBERTa model was fine-tuned using a batch size of 16, a learning rate of 1e-5, and 3 epochs. Performance evaluation was conducted using a confusion matrix and metrics such as accuracy, precision, recall, and F1-score. The results show that the model can classify five emotions (anger, fear, happy, love, and sadness) with 90% accuracy, 91% precision, 90% recall, and an F1-score of 0.91. These findings demonstrate that RoBERTa is effective for emotion classification in Indonesian political speech texts and contributes to the development of NLP in political communication contexts.  
DC3-GSky: Exact Streaming Group Skyline Query Processing via Compressed Frontier Representation Adi Cahyanto, Triawan; Djatna, Taufik; Annisa, Annisa; Rahmawan, Hendra; Sukoco, Heru
Journal of Electrical Engineering and Computer (JEECOM) Vol 8, No 4 (2026)
Publisher : Universitas Nurul Jadid

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.33650/jeecom.v8i4.16998

Abstract

Group Skyline (G-Skyline) queries identify Pareto-optimal groups of k objects that are not dominated by any other group of the same size, extending skyline analysis from individual objects to combinatorial group selection. Existing streaming algorithms, including the sliding-window methods of Dong et al. and the incremental candidate-maintenance approach of Guo et al., explicitly enumerate and materialize candidate groups, making their scalability dependent on output cardinality. Under anti-correlated attribute distributions, the number of qualifying groups can grow combinatorially, exceeding practical memory and computation limits before an exact result is obtained. This paper introduces DC3-GSky, an exact algorithm that reformulates G-Skyline group counting as a frontier decision-diagram traversal over the dominance poset, merging structurally equivalent intermediate states rather than enumerating groups individually. On a streaming benchmark of 10,000 active sensor readings under correlated, independent, and anti-correlated distributions, DC3-GSky remains within 3.3% of the fastest enumeration baseline for small outputs (0.0251 s vs. 0.0243 s on independent data) and computes the exact count of 166,616,670,000 groups, matching C(10,000,3), in 0.0752 s. Uncapped small-scale validation further indicates that enumeration would require approximately 27 hours and 27 TB of memory for the linear baseline and roughly 12 million years for the quadratic baseline. These results show that the exact G-Skyline scalability depends critically on the output cardinality and representation strategy, not the input size alone.