K平面聚类算法的模糊改进及其鲁棒性研究

doi:10.3724/SP.J.1146.2006.02065

Download: PDF (228 KB)
Export: BibTeX | EndNote (RIS)

Abstract A new robust Improved Fuzzy Partitions for K-Plane Clustering (IFP-KPC) algorithm is proposed. The proposed algorithm can reduce the sensitivity of the k-plane clustering algorithm to noises in real datasets. Also the distances to the Voronoi cell are used to give a reasonable explanation for the robustness of IFP-KPC. Experimental results demonstrate the effectiveness of IFP-KPC.

Key words： K-plane clustering Improved fuzzy partitions Voronoi distance Robustness

Received: 26 December 2006

PACS:

TP391.4

	Service

	E-mail this article
	Add to my bookshelf
	Add to citation manager
	E-mail Alert
	RSS
	Articles by authors




	Zhu Lin
	Wang Shi-tong
	Pan Yong-hui
	Han Bin

Cite this article:

Zhu Lin,Wang Shi-tong,Pan Yong-hui等. Improved Fuzzy Partitions for K-Plane Clustering Algorithm and Its Robustness Research[J]. , 2008, 30(8): 1923-1927 .

URL:

http://jeit.ie.ac.cn/EN/10.3724/SP.J.1146.2006.02065 OR http://jeit.ie.ac.cn/EN/Y2008/V30/I8/1923

[1]	WANG Shu, DA Xinyu. Robust Secure Transmit Methods for Multibeam Satellite Communication with Imperfect Channel State Information[J]. JEIT, 2017, 39(2): 342-350.