Cao, B, Zhao, J, Yang, P, Yang, P, Liu, X, Qi, J, Simpson, A, Elhoseny, M, Mehmood, I and Muhammad, K (2019) Multiobjective Feature Selection of Microarray Data via Distributed Parallel Algorithms. Future Generation Computer Systems, 100. pp. 952-981. ISSN 0167-739X

Preview

Text FGCS_FS_MicArr (1).pdf - Accepted Version Available under License Creative Commons Attribution Non-commercial No Derivatives. Download (3MB) | Preview

Abstract

Many real-world problems are large scale and hence difficult to address. Due to the large number of features in microarray datasets, feature selection and classification are even more challenging. Although there are numerous features, not all features contribute to the classification, and some features are even impeditive. Through feature selection, a feature subset that contains only a small quantity of essential features is generated, which can increase the classification accuracy and significantly reduce the time consumption.
In this paper, we construct a multiobjective feature selection model that simultaneously considers classification error, feature number and feature redundancy. For this model, we propose several distributed parallel algorithms through different encodings and an adaptive strategy. Additionally, to reduce the time consumption, various tactics are employed, including feature number constraint, distributed parallelism and sample-wise parallelism. For a batch of microarray datasets, the proposed algorithms are superior to several state-of-the-art multiobjective evolutionary algorithms in terms of both effectiveness and efficiency.

Item Type:	Article
Uncontrolled Keywords:	0805 Distributed Computing, 0806 Information Systems
Subjects:	Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Divisions:	Computer Science & Mathematics
Publisher:	Elsevier
Date Deposited:	27 Feb 2019 10:16
Last Modified:	04 Sep 2021 09:42
DOI or ID number:	10.1016/j.future.2019.02.030
URI:	https://researchonline.ljmu.ac.uk/id/eprint/10219

View Item