Automatic Generation of Merge Factor for Clustering Microarray Data

被引:0
作者
Pavan, K. Karteeka [1 ]
Rao, Allam Appa [2 ]
Rao, A. V. Dattatreya [3 ]
Sridhar, G. R. [4 ]
机构
[1] RVR & JC Coll Engn, Guntur, Andhra Pradesh, India
[2] Jawaharlal Nehru Technol Univ, Kakinada, Andhra Pradesh, India
[3] Acharya Nagarjuna Univ, Guntur, Andhra Pradesh, India
[4] Endocrine & Diabet Ctr, Visakhapatnam, Andhra Pradesh, India
来源
INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND NETWORK SECURITY | 2008年 / 8卷 / 09期
关键词
Bioinformatics; Microarray gene expression data; coexpressed genes; clustering; K-means; ISODATA; AGMFI;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Microarrays are made it possible to simultaneously monitor the expression profiles of thousands of genes under various experimental conditions. Identification of coexpressed genes and coherent patterns is the central goal in microarray or gene expression data analysis and is an important task in bioinformatics research. Cluster analysis of gene expression data has proved to be a useful tool for identifying coexpressed genes, biologically relevant groupings of genes and samples. In this paper we propose an algorithm -Automatic Generation of Merge Factor for Isodata - AGMFI, to cluster microarray data on the basis of ISODATA. The main idea of AGMFI is to generate initial values for merge factor, maximum merge times instead of selecting heuristic values as in ISODATA. One significant feature of AGMFI over K-means is that the initial number of clusters may be merged or split, and so the final number of clusters may be different from the number of clusters specified as part of the input. We evaluate it's performance by applying on a well-known publicly available microarray data sets and on simulated data set [3]. We compared the results with those of K-means clustering. The experiments indicate that the proposed algorithm AGMFI increased the enrichment of genes of similar function within the cluster.
引用
收藏
页码:127 / 131
页数:5
相关论文
共 50 条
  • [21] Clustering of Microarray data via Clique Partitioning
    Gary Kochenberger
    Fred Glover
    Bahram Alidaee
    Haibo Wang
    Journal of Combinatorial Optimization, 2005, 10 : 77 - 92
  • [22] A semi-supervised approach to projected clustering with applications to microarray data
    Yip, Kevin Y.
    Cheung, Lin
    Cheung, David W.
    Jing, Liping
    Ng, Michael K.
    INTERNATIONAL JOURNAL OF DATA MINING AND BIOINFORMATICS, 2009, 3 (03) : 229 - 259
  • [23] Analyzing Microarray Data with Classification and Clustering Methods
    Wan, Shaohua
    2015 THIRD INTERNATIONAL CONFERENCE ON ADVANCED CLOUD AND BIG DATA, 2015, : 175 - 179
  • [24] Automatic aspect discrimination in data clustering
    Horta, Danilo
    Campello, Ricardo J. G. B.
    PATTERN RECOGNITION, 2012, 45 (12) : 4370 - 4388
  • [25] A Granular Self-Organizing Map for Clustering and Gene Selection in Microarray Data
    Ray, Shubhra Sankar
    Ganivada, Avatharam
    Pal, Sankar K.
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2016, 27 (09) : 1890 - 1906
  • [26] On the Role of Clustering and Visualization Techniques in Gene Microarray Data
    Ciaramella, Angelo
    Staiano, Antonino
    ALGORITHMS, 2019, 12 (06):
  • [27] Clustering of Association Rules on Microarray Gene Expression Data
    Alagukumar, S.
    Vanitha, C. Devi Arockia
    Lawrance, R.
    ADVANCED COMPUTING AND INTELLIGENT ENGINEERING, 2020, 1082 : 85 - 97
  • [28] Non-Negative Factorization for Clustering of Microarray Data
    Morgos, L.
    INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2014, 9 (01) : 16 - 23
  • [29] Combinatorial and machine learning approaches in clustering microarray data
    Pozzi, Sergio
    Zoppis, Italo
    Mauri, Giancarlo
    BIOLOGICAL AND ARTIFICIAL INTELLIGENCE ENVIRONMENTS, 2005, : 63 - 71
  • [30] Distance based feature selection for clustering microarray data
    Dash, Manoranjan
    Gopalkrishnan, Vivekanand
    DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, 2008, 4947 : 512 - 519