Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/4485

Title: Predicting incomplete gene microarray data with the use of supervised learning algorithms
Authors: Twala, B
Phorah, M
Keywords: Supervised learning
Microarray data
Incomplete data
Issue Date: Oct-2010
Publisher: Elsevier
Citation: Twala, B and Phorah, M. 2010. Predicting incomplete gene microarray data with the use of supervised learning algorithms. Pattern Recognition Letters, Vol. 31(13), pp 2061–2069
Series/Report no.: Journal Article
Abstract: With the wealth of sequence data and the huge amount of data generated from molecular technologies, the issue of gene classification/prediction has become a central challenge in the field of microarray data analysis. This has led to the application of many well-established supervised learning (SL) algorithms in an attempt to provide more accurate and automatic diagnosis class (cancer/non cancer) prediction. Virtually all research on SL addresses the task of learning to classify complete domain instances. However, in some research situations we often have to classify instances given incomplete vectors, which can affect the predictive accuracy of learned classifiers. The task of learning an accurate incomplete data classifier from instances raises a number of new issues some of which have not been properly addressed by bioinformatics research. Thus, an effective missing value estimation method is required for improving predictive accuracy. Results: The essence of the approach is the proposal that prediction using supervised learning can be improved in probabilistic terms given incomplete microarray data. This imputation approach is based on the a priori probability of each value determined from the instances at that node of a decision tree (PDT) that have specified values. The proposed approach exploits the total probability and Bayes’ theorems and it has three versions. We evaluate our approach with other supervised learning techniques including C5.0, classification and regression trees (CART), k-nearest neighbour (k-NN), linear discrimination (LD) naïve Bayes classifier (NBC), Repeated Incremental Pruning to Produce Error Reduction (RIPPER) and support vector machines (SVMs), from the point of view of their effect or tolerance of incomplete test data. Eight cancer related gene expression datasets are utilized for this task. Experimental results are provided to illustrate the efficiency and the robustness of the proposed algorithm.
Description: Copyright: 2010 Elsevier. This is the post print version of the work. The definitive version is published in Pattern Recognition Letters, Vol. 31(13), pp 2061–2069
URI: http://www.sciencedirect.com/science?_ob=MImg&_imagekey=B6V15-502977W-1-1P&_cdi=5665&_user=958262&_pii=S0167865510001467&_origin=search&_coverDate=10/01/2010&_sk=999689986&view=c&wchp=dGLbVzb-zSkWA&md5=9de5840e663d3d130591d3c4244e42b9&ie=/sdarticle.pdf
ISSN: 0167-8655
Appears in Collections:Advanced mathematical modelling and simulation
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Phorah_2010.pdf620.56 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback