{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T00:28:41Z","timestamp":1777854521174,"version":"3.51.4"},"reference-count":50,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Information Science"],"published-print":{"date-parts":[[2017,2]]},"abstract":"<jats:p>Sentiment analysis is an important research direction of natural language processing, text mining and web mining which aims to extract subjective information in source materials. The main challenge encountered in machine learning method-based sentiment classification is the abundant amount of data available. This amount makes it difficult to train the learning algorithms in a feasible time and degrades the classification accuracy of the built model. Hence, feature selection becomes an essential task in developing robust and efficient classification models whilst reducing the training time. In text mining applications, individual filter-based feature selection methods have been widely utilized owing to their simplicity and relatively high performance. This paper presents an ensemble approach for feature selection, which aggregates the several individual feature lists obtained by the different feature selection methods so that a more robust and efficient feature subset can be obtained. In order to aggregate the individual feature lists, a genetic algorithm has been utilized. Experimental evaluations indicated that the proposed aggregation model is an efficient method and it outperforms individual filter-based feature selection methods on sentiment classification.<\/jats:p>","DOI":"10.1177\/0165551515613226","type":"journal-article","created":{"date-parts":[[2015,11,5]],"date-time":"2015-11-05T21:48:22Z","timestamp":1446760102000},"page":"25-38","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":348,"title":["A feature selection model based on genetic rank aggregation for text sentiment classification"],"prefix":"10.1177","volume":"43","author":[{"given":"Aytu\u011f","family":"Onan","sequence":"first","affiliation":[{"name":"Celal Bayar University, Turkey"},{"name":"Ege University, Turkey"}]},{"given":"Serdar","family":"Koruko\u011flu","sequence":"additional","affiliation":[{"name":"Ege University, Turkey"}]}],"member":"179","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"key":"e_1_3_2_2_2","unstructured":"Wikipedia. Sentiment Analysis http:\/\/en.wikipedia.org\/wiki\/Sentiment_analysis (accessed 23 July 2015)."},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-02145-9"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.asej.2014.04.011"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3223-4_4"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2007.05.028"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.06.054"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.01.077"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.010"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2012.05.023"},{"key":"e_1_3_2_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2012.06.005"},{"key":"e_1_3_2_12_2","first-page":"1296","article-title":"Hybrid feature selection for text classification","volume":"20","author":"Gunal S","year":"2012","unstructured":"Gunal S. Hybrid feature selection for text classification. Turkish Journal of Electrical Engineering and Computer Science 2012; 20(S2): 1296\u20131311.","journal-title":"Turkish Journal of Electrical Engineering and Computer Science"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.1177\/0165551513480308"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.1177\/0165551514550143"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2015.01.031"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30116-5_26"},{"key":"e_1_3_2_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2012.6252467"},{"key":"e_1_3_2_18_2","first-page":"420","volume-title":"Proceedings of the twenty-sixth international FLAIRS conference","author":"Dittman DJ","year":"2012","unstructured":"Dittman DJ, Khoshgoftaar TM, Wald R, Napolitano A. Classification performance of rank aggregation techniques for ensemble gene selection. In: Proceedings of the twenty-sixth international FLAIRS conference, 2012, pp. 420\u2013425."},{"key":"e_1_3_2_19_2","first-page":"74","volume-title":"Proceedings of the international conference on knowledge discovery and information retrieval and the international conference on knowledge management and information sharing","author":"Bouaguel W","year":"2013","unstructured":"Bouaguel W, Brahim AB, Limam M. Feature selection by rank aggregation and genetic algorithms. In: Proceedings of the international conference on knowledge discovery and information retrieval and the international conference on knowledge management and information sharing, 2013, pp. 74\u201381."},{"key":"e_1_3_2_20_2","first-page":"350","volume-title":"Proceedings of the twenty-sixth international FLAIRS conference","author":"Wald R","year":"2012","unstructured":"Wald R, Khoshgoftaar TM, Wald R. Ensemble gene selection versus single gene selection: Which is better? In:Proceedings of the twenty-sixth international FLAIRS conference, 2012, pp. 350\u2013355."},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03844-5_2"},{"key":"e_1_3_2_22_2","doi-asserted-by":"publisher","DOI":"10.1080\/08839514.2014.883903"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.3233\/IDA-1997-1302"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.11.024"},{"key":"e_1_3_2_25_2","unstructured":"Diao R. Feature selection with harmony search and its applications. PhD Thesis Aberystwyth University 2014."},{"key":"e_1_3_2_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1245283"},{"key":"e_1_3_2_27_2","first-page":"412","volume-title":"Proceedings of the fourteenth international conference on machine learning","author":"Yang Y","year":"1997","unstructured":"Yang Y, Pedersen JO. A comparative study on feature selection in text categorization. In: Proceedings of the fourteenth international conference on machine learning, 1997, pp. 412\u2013420."},{"key":"e_1_3_2_28_2","first-page":"235","volume-title":"Proceedings of the twelfth international florida artificial intelligence research society conference","author":"Hall MA","year":"1999","unstructured":"Hall MA, Smith LA. Feature selection for machine learning: Comparing a correlation-based filter approach to the wrapper. In: Proceedings of the twelfth international florida artificial intelligence research society conference, 1999, pp. 235\u2013239."},{"key":"e_1_3_2_29_2","first-page":"1157","article-title":"An introduction to variable and feature selection","volume":"3","author":"Guyon I","year":"2003","unstructured":"Guyon I, Elisseeff A. An introduction to variable and feature selection. Journal of Machine Learning Research 2003; 3: 1157\u20131182.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-247-2.50037-1"},{"key":"e_1_3_2_31_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1025667309714"},{"key":"e_1_3_2_32_2","first-page":"171","volume-title":"Proceedings of European conference on machine learning","author":"Konenenko I","year":"1994","unstructured":"Konenenko I. Estimating attriutes: Analysis and extension of Relief. In: Proceedings of European conference on machine learning. Berlin: Springer, 1994, pp. 171\u2013182."},{"key":"e_1_3_2_33_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2004.08.015"},{"key":"e_1_3_2_34_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-34747-9_18"},{"key":"e_1_3_2_35_2","first-page":"1","volume-title":"Proceedings of the 8th international conference on signal processing","author":"Zhan W","unstructured":"Zhan W, Yifan H. A Comparison among three neural networks for text classification. In: Proceedings of the 8th international conference on signal processing, Beijing, 16\u201320 November 2006, pp. 1\u20134. New York: IEEE."},{"key":"e_1_3_2_36_2","unstructured":"Colas FPR. Data mining scenarios for the discovery of subtypes and the comparison of algorithms. PhD Thesis Leiden University 2009."},{"key":"e_1_3_2_37_2","first-page":"800","volume-title":"Data mining: Concepts and techniques","author":"Han J","year":"2006","unstructured":"Han J, Kamber M. Data mining: Concepts and techniques, 2nd edn.San Francisco, CA: Morgan Kaufmann, March2006, p. 800.","edition":"2"},{"key":"e_1_3_2_38_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00153759"},{"key":"e_1_3_2_39_2","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"e_1_3_2_40_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btm158"},{"key":"e_1_3_2_41_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2013.07.081"},{"key":"e_1_3_2_42_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1006529012972"},{"key":"e_1_3_2_43_2","first-page":"332","volume-title":"Handbook of genetic algorithms","author":"Syswerda G","year":"1991","unstructured":"Syswerda G. Schedule optimization using genetic algorithms. In: Davis L (ed.) Handbook of genetic algorithms. New York: Van Nostrand Reinhold, 1991, pp. 332\u2013349."},{"key":"e_1_3_2_44_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF00202901"},{"key":"e_1_3_2_45_2","doi-asserted-by":"publisher","DOI":"10.1109\/CSIE.2009.754"},{"key":"e_1_3_2_46_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2013.08.002"},{"key":"e_1_3_2_47_2","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2015.7129796"},{"key":"e_1_3_2_48_2","doi-asserted-by":"publisher","DOI":"10.1561\/1500000011"},{"key":"e_1_3_2_49_2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0028210"},{"key":"e_1_3_2_50_2","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr709"},{"key":"e_1_3_2_51_2","first-page":"1","volume-title":"Proceedings of the Argentine symposium on artificial intelligence","author":"Batista GEAPA","year":"2009","unstructured":"Batista GEAPA, Silva DF. How k-nearest neighbor parameters affect its performance. In: Proceedings of the Argentine symposium on artificial intelligence. 2009, pp. 1\u201312."}],"container-title":["Journal of Information Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551515613226","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/0165551515613226","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/0165551515613226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T23:09:22Z","timestamp":1777504162000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/0165551515613226"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":50,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["10.1177\/0165551515613226"],"URL":"https:\/\/doi.org\/10.1177\/0165551515613226","relation":{},"ISSN":["0165-5515","1741-6485"],"issn-type":[{"value":"0165-5515","type":"print"},{"value":"1741-6485","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7,11]]}}}