Generalised fuzzy local information C-means clustering algorithm
暂无分享,去创建一个
Fuzzy C-means is an efficient algorithm for data clustering. The fuzzy local information C-means (FLICM) algorithm was introduced by Krinidis and Chatzis for image clustering and it was proved that it has very good properties. Presented is a generalisation of the fuzzy local information C-means clustering algorithm, in order to be applicable to any kind of input data sets instead of images. The generalisation of FLICM maintains the properties of the original algorithm, and it is also effective and efficient, providing robustness against noise. Furthermore, it is fully free of any kind of empirically adjusted parameters, contrary to all other fuzzy C-means algorithms that have been proposed in the literature.
[1] James C. Bezdek,et al. Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.
[2] Stelios Krinidis,et al. A Robust Fuzzy Local Information C-Means Clustering Algorithm , 2010, IEEE Transactions on Image Processing.
[3] Lotfi A. Zadeh,et al. Fuzzy Sets , 1996, Inf. Control..
[4] David P. Dobkin,et al. The quickhull algorithm for convex hulls , 1996, TOMS.