K-Means Algorithm Based on Particle Swarm Optimization

淡江大學機構典藏 > 工學院 > 電機工程學系暨研究所 > 會議論文 > Item 987654321/95896

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

题名:	K-Means Algorithm Based on Particle Swarm Optimization
作者:	Chen, Ching-Yi;Ye, Fun
贡献者:	淡江大學電機工程學系
关键词:	Clustering analysis;Particle swarm optimization;K-means
日期:	2003-12
上传时间:	2014-02-13 11:17:55 (UTC+8)
摘要:	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.
關聯:	Proceedings of 2003 International Conference on Informations, Cybernetics, and Systems，頁1470-1475
显示于类别:	[電機工程學系暨研究所] 會議論文

文件中的档案:

档案	大小	格式	浏览次数
K-Means Algorithm Based on Particle Swarm Optimization_英文摘要.docx	20Kb	Microsoft Word	206	检视/开启

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

TAIR相关文章