An Efficient GA-Based Clustering Technique

淡江大學機構典藏 > 工學院 > 資訊工程學系暨研究所 > 期刊論文 > Item 987654321/45281

jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/45281

题名:	An Efficient GA-Based Clustering Technique
作者:	林慧珍;Lin, Hwei-jen;Yang, Fu-wen;Kao, Yang-ta
贡献者:	淡江大學資訊工程學系
关键词:	Unsupervised Clustering;Genetic Algorithms;Reproduction;Crossover;Mutation;Fitness;Cluster Validity
日期:	2005-06-01
上传时间:	2010-03-26 18:55:24 (UTC+8)
出版者:	淡江大學
摘要:	In this paper, we propose a GA-based unsupervised clustering technique that selects cluster centers directly from the data set, allowing it to speed up the fitness evaluation by constructing a look-up table in advance, saving the distances between all pairs of data points, and by using binary representation rather than string representation to encode a variable number of cluster centers. More effective versions of operators for reproduction, crossover, and mutation are introduced. Finally, the Davies-Bouldin index is employed to measure the validity of clusters. The development of our algorithm has demonstrated an ability to properly cluster a variety of data sets. The experimental results show that the proposed algorithm provides a more stable clustering performance in terms of number of clusters and clustering results. This results in considerable less computational time required, when compared to other GA-based clustering algorithms.
關聯:	淡江理工學刊=Tamkang journal of science and engineering 8(2), pp.113-122
DOI:	10.6180/jase.2005.8.2.04
显示于类别:	[資訊工程學系暨研究所] 期刊論文

文件中的档案:

档案	描述	大小	格式	浏览次数
		0Kb	Unknown	253	检视/开启
1560-6686_8-2-4.pdf		1192Kb	Adobe PDF	459	检视/开启

在機構典藏中所有的数据项都受到原著作权保护.

TAIR相关文章