A novel genetic clustering algorithm with variable-length chromosome representation

ISCAS OpenIR

	A novel genetic clustering algorithm with variable-length chromosome representation
	Zhang, Ming-An (1); Deng, Yong (1); Chang, Dong-Xia (2)
	2014
会议名称	16th Genetic and Evolutionary Computation Conference, GECCO 2014
页码	1483-1484
会议日期	July 12, 2014 - July 16, 2014
会议地点	Vancouver, BC, Canada
收录类别	EI
出版地	Association for Computing Machinery
ISBN	9781450328814
部门归属	(1) Institute of Software, Chinese Academy of Sciences, 4# South Fourth Street, Zhongguancun, Beijing 100190, China; (2) Institute of Information Science, Beijing Jiaotong University, No.3 Shang Yuan Cun, Hai Dian District Beijing 100040, China
摘要	The paper proposed a new genetic clustering algorithm with variable-length chromosome representation(GCVCR), which can automatically evolve and find the optimal number of clusters as well as proper cluster centers of the data set. A new clustering criterion based on message passing between data points and the candidate centers described by the chromosome are presented to make the clustering problem more effective. The simulation results show the effectiveness of the proposed algorithm.; The paper proposed a new genetic clustering algorithm with variable-length chromosome representation(GCVCR), which can automatically evolve and find the optimal number of clusters as well as proper cluster centers of the data set. A new clustering criterion based on message passing between data points and the candidate centers described by the chromosome are presented to make the clustering problem more effective. The simulation results show the effectiveness of the proposed algorithm.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16578
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	Zhang, Ming-An ,Deng, Yong ,Chang, Dong-Xia . A novel genetic clustering algorithm with variable-length chromosome representation[C]. Association for Computing Machinery,2014:1483-1484.