IDEAS home Printed from https://ideas.repec.org/a/gam/jdataj/v4y2019i2p76-d233814.html
   My bibliography  Save this article

Ensemble Based Classification of Sentiments Using Forest Optimization Algorithm

Author

Listed:
  • Mehreen Naz

    (Department of Computer Science; National University of Computer and Emerging Sciences, Lahore 54770, Pakistan)

  • Kashif Zafar

    (Department of Computer Science; National University of Computer and Emerging Sciences, Lahore 54770, Pakistan)

  • Ayesha Khan

    (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.

Suggested Citation

  • Mehreen Naz & Kashif Zafar & Ayesha Khan, 2019. "Ensemble Based Classification of Sentiments Using Forest Optimization Algorithm," Data, MDPI, vol. 4(2), pages 1-13, May.
  • Handle: RePEc:gam:jdataj:v:4:y:2019:i:2:p:76-:d:233814
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2306-5729/4/2/76/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2306-5729/4/2/76/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jdataj:v:4:y:2019:i:2:p:76-:d:233814. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.