Yupu Yang

Particle swarm optimization with preference order ranking for multi-objective optimization

A new optimality criterion based on preference order (PO) scheme is used to identify the best compromise in multi-objective particle swarm optimization (MOPSO). This scheme is more efficient than Pareto ranking scheme, especially when the number of objectives is very large. Meanwhile, a novel updating formula for the particles velocity is introduced to improve the search ability of the algorithm. The proposed algorithm has been compared with NSGA-II and other two MOPSO algorithms. The experimental results indicate that the proposed approach is effective on the highly complex multi-objective optimization problems.

PSO-based single multiplicative neuron model for time series prediction

Single multiplicative neuron model is a novel neural network model introduced recently, which has been used for time series prediction and function approximation. The model is based on a polynomial architecture that is the product of linear functions in different dimensions of the space. Particle swarm optimization (PSO), a global optimization method, is proposed to train the single neuron model in this paper. An improved version of the original PSO, cooperative random learning particle swarm optimization (CRPSO), is put forward to enhance the performance of the conventional PSO. The proposed CRPSO, PSO, back-propagation algorithm and genetic algorithm are employed to train the model for three well-known time series prediction problems. The experimental results demonstrate the superiority of CRPSO-based neuron model in efficiency and robustness over the other three algorithms.

Automatically extracting T-S fuzzy models using cooperative random learning particle swarm optimization

This paper proposes a methodology for automatically extracting T-S fuzzy models from data using particle swarm optimization (PSO). In the proposed method, the structures and parameters of the fuzzy models are encoded into a particle and evolve together so that the optimal structure and parameters can be achieved simultaneously. An improved version of the original PSO algorithm, the cooperative random learning particle swarm optimization (CRPSO), is put forward to enhance the performance of PSO. CRPSO employs several sub-swarms to search the space and the useful information is exchanged among them during the iteration process. Simulation results indicate that CRPSO outperforms the standard PSO algorithm, genetic algorithm (GA) and differential evolution (DE) on the functions optimization and benchmark modeling problems. Moreover, the proposed CRPSO-based method can extract accurate T-S fuzzy model with appropriate number of rules.

Eliciting compact T-S fuzzy models using subtractive clustering and coevolutionary particle swarm optimization

This paper presents a two-stage method to extract a compact Takagi-Sugeno (T-S) fuzzy model using subtractive clustering and coevolutionary particle swarm optimization (CPSO) from data. On the first stage, the subtractive clustering is utilized to partition the input space and extract a set of fuzzy rules. On the second stage, CPSO algorithm is used to find the optimal membership functions (MFs) and consequent parameters of the rule base. Simulation results on the benchmark modeling problems show that the proposed two-stage method is effective in finding compact and accurate T-S fuzzy models.

Pseudo nearest neighbor rule for pattern classification

In this paper, we propose a new pseudo nearest neighbor classification rule (PNNR). It is different from the previous nearest neighbor rule (NNR), this new rule utilizes the distance weighted local learning in each class to get a new nearest neighbor of the unlabeled pattern-pseudo nearest neighbor (PNN), and then assigns the label associated with the PNN for the unlabeled pattern using the NNR. The proposed PNNR is compared with the k-NNR, distance weighted k-NNR, and the local mean-based nonparametric classification [Mitani, Y., & Hamamoto, Y. (2006). A local mean-based nonparametric classifier. Pattern Recognition Letters, 27, 1151-1159] in terms of the classification accuracy on the unknown patterns. Experimental results confirm the validity of this new classification rule even in practical situations.

Classification rule discovery with DE/QDE algorithm

The quantum-inspired differential evolution algorithm (QDE) is a new optimization algorithm in the binary-valued space. The paper proposes the DE/QDE algorithm for the discovery of classification rules. DE/QDE combines the characteristics of the conventional DE algorithm and the QDE algorithm. Based on some strategies of DE and QDE, DE/QDE can directly cope with the continuous, nominal attributes without discretizing the continuous attributes in the preprocessing step. DE/QDE also has specific weight mutation for managing the weight value of the individual encoding. Then DE/QDE is compared with Ant-Miner and CN2 on six problems from the UCI repository datasets. The results indicate that DE/QDE is competitive with Ant-Miner and CN2 in term of the predictive accuracy.

Nonparametric classification based on local mean and class statistics

The k-nearest neighbor classification rule (k-NNR) is a very simple, yet powerful nonparametric classification method. As a variant of the k-NNR, a nonparametric classification method based on the local mean vector has achieved good classification performance. In pattern classification, the sample mean and sample covariance are the most important statistics related to class discriminatory information. In this paper, a new variant of the k-NNR, a nonparametric classification method based on the local mean vector and class statistics has been proposed. Not only the local information of the k nearest neighbors of the unclassified pattern in each individual class but also the global knowledge of samples in each individual class are taken into account in this new classification method. The proposed classification method is compared with the k-NNR, and the local mean-based nonparametric classification in terms of the classification error rate on the unknown patterns. Experimental results confirm the validity of this new classification approach.

Differential evolution and quantum-inquired differential evolution for evolving Takagi-Sugeno fuzzy models

Research highlights? DE/QDE can solve numerical and binary optimization problems. ? DE/QDE can simultaneously optimize the structure and the parameters of the model. ? A new encoding scheme is given to allow DE/QDE to be easily performed. The differential evolution (DE) is a global optimization algorithm to solve numerical optimization problems. Recently the quantum-inquired differential evolution (QDE) has been proposed for binary optimization. This paper proposes DE/QDE to learn the Takagi-Sugeno (T-S) fuzzy model. DE/QDE can simultaneously optimize the structure and the parameters of the model. Moreover a new encoding scheme is given to allow DE/QDE to be easily performed. The two benchmark problems are used to validate the performance of DE/QDE. Compared to some existing methods, DE/QDE shows the competitive performance in terms of accuracy.

Quantum-Inspired Differential Evolution for Binary Optimization

The differential evolution (DE) is usually considered as a robust, fast, powerful optimization approach. DE has been widely applied to solve many optimization problems in the continuous-valued space. However, DE is seldom used in the binary-valued space owing to its particular operators. The paper uses a Q-bit string as a representation, and proposes the quantum-inspired differential evolution algorithm (QDE). The operators of DE are used to be able to drive the individuals to move to better solutions. Numerical experiments are performed to illustrate the performance of QDE compared with three algorithms in the binary-valued space. The results show that QDE generally outperform the other algorithms in the test functions.

A fuzzy modeling method via Enhanced Objective Cluster Analysis for designing TSK model

This paper proposes a fuzzy modeling method via Enhanced Objective Cluster Analysis to obtain the compact and robust approximate TSK fuzzy model. In our approach, the Objective Cluster Analysis algorithm is introduced. In order to obtain more compact and more robust fuzzy rule prototypes, this algorithm is enhanced by introducing the Relative Dissimilarity Measure and the new consistency criterion to represent the similarity degree between the clusters. By these additional criteria, the redundant clusters caused by iterations are avoided; the subjective influence from human judgment for clustering is weakened. Moreover the clustering results including the number of clusters and the cluster centers are considered as the initial condition of the premise parameters identification. Thus the traditional iteration modeling procedure for determining the number of rules and identifying parameters is changed into one-off modeling, which significantly reduces the burden of computation. Furthermore the decomposition errors and the approximation errors resulted from premise parameters identification by Fuzzy c-Means clustering are decreased. For the consequence parameters identification, the Stable Kalman Filter algorithm is adopted. The performance of the proposed modeling method is evaluated by the example of Box-Jenkins gas furnace. The simulation results demonstrate the power of our model.