Claim Missing Document
Check
Articles

Found 8 Documents
Search
Journal : Building of Informatics, Technology and Science

Decision Support System for Tourist Attraction Recommendations Using Reciprocal Rank and Multi-Objective Optimization on the basis of Ratio Analysis Ariany, Fenty; Suryono, Ryan Randy; Setiawansyah, Setiawansyah
Building of Informatics, Technology and Science (BITS) Vol 5 No 3 (2023): December 2023
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v5i3.4663

Abstract

A tourist attraction is a destination or place visited by tourists to enjoy a variety of attractions, natural beauty, culture, history, or recreation. Attractions can be beaches, mountains, lakes, national parks, historical buildings, museums, amusement parks, and much more. One common problem is confusion in choosing the right attraction, where the information available is incomplete or inaccurate, causing tourists difficulty in making the right decision. Therefore, there needs to be a holistic and integrated approach in choosing tourist attractions, taking into account these aspects so that the tourist experience becomes more meaningful and meaningful for all parties involved. The research objective of the Attraction Recommendation Decision Support System Using Reciprocal Rank and MOORA is to develop a system that can provide optimal attraction recommendations to users based on their preferences against diverse criteria, such as distance, cost, travel time, and cleanliness level. By using the Reciprocal Rank approach to take into account the user's subjective preferences towards each criterion. Meanwhile, by applying MOORA, this study aims to optimize the relative performance of alternative attractions based on the relationship between criteria. Thus, this research is to provide useful tools for users to make better and more informed decisions. The ranking results provide recommendations for alternative krui beach with a final value of 0.3752 to rank 1, alternative tanjung setia beach with a final value of 0.3558 to rank 2, alternative klara beach with a final value of 0.3512 to rank 3
Perbandingan Kinerja Algoritma Random Forest, KNN, dan SVM dalam Analisis Sentimen Cryptocurrency AndaruJaya, Rinaldi Sukma; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 6 No 4 (2025): March 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v6i4.6572

Abstract

Cryptocurrency is a digital money based on blockchain technology that offers security and transparency in transactions, so it has increasingly attracted the attention of the public, including in Indonesia. With the number of investors surpassing 20 million, cryptocurrencies have generated a variety of opinions on social media. Some see it as a promising modern investment opportunity, while others highlight the risks of price fluctuations, security, and unclear regulations. To understand public sentiment towards cryptocurrencies, machine learning-based sentiment analysis is a relevant solution. This research compares the performance of three popular algorithms, namely Random Forest, K-Nearest Neighbors (KNN), and Support Vector Machine (SVM), in sentiment analysis of public opinion. These three algorithms have different advantages and disadvantages, depending on the characteristics of the data and the purpose of the analysis. Random Forest is known to be stable but requires high computation, KNN is easy to apply but less reliable on high-dimensional data, and SVM excels at separating complex data but requires careful parameter tuning. Previous research has shown differences in the accuracy of these three algorithms on various datasets, so further evaluation is needed to determine the most effective algorithm. The results of this study are expected to provide guidance in choosing the right algorithm for sentiment analysis, especially on cryptocurrency-related opinion data, as well as expand the understanding of the application of algorithms on dynamic and complex data.
Analisis Sentimen Acara Clash of Champions dengan Algoritma Naïve Bayes dan Support Vector Machine Purnama, Putri Intan; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 6 No 4 (2025): March 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v6i4.6575

Abstract

With the advancement of information and communication technology, it has become easier for people to exchange information and access educational content, including through online learning platforms such as Ruangguru. One of Ruangguru's flagship programs is Clash of Champions, which attracts public attention and generates various sentiments on social media. However, analyzing public sentiment towards this program faces challenges, especially due to the imbalance in the amount of data between majority and minority sentiments, which may affect the accuracy of sentiment analysis models. This study aims to compare the performance of two algorithms, namely Naïve Bayes and Support Vector Machine (SVM), in analyzing public sentiment towards this program. Using 5,226 tweets from social media X, the data was balanced using the Synthetic Minority Oversampling Technique (SMOTE) method to overcome the data imbalance problem. After the data was divided into 80% for training and 20% for testing, the results showed that before using SMOTE, Naïve Bayes had an accuracy of 78%, while SVM reached 82%. After SMOTE was applied, Naïve Bayes' accuracy increased to 79%, while SVM rose to 84%. In addition to accuracy, significant improvements were also seen in precision, recall, and f1-score, especially for positive sentiments. The results show that SVM is superior to Naïve Bayes, both in accuracy and other evaluation metrics. This research provides an in-depth understanding of the effectiveness of algorithms in sentiment analysis on entertainment-based educational programs and is expected to be a reference for the development of similar models in the future.
Perbandingan Algoritma Random Forest, KNN, SVM Untuk Analisis Sentimen Pengalaman Belanja Thrift Di X Raihandika, M Rafi; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 6 No 4 (2025): March 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v6i4.6797

Abstract

The thrifting phenomenon is gaining traction, especially among millennials and Generation Z. Along with the increasing interest in thrifting, X social media has emerged as one of the main platforms for people to share experiences and opinions related to thrift shopping. This research aims to analyze people's sentiments about thrift shopping experiences by comparing the performance of Random Forest, Support Vector Machine (SVM), and K-Nearest Neighbors (KNN) algorithms. The dataset used in this study was obtained from Twitter as many as 6,390 tweets collected through crawling techniques with a time span of August 2, 2024 to September 4, 2024. The dataset is then processed to produce clean data. After the cleaning process, the data is divided 80:20 for training and testing. In testing the three algorithms, an accuracy level is obtained that shows how well the model makes predictions. This accuracy measures the extent to which the model successfully predicts the sentiment of the thrifting shopping experience based on the Twitter dataset. The results show that the Random Forest algorithm has the highest accuracy with 95%, precision 97%, recall 78%, and f1-score 85%. SVM achieved 93% accuracy, 93% precision, 72% recall, and 78% f1-score. KNN obtained 89% accuracy, 72% precision, 59% recall, and 61% f1-score. From the results obtained, the Random Forest algorithm shows the best accuracy for sentiment analysis of thrifting experiences on Twitter Indonesia. Its advantage lies in its stable ensemble learning approach, where multiple decision trees are combined to produce more accurate predictions. This ability makes Random Forest effective in handling varied and complex Twitter text data, making it the most reliable algorithm in this context.
Perbandingan Algoritma Naive Bayes dan SVM dalam Analisis Sentimen Pengguna AI di Platform X Firdaus, Noval Dinda; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 6 No 4 (2025): March 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v6i4.7081

Abstract

The rapid development of artificial intelligence (AI) has also had a significant impact on various aspects of life, including interactions on social media platforms such as Platform X. On this platform, users actively discuss various topics related to AI, from the benefits to the challenges it poses. Understanding how the public responds to AI technology is important for developers, researchers, and policy makers in order to design strategies that are more in line with the needs and expectations of the community. This study aims to evaluate and compare the performance of two algorithms commonly used in sentiment analysis, namely Naïve Bayes and Support Vector Machine (SVM). Data were collected through crawling techniques using Google Colab, which resulted in 9,183 entries. Before the analysis was carried out, the data went through a series of initial processing stages, including text cleaning, letter normalization, tokenization, removing frequently used words (stopword removal), and stemming to simplify words. The results of the analysis show that SVM has advantages in terms of accuracy and capability, namely 96% accuracy in handling complex data, while Naïve Bayes is faster in the computational process and efficient for large datasets, resulting in an accuracy of 84% smaller than SVM accuracy. The assessment is carried out using accuracy, precision, recall, and F1-score metrics based on the confusion matrix.
Perbandingan Algoritma SVM, Random Forest, dan Naive Bayes Terhadap Kasus Scam di Media Sosial Twitter Saputra, Rizky Herdian; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 7 No 2 (2025): September 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i2.7236

Abstract

The rapid growth of information and communication technology has a significant impact on the level of cybercrime. The internet, which was originally used to expedite the exchange of information, is also misused by irresponsible parties. One of the prevalent forms of crime is scams, which are fraudulent activities aimed at gaining unlawful profits by exploiting victims through various tactics. The purpose of this research is to evaluate and compare the performance of three algorithms: Support Vector Machine (SVM), Random Forest, and Naive Bayes in analyzing public sentiment regarding scam cases on social media Twitter. The dataset consists of 9,132 tweets, which undergo preprocessing stages such as cleaning, case folding, and word normalization, leaving 8,879 tweets for analysis. Then, the Synthetic Minority Over-sampling Technique (SMOTE) is applied, with the dataset divided into 80% for training and 20% for testing. The results show that before applying SMOTE, the SVM algorithm achieved the highest accuracy at 82%, followed by Random Forest at 79%, and Naive Bayes at 74%. After applying SMOTE, accuracy significantly increased, with SVM reaching 88%, Random Forest at 84%, and Naive Bayes at 76%. This demonstrates that in sentiment analysis of scam cases, the SVM method achieves higher accuracy than both Random Forest and Naive Bayes.
Analisis Sentimen Publik Terhadap Danantara di Media Sosial X Menggunakan Naïve Bayes dan Support Vector Machine Firmanda, Fabian; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 7 No 2 (2025): September 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i2.7250

Abstract

Danantara a state-owned investment management institution, has become a topic of widespread public discussion, particularly on social media platform X, where diverse public opinions are expressed. This study aims to evaluate public sentiment toward Danantara through sentiment analysis using machine learning techniques. The dataset consists of 10,108 tweets, of which 9,790 tweets remained after the preprocessing stage and were ready for analysis. The methodology involves word weighting using Term Frequency-Inverse Document Frequency (TF-IDF) and the implementation of two classification algorithms: Naïve Bayes and Support Vector Machine (SVM). To address the class imbalance in sentiment data, the Synthetic Minority Over-sampling Technique (SMOTE) was applied. Model performance was evaluated using metrics such as accuracy, precision, recall, and F1-score. Initial results show that before applying SMOTE, the Naïve Bayes algorithm achieved an accuracy of 64%, while SVM performed better with an accuracy of 80%. After applying SMOTE, Naïve Bayes accuracy improved to 72%, and SVM increased significantly to 89%. These results indicate that SMOTE is effective in handling data imbalance and enhancing classification performance. Overall, this study provides a clearer picture of public opinion toward Danantara and demonstrates that the combination of preprocessing, TF-IDF, machine learning algorithms, and data balancing techniques can produce more accurate sentiment analysis.
Analisis Sentimen Publik Terhadap Deepfake AI Menggunakan Aplikasi X Dengan Metode Support Vector Machine dan Naive Bayes Classifier Al Afif, Satria; Suryono, Ryan Randy
Building of Informatics, Technology and Science (BITS) Vol 7 No 2 (2025): September 2025
Publisher : Forum Kerjasama Pendidikan Tinggi

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.47065/bits.v7i2.8303

Abstract

The rapid development of artificial intelligence (AI) technology has driven increased public interaction with AI-based platforms, including Deepfake AI. One of the main challenges that arises is how to objectively assess public opinion, particularly on social media, which serves as a primary medium for expressing opinions. This study aims to compare the performance of two machine learning algorithms, namely Support Vector Machine (SVM) and Naïve Bayes (NB), in analyzing public sentiment toward Deepfake AI on the X social media platform. The research dataset consists of 7,774 tweets collected between October and November 2024. After preprocessing, 5,559 tweets were used, categorized into three sentiment classes: positive, negative, and neutral. Data imbalance was addressed using the Synthetic Minority Over-sampling Technique (SMOTE), with 80% of the data allocated for training and 20% for testing. The results show that before applying SMOTE, the SVM algorithm achieved the highest accuracy at 71%, while Naïve Bayes only reached 62%. After the application of SMOTE, the performance of both algorithms improved, with SVM achieving 77% accuracy and Naïve Bayes reaching 68%. Thus, SVM proved to be the best-performing algorithm in this study, both before and after SMOTE application, delivering more balanced results across sentiment classes. This research demonstrates that sentiment analysis based on machine learning can be utilized to understand public opinion toward AI platforms, while also providing valuable insights for developers to improve service quality and strengthen public trust.
Co-Authors ., Bagastian Achmad Nizar Hidayanto Ade Dwi Putra Aditia Yudhistira Agresia, Vania Ahmad Ari Aldino Ajie Tri Hutama Al Afif, Satria Anadas, Sylvi Ananda, Dhea AndaruJaya, Rinaldi Sukma Ansyah, Ferdi Ariany, Fenty Arshad, Muhammad Waqas Bagus Reynaldi, Dimas Bakti, Da'i Rahman Bhatara, Dimas Wahyu Budi Santosa Budi Santosa Budiawan, Aditia Budiman, Ega Christ Mario Cynthia Deborah Nababan Dana Indra Sensuse Dana Indra Sensuse Darmini Darmini DAVID KURNIAWAN Dede Krisna Friansyah Dedi Darwis Desi Fitria Dewantoro, Mahendra Dinda Septia Ningsih Dwi Nanda Agustia Dyah Ayu Megawaty Eko Putro, Dimas Eskiyaturrofikoh, Eskiyaturrofikoh Firdaus, Noval Dinda Firmanda, Fabian Fudholi, Muhammad Fahmi Gunawan, Rakhmat Dedi Handini, Meitry Ayu Hasiholan Simamora, Alfred Heni Sulistiani Hermana, BP Putra Ignatius Adrian Mastan Indra Budi INDRIANI, YULIA Isnain, Auliya Rahman Iwan Purwanto Iwan Purwanto Juarsa, Doris Junita, Elvika Alya Kamrozi Karimah Sofa Kautsarina Kautsarina Kautsarina Kautsarina Kautsarina Kautsarina Kautsarina Krishna Yudhakusuma P.M. Laksono, Urip Hadi Megawaty, Dyah Ayu Meliana, Yovi Mesran, Mesran Miranda, Khyntia Muh. Alviazra Virgananda Muhamad Adhytia Wana Putra Rahmadhan Muhammad Fadli Muhammad Ridwan Muhammad Waqas Arshad Mustaqim, Ilham Zharif Natasha Panca Hadi Putra Prasetio, Mugi Pratama, Rangga Rizky Pratiwi, Adelia Purnama, Putri Intan Purwanti, Dian Sri Rachmad Nugroho Rachmi Azanisa Putri Rahmat Dedi Gunawan Raihandika, M Rafi Ramadhani, Bagus Reifco Harry Farrizqy Rias Kumalasari Devi Riyama Ambarwati Sanjaya, Ival Sanriomi Sintaro Saputra, Melian Jefri Saputra, Rizky Herdian Sari, Kevinda Sari, Putri Kumala Sarumpaet, Lisyo Hileria Setiawan, Andra Setiawansyah Setiawansyah Setyani, Tria Simarmata, Yohanes Sobirin, Muhammad Hamdan Sulistiyo, Raka Sumanto, Sumanto Surono, Muhammad Surya Indra Gunawan Tri Widodo Ulum, Faruk Wahyudi, Agung Deni Wang, Junhai Waqas Arshad, Muhammad Yeni Agus Nurhuda Yeni Agus Nurhuda Yuri Rahmanto Yuspita, Emi