Neural Computation
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Efficient Global Optimization of Expensive Black-Box Functions
Journal of Global Optimization
A Taxonomy of Global Optimization Methods Based on Response Surfaces
Journal of Global Optimization
Accelerating the Convergence of Evolutionary Algorithms by Fitness Landscape Approximation
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Journal of Global Optimization
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Differential Evolution: A Practical Approach to Global Optimization (Natural Computing Series)
Neural Computation
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Gaussian Processes for Machine Learning (Adaptive Computation and Machine Learning)
Multi-objective genetic algorithms: Problem difficulties and construction of test problems
Evolutionary Computation
On the performance of metamodel assisted MOEA/D
ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Accelerating evolutionary algorithms with Gaussian process fitness function models
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Single- and multiobjective evolutionary optimization assisted by Gaussian random field metamodels
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Gaussian process model is an effective and efficient method for approximating a continuous function. However, its computational cost increases exponentially with the size of training data set. A very popular way to alleviate this shortcoming is to cluster the whole training data set into a number of small clusters and then a local model is built for each cluster. However, widely used crisp clustering might not be accurate in the boundary areas among different clusters. This paper proposes a fuzzy clustering based method for improving approximation quality. Several clusters with overlaps are firstly obtained by Fuzzy C-Means clustering and then local models are built for these clusters. It has been demonstrated that this method can be used with evolutionary algorithms for dealing expensive optimization problems.