Main Article Content
Cancer investigations in microarray data play a major role in cancer analysis and the treatment. Cancer microarray data consists of complex gene expressed patterns of cancer. In this article, a Multi-Objective Binary Particle Swarm Optimization (MOBPSO) algorithm is proposed for analyzing cancer gene expression data. Due to its high dimensionality, a fast heuristic based pre-processing technique is employed to reduce some of the crude domain features from the initial feature set. Since these pre-processed and reduced features are still high dimensional, the proposed MOBPSO algorithm is used for finding further feature subsets. The objective functions are suitably modeled by optimizing two conflicting objectives i.e., cardinality of feature subsets and distinctive capability of those selected subsets. As these two objective functions are conflicting in nature, they are more suitable for multi-objective modeling. The experiments are carried out on benchmark gene expression datasets, i.e., Colon, Lymphoma and Leukaemia available in literature. The performance of the selected feature subsets with their classification accuracy and validated using 10 fold cross validation techniques. A detailed comparative study is also made to show the betterment or competitiveness of the proposed algorithm.
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish in this journal agree to the following terms:
- The authors keep the copyright and grant the journal the right of first publication under the terms of the Creative Commons Attribution license, CC BY 4.0. This licencse permits unrestricted use, distribution and reproduction in any medium, provided that the original work is properly cited.
- The use of general descriptive names, trade names, trademarks, and so forth in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.
- Because the advice and information in this journal are believed to be true and accurate at the time of publication, neither the authors, the editors, nor the publisher accept any legal responsibility for any errors or omissions presented in the publication. The publisher makes no guarantee, express or implied, with respect to the material contained herein.
- The authors can enter into additional contracts for the non-exclusive distribution of the journal's published version by citing the initial publication in this journal (e.g. publishing in an institutional repository or in a book).