Welcome to the InfoSci Platform
Probability Based Most Informative Gene Selection From Microarray Data

Probability Based Most Informative Gene Selection From Microarray Data

Sunanda Das, Asit Kumar Das
Copyright: © 2018 |Volume: 5 |Issue: 1 |Pages: 12
ISSN: 2334-4598|EISSN: 2334-4601|EISBN13: 9781522547013|DOI: 10.4018/IJRSDA.2018010101
Cite Article Cite Article

MLA

Das, Sunanda, and Asit Kumar Das. "Probability Based Most Informative Gene Selection From Microarray Data." IJRSDA vol.5, no.1 2018: pp.1-12. http://doi.org/10.4018/IJRSDA.2018010101

APA

Das, S. & Das, A. K. (2018). Probability Based Most Informative Gene Selection From Microarray Data. International Journal of Rough Sets and Data Analysis (IJRSDA), 5(1), 1-12. http://doi.org/10.4018/IJRSDA.2018010101

Chicago

Das, Sunanda, and Asit Kumar Das. "Probability Based Most Informative Gene Selection From Microarray Data," International Journal of Rough Sets and Data Analysis (IJRSDA) 5, no.1: 1-12. http://doi.org/10.4018/IJRSDA.2018010101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Microarray datasets have a wide application in bioinformatics research. Analysis to measure the expression level of thousands of genes of this kind of high-throughput data can help for finding the cause and subsequent treatment of any disease. There are many techniques in gene analysis to extract biologically relevant information from inconsistent and ambiguous data. In this paper, the concepts of functional dependency and closure of an attribute of database technology are used for finding the most important set of genes for cancer detection. Firstly, the method computes similarity factor between each pair of genes. Based on the similarity factors a set of gene dependency is formed from which closure set is obtained. Subsequently, conditional probability based interestingness measurements are used to determine the most informative gene for disease classification. The proposed method is applied on some publicly available cancerous gene expression dataset. The result shows the effectiveness and robustness of the algorithm.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.