Optimized Swarm Search-Based Feature Selection for Text Mining in Sentiment Analysis
Authors:
- Simon FongSFSimon Fong
- Elisa GaoEGElisa Gao
- Raymond WongRWRaymond Wong
- 1 November 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1153-1162
Abstract
Sentiment analysis emerged as an important computational domain to gain insights from snippets of texts, as social media recently gained popularity. Text mining has long been a fundamental data analytic for sentiment analysis. One of the popular preprocessing approaches in text mining is transforming text strings to word vectors which form a high-dimensional sparse matrix. This sparse matrix poses challenges to induction of an accurate sentiment classification model. Feature selection is usually applied for finding a subset of features from all the original features from the sparse matrix, in order to enhance the accuracy of the classification model. In this paper, a new feature selection method called Optimized Swarm Search-based Feature Selection (OS-FS) is proposed. OS-FS is a swarm-type of searching function that selects an ideal subset of features for enhanced classification accuracy. The swarm search in OS-FS is optimized by a new feature evaluation technique called Clustering-by-Coefficient-of-Variation (CCV). The proposed scheme is verified via a mood classification scenario where 100 sample news are extracted from CNN.com. One of six human emotions (or sentiments) would have to be recognized from the news contents, by computer using text mining. The results show superiority of OS-FS over the traditional feature selection methods.Keywords
This publication has 15 references indexed in Scilit:
- Search based algorithms for test sequence generation in functional testingInformation and Software Technology, 2015
- Big Data in Complex Systems2015
- Feature Selection in Life Science Classification: Metaheuristic Swarm SearchIT Professional, 2014
- High Dimensional Big Data and Pattern Analysis: A TutorialLecture Notes in Computer Science, 2013
- Comparative study of classification algorithms for immunosignaturing dataBMC Bioinformatics, 2012
- A Fast Clustering-Based Feature Subset Selection Algorithm for High-Dimensional DataIEEE Transactions on Knowledge and Data Engineering, 2011
- Different metaheuristic strategies to solve the feature selection problemPattern Recognition Letters, 2009
- Time and sample efficient discovery of Markov blankets and direct causal relations2003
- Improving the Search Algorithm for the Best Linear Expression1995
- Neural Networks and the Bias/Variance DilemmaNeural Computation, 1992