Skip to Content
You are currently on the new version of our website. Access the old version .
DataData
  • Article
  • Open Access

23 May 2019

13 Pages

Ensemble Based Classification of Sentiments Using Forest Optimization Algorithm

,
and
1
Department of Computer Science; National University of Computer and Emerging Sciences, Lahore 54770, Pakistan
2
School of Science and Technology; University of Management and Technology, Lahore 54782, Pakistan

Abstract

Feature subset selection is a process to choose a set of relevant features from a high dimensionality dataset to improve the performance of classifiers. The meaningful words extracted from data forms a set of features for sentiment analysis. Many evolutionary algorithms, like the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO), have been applied to feature subset selection problem and computational performance can still be improved. This research presents a solution to feature subset selection problem for classification of sentiments using ensemble-based classifiers. It consists of a hybrid technique of minimum redundancy and maximum relevance (mRMR) and Forest Optimization Algorithm (FOA)-based feature selection. Ensemble-based classification is implemented to optimize the results of individual classifiers. The Forest Optimization Algorithm as a feature selection technique has been applied to various classification datasets from the UCI machine learning repository. The classifiers used for ensemble methods for UCI repository datasets are the k-Nearest Neighbor (k-NN) and Naïve Bayes (NB). For the classification of sentiments, 15–20% improvement has been recorded. The dataset used for classification of sentiments is Blitzer’s dataset consisting of reviews of electronic products. The results are further improved by ensemble of k-NN, NB, and Support Vector Machine (SVM) with an accuracy of 95% for the classification of sentiment tasks.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.