Show simple item record

dc.contributor.authorOnan, A. and Korukoğlu, S. and Bulut, H.
dc.date.accessioned2020-07-02T07:10:50Z
dc.date.available2020-07-02T07:10:50Z
dc.date.issued2017
dc.identifier.citationcited By 32
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85014936437&doi=10.1016%2fj.ipm.2017.02.008&partnerID=40&md5=a5a3391b10db6f40f3d5571b0537d780
dc.identifier.urihttp://hdl.handle.net/20.500.12481/12081
dc.description.abstractSentiment analysis is a critical task of extracting subjective information from online text documents. Ensemble learning can be employed to obtain more robust classification schemes. However, most approaches in the field incorporated feature engineering to build efficient sentiment classifiers. The purpose of our research is to establish an effective sentiment classification scheme by pursuing the paradigm of ensemble pruning. Ensemble pruning is a crucial method to build classifier ensembles with high predictive accuracy and efficiency. Previous studies employed exponential search, randomized search, sequential search, ranking based pruning and clustering based pruning. However, there are tradeoffs in selecting the ensemble pruning methods. In this regard, hybrid ensemble pruning schemes can be more promising. In this study, we propose a hybrid ensemble pruning scheme based on clustering and randomized search for text sentiment classification. Furthermore, a consensus clustering scheme is presented to deal with the instability of clustering results. The classifiers of the ensemble are initially clustered into groups according to their predictive characteristics. Then, two classifiers from each cluster are selected as candidate classifiers based on their pairwise diversity. The search space of candidate classifiers is explored by the elitist Pareto-based multi-objective evolutionary algorithm. For the evaluation task, the proposed scheme is tested on twelve balanced and unbalanced benchmark text classification tasks. In addition, the proposed approach is experimentally compared with three ensemble methods (AdaBoost, Bagging and Random Subspace) and three ensemble pruning algorithms (ensemble selection from libraries of models, Bagging ensemble selection and LibD3C algorithm). Results demonstrate that the consensus clustering and the elitist pareto-based multi-objective evolutionary algorithm can be effectively used in ensemble pruning. The experimental analysis with conventional ensemble methods and pruning algorithms indicates the validity and effectiveness of the proposed scheme. © 2017 Elsevier Ltd
dc.language.isoEnglish
dc.publisherElsevier Ltd
dc.titleA hybrid ensemble pruning approach based on consensus clustering and multi-objective evolutionary algorithm for sentiment classification
dc.typeArticle
dc.contributor.departmentCelal Bayar University, Department of Computer Engineering, Muradiye, Manisa 45140, Turkey; Ege University, Department of Computer Engineering, Bornova, Izmir 35100, Turkey
dc.identifier.DOI-ID10.1016/j.ipm.2017.02.008
dc.identifier.volume53
dc.identifier.pages814-833


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Scopus [2994]
    Scopus İndeksli Yayınlar Koleksiyonu

Show simple item record