vioft2nntf2t|tblJournal|Abstract_paper|0xf4ffb2332c000000bc370b0001000200 The current study employs biclustering to alleviate some of the drawbacks associated with gene expression data grouping. Different biclustering algorithms are used in this study to detect unique gene activity in various contexts and reduce the duplication of broad gene information. Furthermore, machine learning or heuristic algorithms have become widely utilised for biclustering due to their suitability in problems where populations of potential solutions allow examination of a larger percentage of the research area. To begin with, gene expression data biclusters frequently contain data that is the same under a variety of different situations of gene expression. Therefore, the biclustering technique is particularly effective if the matrix lines and columns are merged immediately. Submatrices can be identified using the Large Average Sub matrix. A Fuzzy C-Means algorithm is also used to ensure that the sub-matrix can be expanded to include more rows and columns for further analysis. The sub-matrices and component precision and strength are factored into the system design. It uses biclustering techniques to differentiate gene expression information. On the Garber dataset, the simulation is run in Java. Using the average match score for non-overlapping modules, the influence of noise on overlapping modules using constant bicluster and additive bicluster, and the overall run duration, the study is assessed.
M Ramkumar1,J Gowrishankar2, V Amirtha Preeya3, T Pushpa4, T Karthikeyan5
HKBK College of Engineering, India1, Jain University, India 2, Presidency University, India3, HKBK College of Engineering, India4, University of Technology and Applied Sciences, Oman5
Heuristic Algorithm, Gene Expression, Data Biclusters, Fuzzy C-Means
| January | February | March | April | May | June | July | August | September | October | November | December |
| 0 | 0 | 0 | 0 | 0 | 0 | 0 | 0 | 2 | 0 | 0 | 0 |
| Published By :
ICTACT
Published In :
ICTACT Journal on Soft Computing
( Volume: 12 , Issue: 2 , Pages: 2578-2582 )
Date of Publication :
January 2022
Page Views :
632
Full Text Views :
3
|