Improved Biclustering Algorithm Based on Weighted Mean Square Residual

Wenhua Liu, Yaxin Hou, Yidong Li, Hongwei Zhao
{"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.
基于加权均方残差的改进双聚类算法
微阵列技术是实验分子生物学的最新突破之一,它已经提供了大量的高维遗传数据。现有的双聚类算法很难发现具有重叠结构的双聚类。因此,不能有效地发现隐藏在基因表达数据中的正确的双聚类结构。此外,在添加和删除条件的过程中,没有考虑不同条件的重要性对聚类结果的影响。针对上述缺陷,提出了一种基于加权均方残差(IBWMSR)的改进双聚类算法。该算法还提出了一个新的目标函数来更新每个双聚类的权重,该目标函数可以利用一定的规则同时选择每个双聚类的条件集。首先采用模糊划分方法对基因集进行初始双聚类划分,模糊划分由重叠比和基因隶属度控制。然后,在最小化目标函数的过程中迭代更新每个双聚类中条件的权值。最后,加入满足约束条件的基因,去除产生不一致波动的基因,得到双聚类集。实验表明,该算法生成了不同大小的表达水平相似的双聚类,并将重叠比限制在合理的范围内,生成了均方残数较低的更大的双聚类。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信