Abstract
Due to technical problems in DNA microarray experiments, a large number of entries are found missing in microarray datasets. As a consequence, the effectiveness of the analysis algorithms deteriorates. Among different imputation techniques, the weighted average based methods always generate consistent results, are algorithmically simple and very popular but they also suffer from some drawbacks. These deficiencies have been pointed out in this work, and a new framework has been suggested to overcome those. The proposed framework is embedded in the K-nearest neighbour imputation method (KNNimpute), as well as its different versions. It is based on a hybrid distance and gene transformation procedure which utilises simultaneously the advantages of Euclidean distance, mean squared residue score, and Pearson correlation coefficient to select the best possible neighbours, using pattern-based similarity. The framework is tested on well-known microarray datasets. From the experimental results, the superiority of the proposed work has been found.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Bioinformatics Research and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.