A GLOBAL ALGORITHM FOR THE FUZZY CLUSTERING PROBLEM

The Fuzzy clustering (FC) problem is a non-convex mathematical program which usually possesses several local minima. The global minimum solution of the problem is found using a simulated annealing-based algorithm. Some preliminary computational experiments are reported and the solution is compared with that generated by the Fuzzy C-means algorithm

An unsupervised learning algorithm for membrane computing

This paper focuses on the unsupervised learning problem within membrane computing, and proposes an innovative solution inspired by membrane computing techniques, the fuzzy membrane clustering algorithm. An evolution–communication P system with nested membrane structure is the core component of the algorithm. The feasible cluster centers are represented by means of objects, and three types of membranes are considered: evolution, local store, and global store. Based on the designed membrane structure and the inherent communication mechanism, a modified differential evolution mechanism is developed to evolve the objects in the system. Under the control of the evolution–communication mechanism of the P system, the proposed fuzzy clustering algorithm achieves good fuzzy partitioning for a data set. The proposed fuzzy clustering algorithm is compared to three recently-developed and two classical clustering algorithms for five artificial and five real-life data sets.National Natural Science Foundation of China No 61170030National Natural Science Foundation of China No 61472328Chunhui Project Foundation of the Education Department of China No. Z2012025Chunhui Project Foundation of the Education Department of China No. Z2012031Sichuan Key Technology Research and Development Program No. 2013GZX015

Правдо подібна нечітка кластеризація даних на основі еволюційного методу божевільних котів

The problem of fuzzy clustering of large datasets that are sent for processing in both batch and online modes, based on a credibilistic approach, is considered. To find the global extremum of the credibilistic fuzzy clustering goal function, the modification of the swarm algorithm of crazy cats swarms was introduced, that combined the advantages of evolutionary algorithms and a global random search. It is shown that different search modes are generated by a unified mathematical procedure, some cases of which are known algorithms for both local and global optimizations. The proposed approach is easy to implement and is characterized by the high speed and reliability in problems of multi-extreme fuzzy clustering

An approach based on tunicate swarm algorithm to solve partitional clustering problem

The tunicate swarm algorithm (TSA) is a newly proposed population-based swarm optimizer for solving global optimization problems. TSA uses best solution in the population in order improve the intensification and diversification of the tunicates. Thus, the possibility of finding a better position for search agents has increased. The aim of the clustering algorithms is to distributed the data instances into some groups according to similar and dissimilar features of instances. Therefore, with a proper clustering algorithm the dataset will be separated to some groups and it’s expected that the similarities of groups will be minimum. In this work, firstly, an approach based on TSA has proposed for solving partitional clustering problem. Then, the TSA is implemented on ten different clustering problems taken from UCI Machine Learning Repository, and the clustering performance of the TSA is compared with the performances of the three well known clustering algorithms such as fuzzy c-means, k-means and k-medoids. The experimental results and comparisons show that the TSA based approach is highly competitive and robust optimizer for solving the partitional clustering problems

On Clustering of Non-stationary Meteorological Time Series

A method for clustering of multidimensional non-stationary meteorological time series is presented. The approach is based on optimization of the regularized averaged clustering functional describing the quality of data representation in terms of several regression models and a metastable hidden process switching between them. Proposed numerical clustering algorithm is based on application of the finite element method (FEM) to the problem of non-stationary time series analysis. The main advantage of the presented algorithm compared to Hidden Markov Models (HMMs) and to finite mixture models is that no a priori assumptions about the probability model for the hidden and observed processes (e.g., Markovianity or stationarity) are necessary for the proposed method. Another attractive numerical feature of the discussed algorithm is the possibility to choose the optimal number of metastable clusters and a natural opportunity to control the fuzziness of the resulting decomposition a posteriory, based on the statistical distinguishability of the resulting persistent cluster states. The resulting FEM-K-trends algorithm is compared with some standard fuzzy clustering methods on toy model examples and on analysis of multidimensional historical temperature data locally in Europe and on the global temperature data set

Gout penyakit lama dihidapi manusia

This paper proposes a differential evolution with local information for TSK-type neuro-fuzzy system optimization. The differential evolution with local information consider neighborhood between each individual to keep the diversity of population. An adaptive parameter tuning based on 1/5th rule is used to trade off between local search and global search. For structure learning algorithm, the on-line clustering algorithm is used for rule generation. The structure learning algorithm generates a new rule which compares the firing strength. Initially, there is no rule in neuro-fuzzy system model. The rules are automatically generated by fuzzy measure. For parameter learning, the parameters are optimized by differential evolution algorithm. Finally, the proposed neuro-fuzzy system with novel differential evolution model is applied in chaotic sequence prediction problem. Results of this paper demonstrate the effectiveness of the proposed model. © 2011 IEEE