Gene expression classification using binary rule majority voting genetic programming classifier Online publication date: Sat, 23-Aug-2014
by Christopher Gillies; Nilesh Patel; Jan Akervall; George Wilson
International Journal of Advanced Intelligence Paradigms (IJAIP), Vol. 4, No. 3/4, 2012
Abstract: The results of a gene expression study are difficult to interpret. To increase interpretability, researchers have developed classification techniques that produce rules to classify gene expression profiles. Genetic programming is one method to produce classification rules. These rules are difficult to interpret because they are based on complicated functions of gene expression values. We propose the binary rule majority voting genetic programming classifier (BRMVGPC) that classifies samples using binary rules based on the detection calls for genes instead of the gene expression values. BRMVGPC increases rule interpretability. We evaluate BRMVGPC on two public datasets, one brain and one prostate cancer, and achieved 88.89% and 86.39% accuracy respectively. These results are comparable to other classifiers in the gene expression profile domain. Specific contributions include a classification technique BRMVGPC and an iterative k-nearest neighbour technique for handling marginal detection call values.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Advanced Intelligence Paradigms (IJAIP):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com