Biclustering on gene expression data

• Published in: 2017 International Conference on Algorithms, Methodology, Models and Applications in Emerging Technologies (ICAMMAET) pp. 1 - 4
• Main Author: Shruthi, M P
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.02.2017
• Subjects: Algorithm design and analysis; Bioinformatics; Clustering algorithms; Feature extraction; Gene expression; Partitioning algorithms; Software algorithms
• DOI: 10.1109/ICAMMAET.2017.8186750

Microarray technology is a tool which is essential to observe and monitor the genes in an living organism. Biclustering is a strategy to distinguish qualities that are co-directed under a subset of conditions, however are not really co-controlled crosswise over different conditions. The dataset is in the form of matrix, row matrix represents a set of genes and column matrix represents a set of conditions. Each row in a matrix corresponds to set of genes and each column represents a set of conditions. The goal of this project is to identify groups of genes sharing a common subset of regulatory units. A method is needed to select clusters of genes and conditions simultaneously, finding distinctive clusters with less number of rules generated. Feature selection might be assessed from both the proficiency and adequacy perspectives. While the productivity concerns the time needed to discover a set of components is that the adequacy is identified with the nature of the subset of elements. Hence fast clustering is used to cluster the data into two categories (relevant data, irrelevant data). K-means algorithm is employed to bicluster the data in order to divide the input data into four classes. From the calculation of the maximum and minimum specificity of each class, better accuracy is outperformed.