A hybrid real-parameter genetic algorithm for function optimization
Advanced Engineering Informatics
Expert Systems with Applications: An International Journal
Time complexity estimation and optimisation of the genetic algorithm clustering method
WSEAS Transactions on Mathematics
Expert Systems with Applications: An International Journal
A novel analytic method of power quality using extension genetic algorithm and wavelet transform
Expert Systems with Applications: An International Journal
Intelligent fault inference for rotating flexible rotors using Bayesian belief network
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Fault diagnosis of analog circuits using extension genetic algorithm
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Data mining for oil-insulated power transformers: an advanced literature survey
Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery
Using extension method for health analysis system of a fitness device
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
This paper presents a novel clustering method this is called extension genetic algorithm (EGA). The new method is a combination of extension theory and genetic algorithm (GA). In the past, we used the extension method in some clustering problems. With the method, we had to rely on experiences to set rules on classical domain and weight, which caused to increase two tedious and complicated steps in clustering processes. In order to improve this defect, the paper uses the EGA to find the best parameter of classical domain. Through the simulations, we prove that this new method can eliminate try and error adjustment of modeling parameters and increase the accuracy of clustering problems. Experimental results from three different examples, including two benchmark data sets and one practical application, verify the effectiveness and applicability of the proposed work.