Alternative KPSO-Clustering Algorithm

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Journal Article > Item 987654321/46130

Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/46130

Title:	Alternative KPSO-Clustering Algorithm
Authors:	余繁;Ye, Fun;Chen, Ching-yi
Contributors:	淡江大學電機工程學系
Keywords:	Clustering;Particle Swarm Optimization;K-means
Date:	2005-06
Issue Date:	2010-03-26 21:01:28 (UTC+8)
Publisher:	淡江大學
Abstract:	This paper presents an evolutionary particle swarm optimization (PSO) learning-based method to optimally cluster N data points into K clusters. The hybrid PSO and K-means algorithm with a novel alternative metric, called Alternative KPSO-clustering (AKPSO), is developed to automatically detect the cluster centers of geometrical structure data sets. The alternative metric is known has more robust ability than the common-used Euclidean norm. In AKPSO algorithm, the special alternative metric is considered to improve the traditional K-means clustering algorithm to deal with various structure data sets. For testing the performance of the proposed method, this paper will show the experience results by using several artificial and real data sets. Simulation results compared with some well-known clustering methods demonstrate the robustness and efficiency of the novel AKPSO method.
Relation:	淡江理工學刊=Tamkang journal of science and engineering 8(2), pp.165-174
DOI:	10.6180/jase.2005.8.2.09
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Journal Article

Files in This Item:

File	Description	Size	Format
		0Kb	Unknown	343	View/Open
1560-6686_8-2-9.pdf		3469Kb	Adobe PDF	385	View/Open