Classification Methods in Sentiment Analysis of Customers Statisfaction as a Services Improvement Strategy

Authors

  • Wiwin Windihastuty Universitas Budi Luhur
  • Yani Prabowo Universitas Budi Luhur
  • M.N. Farid Thoha Universitas Budi Luhur

Keywords:

Sentiment Analysis, Confusion Matrix, Customer Satisfaction, Automotive

Abstract

Customer satisfaction is a crucial indicator in assessing the quality of a company's products, services and overall experience. This research aims to identify the level of customer satisfaction and optimize the available data for effective use in sentiment analysis. In this study, we analyzed 4,353 customer reviews collected over the past year, with 3,481 reviews used as training data and 871 reviews as testing data. The analysis process was conducted using the Cross-Industry Standard Process for Data Mining (CRISP-DM) approach and leveraged the Logistic Regression algorithm to build a predictive model. Model evaluation using the confusion matrix yielded an accuracy of 94.60%, a precision of 94.26%, and a recall of 94.60%. The analysis was conducted using Jupyter Notebook and the Python programming language. The results indicate that sentiment analysis is effective in identifying and predicting customer satisfaction levels, which in turn can help a company’s products improve its service strategies. The optimization of previously underutilized data now provides deeper insights into customer perceptions and expectations, enabling the company to make more targeted decisions and enhance overall customer satisfaction.

Downloads

Download data is not yet available.

Downloads

Published

2024-12-31

How to Cite

Wiwin Windihastuty, Yani Prabowo, & M.N. Farid Thoha. (2024). Classification Methods in Sentiment Analysis of Customers Statisfaction as a Services Improvement Strategy . Proceeding of the International Conference on Management, Entrepreneurship, and Business, 1(1), 228–231. Retrieved from https://prosiding.arimbi.or.id/index.php/ICMEB/article/view/74

Similar Articles

1 2 3 4 5 > >> 

You may also start an advanced similarity search for this article.