Unsupervised selection of informative genes in microarray gene expression data Online publication date: Mon, 13-Feb-2017
by Samaneh Liaghat; Eghbal G. Mansoori
International Journal of Applied Pattern Recognition (IJAPR), Vol. 3, No. 4, 2016
Abstract: With respect to DNA microarray has produced massive amounts of gene expression data with high dimension in recent years, gene selection is one of the bottlenecks of gene expression datasets analysis. This paper presents a framework for unsupervised gene selection based on dependency maximisation between the samples similarity matrices of before and after deleting a gene, using a novel estimation of the Hilbert-Schmidt independence criterion (HSIC). The key idea is that elimination of genes which are redundant and/or have much relevancy with other genes does not have much effect on pairwise samples similarity. Also, to deal with diagonally dominant matrices, the dynamic range of matrix values is reduced. Additionally, gap statistic and k-means clustering methods are used to increase the speed of proposed methods. Experimental validation is conducted on several microarray gene expression datasets and the results show that our gene selection scheme works well in practice.
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 Applied Pattern Recognition (IJAPR):
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
Our Blog 
Follow us on Twitter 
Visit us on Facebook