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

被引:0
|
作者
Wu, FX [1 ]
Zhang, WJ [1 ]
Kusalik, AJ [1 ]
机构
[1] Univ Saskatchewan, Div Biomed Engn, Saskatoon, SK S7N 5A9, Canada
关键词
D O I
暂无
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
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.
引用
收藏
页码:401 / 406
页数:6
相关论文
共 50 条
  • [41] Customer Segmentation using K-means Clustering
    Kansal, Tushar
    Bahuguna, Suraj
    Singh, Vishal
    Choudhury, Tanupriya
    PROCEEDINGS OF THE 2018 INTERNATIONAL CONFERENCE ON COMPUTATIONAL TECHNIQUES, ELECTRONICS AND MECHANICAL SYSTEMS (CTEMS), 2018, : 135 - 139
  • [42] Motif discovery using K-means clustering
    Sayed, Mohammed
    Park, Juw Won
    BMC BIOINFORMATICS, 2016, 17
  • [43] K-means clustering algorithm using the entropy
    Palubinskas, G
    IMAGE AND SIGNAL PROCESSING FOR REMOTE SENSING IV, 1998, 3500 : 63 - 71
  • [44] Crime Analysis using k-means Clustering
    Joshi, Anant
    Sabitha, A. Sai
    Choudhury, Tanupriya
    2017 3RD INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND NETWORKS (CINE), 2017, : 33 - 39
  • [45] Offenders Clustering Using FCM & K-Means
    Farzai, Sara
    Ghasemi, Davood
    Marzuni, Seyed Saeed Mirpour
    JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE-JMCS, 2015, 15 (04): : 294 - 301
  • [46] K-means clustering using entropy minimization
    Okafor, A
    Pardalos, PM
    THEORY AND ALGORITHMS FOR COOPERATIVE SYSTEMS, 2004, 4 : 339 - 351
  • [47] Sample size for detecting differentially expressed genes in microarray experiments
    Caimiao Wei
    Jiangning Li
    Roger E Bumgarner
    BMC Genomics, 5
  • [48] Sample size for identifying differentially expressed genes in microarray experiments
    Wang, SJ
    Chen, JJ
    JOURNAL OF COMPUTATIONAL BIOLOGY, 2004, 11 (04) : 714 - 726
  • [49] Sample size for detecting differentially expressed genes in microarray experiments
    Wei, CM
    Li, JN
    Bumgarner, RE
    BMC GENOMICS, 2004, 5 (1)
  • [50] Selecting informative genes from microarray data for cancer classification with genetic programming classifier using K-Means clustering and SNR ranking
    Hengpraprohm, Supoj
    Chongstitvatana, Prabhas
    PROCEEDINGS OF THE FRONTIERS IN THE CONVERGENCE OF BIOSCIENCE AND INFORMATION TECHNOLOGIES, 2007, : 211 - 216