Determination of the minimum sample size in microarray experiments to cluster genes using k-means clustering

Fang-Xiang Wu, W. Zhang, A. Kusalik
{"title":"Determination of the minimum sample size in microarray experiments to cluster genes using k-means clustering","authors":"Fang-Xiang Wu, W. Zhang, A. Kusalik","doi":"10.1109/BIBE.2003.1188979","DOIUrl":null,"url":null,"abstract":"Gene expression profiles obtained from time-series microarray experiments can reveal important information about biological processes. However, conducting such experiments is costly and time consuming. The cost and time required are linearly proportional to sample size. Therefore, it is worthwhile to provide a way to determine the minimal number of samples or trials required in a microarray experiment. One of the uses of microarray hybridization experiments is to group together genes with similar patterns of the expression using clustering techniques. In this paper, the k-means clustering technique is used. The basic idea of our approach is an incremental process in which testing, analysis and evaluation are integrated and iterated. The process is terminated when the evaluation of the results of two consecutive experiments shows they are sufficiently close. Two measures of \"closeness\" are proposed and two real microarray datasets are used to validate our approach. The results show that the sample size required to cluster genes in these two datasets can be reduced; i.e. the same results can be achieved with less cost. The approach can be used with other clustering techniques as well.","PeriodicalId":178814,"journal":{"name":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third IEEE Symposium on Bioinformatics and Bioengineering, 2003. Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BIBE.2003.1188979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Gene expression profiles obtained from time-series microarray experiments can reveal important information about biological processes. However, conducting such experiments is costly and time consuming. The cost and time required are linearly proportional to sample size. Therefore, it is worthwhile to provide a way to determine the minimal number of samples or trials required in a microarray experiment. One of the uses of microarray hybridization experiments is to group together genes with similar patterns of the expression using clustering techniques. In this paper, the k-means clustering technique is used. The basic idea of our approach is an incremental process in which testing, analysis and evaluation are integrated and iterated. The process is terminated when the evaluation of the results of two consecutive experiments shows they are sufficiently close. Two measures of "closeness" are proposed and two real microarray datasets are used to validate our approach. The results show that the sample size required to cluster genes in these two datasets can be reduced; i.e. the same results can be achieved with less cost. The approach can be used with other clustering techniques as well.
利用k-均值聚类技术进行基因聚类的微阵列实验中最小样本量的确定
从时间序列微阵列实验中获得的基因表达谱可以揭示生物过程的重要信息。然而,进行这样的实验既昂贵又耗时。所需的成本和时间与样本量成线性比例。因此,提供一种方法来确定微阵列实验中所需的最小样品或试验数量是值得的。微阵列杂交实验的用途之一是使用聚类技术将具有相似表达模式的基因分组在一起。本文采用k-means聚类技术。我们方法的基本思想是一个增量过程,在这个过程中,测试、分析和评估是集成和迭代的。当对两个连续实验结果的评价表明它们足够接近时,该过程终止。提出了两种“接近度”的度量,并使用了两个真实的微阵列数据集来验证我们的方法。结果表明,在这两个数据集中进行基因聚类所需的样本量可以减少;也就是说,可以用更少的成本获得同样的结果。这种方法也可以与其他聚类技术一起使用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信