Time complexity estimation and optimisation of the genetic algorithm clustering method

This paper presents the time complexity estimation and optimisation of the genetic algorithm clustering method. The tested feature in the clustering algorithm is the population limit function. For the purpose of the study, segmental kurtosis analysis was done on several segmented fatigue time series data, which are then represented in two-dimensional heteroscaled datasets. These datasets are then clustered using the genetic algorithm clustering method and the runtime of the algorithm is measured against the number of iterations. Polynomial fitting is used on the runtime data to determine the time complexity of the algorithm. Analysis is repeated with the inclusion of the population limit in the clustering algorithm. The results of the analysis will be used to determine the significance of including the population limit function in the algorithm for optimal performance.

[1]  Luiz Antonio Nogueira Lorena,et al.  Constructive Genetic Algorithm for Clustering Problems , 2001, Evolutionary Computation.

[2]  Jun-Lin Lin,et al.  Genetic algorithm-based clustering approach for k-anonymization , 2009, Expert Syst. Appl..

[3]  A. K. Smilde,et al.  Genetic algorithm based two-mode clustering of metabolomics data , 2008, Metabolomics.

[4]  Chang Wook Ahn,et al.  Adaptive Clustering Technique Using Genetic Algorithms , 2005, IEICE Trans. Inf. Syst..

[5]  Ning Chen,et al.  Complexity Analysis of Reed-Solomon Decoding over GF(2m) without Using Syndromes , 2008, EURASIP J. Wirel. Commun. Netw..

[6]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[7]  Zulkifli Mohd Nopiah,et al.  A Weighted Genetic Algorithm Based Method for Clustering of Heteroscaled Datasets , 2009, 2009 International Conference on Signal Processing Systems.

[8]  Meng-Hui Wang,et al.  A novel clustering algorithm based on the extension theory and genetic algorithm , 2009, Expert Syst. Appl..

[9]  Frances Y. Kuo,et al.  Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions , 2006, J. Complex..

[10]  S. N. Sivanandam,et al.  Introduction to genetic algorithms , 2007 .

[11]  Hong S. He,et al.  Forest landscape models: Definitions, characterization, and classification , 2008 .

[12]  Sushil J. Louis,et al.  A recursive clustering methodology using a genetic algorithm , 2007, 2007 IEEE Congress on Evolutionary Computation.

[13]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[14]  Shahrir Abdullah,et al.  Peak-valley segmentation algorithm for fatigue time series data , 2008 .

[15]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1992, Artificial Intelligence.

[16]  Frances Y. Kuo,et al.  Component-by-component constructions achieve the optimal rate of convergence for multivariate integration in weighted Korobov and Sobolev spaces , 2003, J. Complex..

[17]  Wei Song,et al.  Genetic algorithm for text clustering using ontology and evaluating the validity of various semantic similarity measures , 2009, Expert Syst. Appl..

[18]  Ujjwal Maulik,et al.  Genetic algorithm-based clustering technique , 2000, Pattern Recognit..

[19]  Shahrir Abdullah,et al.  Segmentation and scattering of fatigue time series data by kurtosis and root mean square , 2008 .