Using Global Optimization to Explore Multiple Solutions of Clustering Problems
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part III
Interactive Visualization Tools for Meta-Clustering
Proceedings of the 2009 conference on New Directions in Neural Networks: 18th Italian Workshop on Neural Networks: WIRN 2008
Metaclustering and Consensus Algorithms for Interactive Data Analysis and Validation
WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
Multiple data structure discovery through global optimisation, meta clustering and consensus methods
International Journal of Knowledge Engineering and Soft Data Paradigms
Global optimization, meta clustering and consensus clustering for class prediction
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
Multiple clustering solutions analysis through least-squares consensus algorithms
CIBB'09 Proceedings of the 6th international conference on Computational intelligence methods for bioinformatics and biostatistics
| Hi-index | 0.00 |
In this paper is presented an hybrid algorithm for finding the absolute extreme point of a multimodal scalar function of many variables. The algorithm is suitable when the objective function is expensive to compute, the computation can be affected by noise and/or partial derivatives cannot be calculated. The method used is a genetic modification of a previous algorithm based on the Price’s method. All information about behavior of objective function collected on previous iterates are used to chose new evaluation points. The genetic part of the algorithm is very effective to escape from local attractors of the algorithm and assures convergence in probability to the global optimum. The proposed algorithm has been tested on a large set of multimodal test problems outperforming both the modified Price’s algorithm and classical genetic approach.