文章基本信息

标题：Clustering Based Sentiment Analysis Using Randomized Clustering Cuckoo Search Algorithm
本地全文：下载
作者：Samar H. Ahmed ; Khalid Tawfik Wassif ; Emad Nabil 等
期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2020
卷号：20
期号：7
页码：159-166
出版社：International Journal of Computer Science and Network Security
摘要：Nowadays online social networks have become one of the most important platforms, where people all over the world express their opinions, feelings, and their own experience. They do so either by texting or using images, emoji, and videos. Sentiment analysis of social media data is very important in making decisions in different areas. For example, corporates need to know what people feel regarding their products, governments need to understand public opinion towards certain decisions. In this paper, we designed an architecture that can be used to analyze social media text data sentiments based on their clustering. The suggested architecture composed from three main components namely: data cleaning, similarity finding, and randomized clustering Cuckoo search (RCCS). A formula that combine the similarity degree is suggested to improve the accuracy. As well, we utilized the power of the Cuckoo Search with the Levy flight algorithm to cluster the text data. Our architecture is used to detect the optimal or near-optimal number of clusters that best describe a text dataset. To test our model, we used the Niek Sanders tweets dataset. The proposed model achieved better performance comparing it with the other six algorithms. The six algorithms involved in our comparisons are K-Means, Latent Dirichlet Allocation (LDA), Scalable Multi-stage Clustering (SMSC), and Grouping Like-minded people using Interests Centers GLIC algorithm with its three different variations. According to our experiments, we claim that our model is efficient and very helpful in the sentiment analysis of social media text data
关键词：Clustering;Cuckoo Search algorithm;Textual Sentiment Analysis;Levy Flights; Levenshtein distance.