A novel clustering approach based on the manifold structure of gene expression data

被引:0
作者
Shi, Jinlong [1 ]
Luo, Zhigang [1 ]
机构
[1] Natl Univ Def Technol, Sch Comp, Changsha 410073, Hunan, Peoples R China
来源
2010 4TH INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICAL ENGINEERING (ICBBE 2010) | 2010年
关键词
gene expression; geodesic distance; clustering; geometric representation;
D O I
暂无
中图分类号
R318 [生物医学工程];
学科分类号
0831 ;
摘要
Clustering is an effective approach for computing analysis of gene expression data. Various of clustering algorithms have been developed to give reasonable interpretations of biological data and discover biological meaningful patterns of cellular functions. Based on the manifold structure of gene expression data analyzed under the framework of geometric representation, a novel clustering approach is presented to reveal the nonlinear expression patterns. The novel clustering approach can be divided into the following computing steps. The first step is to construct a neighborhood graph for gene expression points through which the approximate geodesic distances between each two points can be obtained. Then, instead of Euclidean distance, approximate geodesic distance is exploited to reveal the similarity between gene profiles. Finally, via defining the geodesic distance between a cluster and a gene expression point, new clusters can be generated after essential iterative processes. Application of the approach to the yeast cell-cycle dataset validates its rationality and efficiency.
引用
收藏
页数:4
相关论文
共 50 条
[31]   Multi-objective genetic algorithm based clustering approach and its application to gene expression data [J].
Özyer, T ;
Liu, YM ;
Alhajj, R ;
Barker, K .
ADVANCES IN INFORMATION SYSTEMS, PROCEEDINGS, 2004, 3261 :451-461
[32]   A Novel Rough Set Based Clustering Approach for Streaming Data [J].
Yogita ;
Toshniwal, Durga .
PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON SOFT COMPUTING FOR PROBLEM SOLVING (SOCPROS 2012), 2014, 236 :1253-1265
[33]   Cancer classification using a novel gene selection approach by means of shuffling based on data clustering with optimization [J].
Elyasigomari, V. ;
Mirjafari, M. S. ;
Screen, H. R. C. ;
Shaheed, M. H. .
APPLIED SOFT COMPUTING, 2015, 35 :43-51
[34]   Efficiently mining gene expression data via a novel parameterless clustering method [J].
Tseng, VS ;
Kao, CP .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2005, 2 (04) :355-365
[35]   Clustering Temporal Gene Expression Data with Unequal Time Intervals [J].
Rueda, Luis ;
Bari, Ataul .
2007 2ND BIO-INSPIRED MODELS OF NETWORKS, INFORMATION AND COMPUTING SYSTEMS (BIONETICS), 2007, :183-+
[36]   Context-specific Bayesian clustering for gene expression data [J].
Barash, Y ;
Friedman, N .
JOURNAL OF COMPUTATIONAL BIOLOGY, 2002, 9 (02) :169-191
[37]   Gene expression data clustering based on graph regularized subspace segmentation [J].
Chen, Xiaoyun ;
Jian, Cairen .
NEUROCOMPUTING, 2014, 143 :44-50
[38]   Clustering of gene expression data based on self-growth tree [J].
Zhang, SW ;
Lin, L ;
Guan, Y ;
Wang, XL .
PROCEEDINGS OF 2005 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-9, 2005, :3377-3381
[39]   Clustering gene expression data with a penalized graph-based metric [J].
Ariel E Bayá ;
Pablo M Granitto .
BMC Bioinformatics, 12
[40]   Evaluation of clustering algorithms for gene expression data using gene ontology annotations [J].
Ma Ning ;
Zhang Zheng-guo .
CHINESE MEDICAL JOURNAL, 2012, 125 (17) :3048-3052