{"title":"Improved Biclustering Algorithm Based on Weighted Mean Square Residual","authors":"Wenhua Liu, Yaxin Hou, Yidong Li, Hongwei Zhao","doi":"10.1109/BESC48373.2019.8963098","DOIUrl":null,"url":null,"abstract":"Microarrays are one of the latest breakthroughs in experimental molecular biology, which have already provided huge amount of high dimensional genetic data. Existing biclustering algorithms can hardly discover biclusters with overlapping structures. Consequently, the correct bicluster structures hidden in gene expression data cannot be effectively found. Moreover, the influence of the importance of the different conditions on the bicustering result is not taken into account in the process of adding and deleting conditions. An improved biclustering algorithm based on weighted mean square residual (IBWMSR) is proposed to overcome the above defects. Our algorithm also proposes a new objective function to update weights of each bicluster, which can simultaneously select the conditions set of each bicluster using some rules. The gene sets are firstly partitioned into initial biclusters by using fuzzy partition and the fuzzy partition is controlled by overlapping ratio and the membership of the genes. Then, the weights of the conditions in each bicluster are iteratively updated in the process of minimizing the objective function. Finally, the bicluster set is obtained after adding the genes satisfying the constraints and removing the genes producing inconsistency fluctuation. The experiment shows that the proposed algorithm generates the biclusters with similar expression level of different sizes and restricts the overlapping ratio to a reasonable range and generate larger biclusters with lower mean square residues.","PeriodicalId":190867,"journal":{"name":"2019 6th International Conference on Behavioral, Economic and Socio-Cultural Computing (BESC)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 6th International Conference on Behavioral, Economic and Socio-Cultural Computing (BESC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BESC48373.2019.8963098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Microarrays are one of the latest breakthroughs in experimental molecular biology, which have already provided huge amount of high dimensional genetic data. Existing biclustering algorithms can hardly discover biclusters with overlapping structures. Consequently, the correct bicluster structures hidden in gene expression data cannot be effectively found. Moreover, the influence of the importance of the different conditions on the bicustering result is not taken into account in the process of adding and deleting conditions. An improved biclustering algorithm based on weighted mean square residual (IBWMSR) is proposed to overcome the above defects. Our algorithm also proposes a new objective function to update weights of each bicluster, which can simultaneously select the conditions set of each bicluster using some rules. The gene sets are firstly partitioned into initial biclusters by using fuzzy partition and the fuzzy partition is controlled by overlapping ratio and the membership of the genes. Then, the weights of the conditions in each bicluster are iteratively updated in the process of minimizing the objective function. Finally, the bicluster set is obtained after adding the genes satisfying the constraints and removing the genes producing inconsistency fluctuation. The experiment shows that the proposed algorithm generates the biclusters with similar expression level of different sizes and restricts the overlapping ratio to a reasonable range and generate larger biclusters with lower mean square residues.