Adaptive Hyper-Fuzzy Partition Particle Swarm Optimization Clustering Algorithm

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

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

题名:	Adaptive Hyper-Fuzzy Partition Particle Swarm Optimization Clustering Algorithm
作者:	Feng, Hsuan-ming;Chen, Ching-yi;余繁;Ye, Fun
贡献者:	淡江大學電機工程學系
日期:	2006-08-01
上传时间:	2010-08-10 10:59:26 (UTC+8)
出版者:	Taylor & Francis
摘要:	This article presents an adaptive hyper-fuzzy partition particle swarm optimization clustering algorithm to optimally classify different geometrical structure data sets into correct groups. In this architecture, we use a novel hyper-fuzzy partition metric to improve the traditional common-used Euclidean norm metric clustering method. Since one fuzzy rule describes one pattern feature and implies the detection of one cluster center, it is encouraged to decrease the number of fuzzy rules with the hyper-fuzzy partition metric. According to the adaptive particle swarm optimization, it is very suitable to manage the clustering task for a complex, irregular, and high dimensional data set. To demonstrate the robustness of the proposed adaptive hyper-fuzzy partition particle swarm optimization clustering algorithms, various clustering simulations are experimentally compared with K -means and fuzzy c-means learning methods.
關聯:	Cybernetics and Systems 37(5), pp.463-479
DOI:	10.1080/01969720600683429
显示于类别:	[電機工程學系暨研究所] 期刊論文

文件中的档案:

档案	大小	格式	浏览次数
0196-9722_37(5)p463-479.pdf	1371Kb	Adobe PDF	374	检视/开启

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

TAIR相关文章