Enhanced Long Short-Term Memory (ELSTM) Model for Sentiment Analysis

Sentiment analysis is used to embed an extensive collection of reviews and predicts people's opinion towards a particular topic, which is helpful for decision-makers. Machine learning and deep learning are standard techniques, which make the process of sentiment analysis simpler and popular. In this research, deep learning is used to analyze the sentiments of people. It has an ability to perform automatic feature extraction, which provides better performance, a more vibrant appearance, and more reliable results than conventional feature-based techniques. Traditional approaches were based on complicated manual feature extractions that were not able to provide reliable results. Therefore, the presented study aimed to improve the performance of the deep learning approach by combining automatic feature extraction with manual feature extraction techniques. The enhanced ELSTM model is proposed with hyper-parameter tuning in previous Long Short-Term Memory (LSTM) to get better results. Based on the results, a novel model of sentiment analysis and novel algorithm are proposed to set the benchmark in the field of textual classification and to describe the procedure of the developed model, respectively. The results of the ELSTM model are presented by training and testing accuracy curve. Finally, a comparative study confirms the best performance of the proposed ELSTM model.

Comparison of Supervised Classification Models on Textual Data

Text classification is an essential aspect in many applications, such as spam detection and sentiment analysis. With the growing number of textual documents and datasets generated through social media and news articles, an increasing number of machine learning methods are required for accurate textual classification. For this paper, a comprehensive evaluation of the performance of multiple supervised learning models, such as logistic regression (LR), decision trees (DT), support vector machine (SVM), AdaBoost (AB), random forest (RF), multinomial naive Bayes (NB), multilayer perceptrons (MLP), and gradient boosting (GB), was conducted to assess the efficiency and robustness, as well as limitations, of these models on the classification of textual data. SVM, LR, and MLP had better performance in general, with SVM being the best, while DT and AB had much lower accuracies amongst all the tested models. Further exploration on the use of different SVM kernels was performed, demonstrating the advantage of using linear kernels over polynomial, sigmoid, and radial basis function kernels for text classification. The effects of removing stop words on model performance was also investigated; DT performed better with stop words removed, while all other models were relatively unaffected by the presence or absence of stop words.

Text Classification

In this chapter, a supervised automatic text documents classification using the fuzzy decision trees technique is proposed. Whatever the algorithm used in the fuzzy decision trees, there must be a criterion for the choice of discriminating attribute at the nodes to partition. For fuzzy decision trees usually two heuristics were used to select the discriminating attribute at the node to partition. In the field of text documents classification there is a heuristic that has not yet been tested. This chapter tested this heuristic. The latter was presented in the works of Yuan and Shaw (1995) and was applied in a context different then the textual classification. This heuristic is analyzed and adapted to the author's approach for text documents classification.