Data Analysis and Knowledge Discovery  2018, Vol. 2 Issue (7): 81-88    DOI: 10.11925/infotech.2096-3467.2017.1333
 Current Issue | Archive | Adv Search |
A Fuzzy C-Means Algorithm Based on Huffman Tree
Xiao Mansheng, Zhou Lijuan(), Wen Zhicheng
School of Computer Science, Hunan University of Technology, Zhuzhou 412007, China
 Download: PDF (3038 KB)   HTML ( 2 )  Export: BibTeX | EndNote (RIS)
Abstract

[Objective] This paper tries to solve the issues facing traditional FCM algorithm, such as randomly choosing initial cluster center, sensitive to noise, and only capable of clustering the equally distributed samples. [Methods] We proposed a new FCM clustering algorithm based on Huffman tree with dissimilarity degree matrix of high density sample sets. The new algorithm could get initial clustering centers, and then generate the membership function of the non-normalized constraint samples. [Results] We examined the proposed algorithm with man-made samples, images, and UCI datasets. The clustering accuracy and the computation time of the new algorithm were better than algorithms based on the Gauss kernel or traditional FCM. [Limitations] The $\beta$ of the sample density adjustment factor was decided by experiment or experience without theoretical supports. [Conclusions] The proposed algorithm could be used for clustering data sets with high level of noise and distributed unequally.

Received: 28 December 2017      Published: 15 August 2018
 ZTFLH: TP391 G35