Fuzzy C-means algorithm based on pso and mahalanobis distance

ASIA unversity > 資訊學院 > 生物資訊與醫學工程學系 > 期刊論文 > Item 310904400/8646

請使用永久網址來引用或連結此文件: http://asiair.asia.edu.tw/ir/handle/310904400/8646

題名:	Fuzzy C-means algorithm based on pso and mahalanobis distance
作者:	Liu, Hsiang-Chuan;Yih, Jeng-Ming;Lin, Wen-Chih;Liu, Tung-Sheng
貢獻者:	Department of Bioinformatics
關鍵詞:	Copying;Covariance matrix;Fuzzy clustering;Fuzzy rules;Fuzzy systems;Particle swarm optimization (PSO);Euclidean distance;FCM algorithm;Fuzzy C-means algorithms;G-K algorithm;Gustafson-Kessel;M-algorithms;Mahalanobis;Mahalanobis distances;Non-Spherical;Prior information;Real data sets;Singularity problems
日期:	2009-12
上傳時間:	2010-04-07 13:21:15 (UTC+0)
出版者:	Asia University
摘要:	Some of the wall-known fuzzy clustering algorithms are based on Euclidean distance function, which, can only be used to detect spherical structural clusters. Gustafson-Kessel (GK) clustering algorithm and Gath-Geva (GG) clustering algorithm were developed to detect non-spherical structural clusters. Both of GG and GK algorithms suffer from the singularity problem of covariance matrix and the effect of initial status. In this paper, a new Fuzzy C-Means algorithm based on Particle Swarm Optimization and Mahalanobis is distance without prior information (PSO-FCM-M) is proposed, to improve those limitations of GG and GK algorithms. And we point out that the PSO-FCM algorithm is a special case of PSO-FCM-M algorithm. The experimental results of two real data sets show that the performance of our proposed PSO-FCM-M algorithm is better than those of the FCM, GG, GK algorithms. © 2009 ISSN.
關聯:	International Journal of Innovative Computing, Information and Control 5(12):5033-5040
顯示於類別:	[生物資訊與醫學工程學系 ] 期刊論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
		0Kb	Unknown	616	檢視/開啟
89.doc		30Kb	Microsoft Word	620	檢視/開啟

在ASIAIR中所有的資料項目都受到原著作權保護.

資料載入中.....