![Institutional Repository [SANDBOX]](images/dias.logo.png "Institutional Repository [SANDBOX]"){kind=logo}
Institutional Repository [SANDBOX]
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/B74A20D1-0E9C-48FE-A963-1D5FF23E2E14 | ||
| Year | 2008 | ||
| Type of Item | Conference Paper Abstract | ||
| License |
|
||
| Bibliographic Citation | Y. Marinakis, M. Marinaki, N. Matsatsinis and C. Zopounidis, (2008, Jun.). A Memetic-GRASP Algorithm for Clustering. Presented at 10th International Conference on Enterprise Informations Systems. [Online]. Available: http://www.researchgate.net/publication/220709352_A_memetic-GRASP_algorithm_for_clustering | ||
| Appears in Collections |
This paper presents a new memetic algorithm, which is based on the concepts of Genetic Algorithms (GAs), Particle Swarm Optimization (PSO) and Greedy Randomized Adaptive Search Procedure (GRASP), for optimally clustering N objects into K clusters. The proposed algorithm is a two phase algorithm which combines a memetic algorithm for the solution of the feature selection problem and a GRASP algorithm for the solution of the clustering problem. In this paper, contrary to the genetic algorithms, the evolution of each individual of the population is realized with the use of a PSO algorithm where each individual have to improve its physical movement following the basic principles of PSO until it will obtain the requirements to be selected as a parent. Its performance is compared with other popular metaheuristic methods like classic genetic algorithms, tabu search, GRASP, ant colony optimization and particle swarm optimization. In order to assess the efficacy of the proposed algorithm, this methodology is evaluated on datasets from the UCI Machine Learning Repository. The high performance of the proposed algorithm is achieved as the algorithm gives very good results and in some instances the percentage of the corrected clustered samples is very high and is larger than 96%.
Copyright © DIAS 2013
