K-Means Algorithm Based on Particle Swarm Optimization

機構典藏 > College of Engineering > Graduate Institute & Department of Electrical Engineering > Proceeding > Item 987654321/95896

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

Title:	K-Means Algorithm Based on Particle Swarm Optimization
Authors:	Chen, Ching-Yi;Ye, Fun
Contributors:	淡江大學電機工程學系
Keywords:	Clustering analysis;Particle swarm optimization;K-means
Date:	2003-12
Issue Date:	2014-02-13 11:17:55 (UTC+8)
Abstract:	Clustering analysis aims at discovering groups and identifying interesting distributions and patterns in data sets. It can help the user to distinguish the structure of data and simplify the complexity of data from mass information. A particle swarm optimization-based clustering technique that utilized the principles of K-means algorithm, called KPSO-clustering, is proposed in this article. We attempt to integrate the effectiveness of the K-means algorithm for partitioning data into a number of clusters, with the capability of PSO to bring it out of the local minima. Finally, the effectiveness of the KPSO-clustering is demonstrated on four artificial data sets.
Relation:	Proceedings of 2003 International Conference on Informations, Cybernetics, and Systems，頁1470-1475
Appears in Collections:	[Graduate Institute & Department of Electrical Engineering] Proceeding

Files in This Item:

File	Size	Format
K-Means Algorithm Based on Particle Swarm Optimization_英文摘要.docx	20Kb	Microsoft Word	207	View/Open