Claim Missing Document
Check
Articles

Found 3 Documents
Search
Journal : Journal of Computer Science and Information Systems (JCoInS)

Penerapan Data mining Klasifikasi Tingkat Kepuasan Mahasiswa Terhadap Pelayanan Akademik Menggunakan Metode Naïve Bayes Dan Support Vector Machine (Studi Kasus Program Studi Sistem Informasi Universitas Labuhanbatu) Antika, Dewi; Harahap, Syaiful Zuhri; Ah, Rahma Muti; Juledi, Angga Putra
Journal of Computer Science and Information System(JCoInS) Vol 6, No 3: JCoInS | 2025
Publisher : Universitas Labuhanbatu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36987/jcoins.v6i3.7917

Abstract

This study was conducted to classify public satisfaction levels using the Support Vector Machine (SVM) algorithm as the primary data analysis method. The objective of this study was to obtain an accurate and reliable prediction model for determining the Satisfaction and Dissatisfaction categories based on the available data. The theoretical basis used refers to the concept of machine learning, specifically SVM, which works by forming an optimal hyperplane to separate data classes. In addition, model evaluation theories such as the Confusion Matrix were used to objectively measure prediction performance. The research methodology included data collection, pre-processing, dividing the dataset into training and test data, and training the SVM model. Evaluation was conducted using accuracy, sensitivity, and specificity metrics to assess the model's ability to predict data accurately. The results and discussion indicate that the SVM successfully classified the majority of data correctly, with the Satisfaction class having a perfect prediction rate while the Dissatisfaction class still had a small error. Further analysis indicated the need for SVM parameter optimization to improve accuracy in the minority class. The conclusion of this study states that the SVM has good performance in classifying public satisfaction data, although it still requires refinement in recognizing certain class patterns. This finding opens up opportunities for developing more adaptive methods to improve predictive performance.
Kepatuhan Pembayaran Pajak Kendaraan Bermotor Menggunakan Algoritma Decision Tree Dan Random Forest Di Samsat Balige Wijaya, Alief Achmad; Harahap, Syaiful Zuhri; Ah, Rahma Muti; Nasution, Marnis
Journal of Computer Science and Information System(JCoInS) Vol 6, No 3: JCoInS | 2025
Publisher : Universitas Labuhanbatu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36987/jcoins.v6i3.7934

Abstract

This study aims to analyze and predict the total category of Motor Vehicle Tax (PKB) payments based on payment attributes and vehicle types, which is important to improve the effectiveness of tax management and support more appropriate decision making in related agencies; within the theoretical framework, classification models such as Decision Tree and Random Forest are used to predict data categories by utilizing historical patterns in the dataset, because these algorithms are able to capture interactions between attributes and provide logical interpretations of the prediction results; the research methodology is carried out using secondary data of PKB payments for 2024 from Samsat Balige, which is divided into training data and test data for the classification process and its performance is evaluated using accuracy, precision, recall, and F1-Score metrics through the Performance operator in RapidMiner; the results of the study show that Random Forest produces a more balanced prediction distribution with 100% accuracy, while Decision Tree has 96% accuracy but tends to be biased towards the “Low” category, and analysis of important attributes such as Fines, Total Amount, and the number of Jeep and Truck type vehicles shows a significant influence on the PKB payment category; Thus, the research conclusion confirms that Random Forest is proven to be more effective and stable than Decision Tree in predicting the total PKB payment category, is able to capture complex patterns between attributes, and provides accurate predictions on relatively small datasets, making it the optimal choice for PKB data classification.
Model Prediktif Kepuasan Pelanggan Pada Hotel Platinum Menggunakan Motode K-Means Clustering Siregar, Siti Kholijah; Harahap, Syaiful Zuhri; Ah, Rahma Muti; Munthe, Ibnu Rasyid
Journal of Computer Science and Information System(JCoInS) Vol 6, No 3: JCoInS | 2025
Publisher : Universitas Labuhanbatu

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.36987/jcoins.v6i3.7935

Abstract

Customer satisfaction is a key pillar of success in the competitive hospitality industry, directly impacting loyalty and profitability. Recognizing this, Platinum hotels need the ability to predict guest satisfaction in order to refine their service strategies. This study focuses on the development of predictive models of customer satisfaction at Platinum hotel using the K-Means Clustering method. This method was chosen because of its effectiveness in grouping complex data into homogeneous segments based on common characteristics. Customer Data will be grouped by attributes of their stay to identify different segments of customers with unique levels of satisfaction and preferences. It is hoped that this model can provide deep insights into customer profiles, reveal hidden patterns, and predict future guest expectations. The results of this study will contribute to improving the quality of Service and strategic decision-making at Platinum hotels and can be a reference for the hospitality industry in implementing a data-driven approach.