作者: Fang-Xiang Wu , W. J. Zhang , Anthony J. Kusalik
关键词:
摘要: One of the current main strategies to understand a biological process at genome level is cluster genes by their expression data obtained from DNA microarray experiments. The classic K-means clustering algorithm deterministic search and may terminate in locally optimal clustering. In this paper, genetic algorithm, called GKMCA, for gene datasets described. GKMCA hybridization (GA) iterative (IOKMA). each individual encoded partition table which uniquely determines clustering, three operators (selection, crossover, mutation) an IOKM operator derived IOKMA are employed. superiority over other GA-clustering algorithms without demonstrated two real datasets.