A Scatter Search Algorithm for the Automatic Clustering Problem - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

A Scatter Search Algorithm for the Automatic Clustering Problem

Résumé

We present a new hybrid algorithm for data clustering. This new proposal uses one of the well known evolutionary algorithms called Scatter Search. Scatter Search operates on a small set of solutions and makes only a limited use of randomization for diversification when searching for globally optimal solutions. The proposed method discovers automatically cluster number and cluster centres without prior knowledge of a possible number of class, and without any initial partition. We have applied this algorithm on standard and real world databases and we have obtained good results compared to the K-means algorithm and an artificial ant based algorithm, the Antclass algorithm.
Fichier non déposé

Dates et versions

hal-01024734 , version 1 (16-07-2014)

Identifiants

  • HAL Id : hal-01024734 , version 1

Citer

Rasha S. Abdule-Wahab, Nicolas Monmarché, Mohamed Slimane, Moaid A. Fahdil, Hilal H. Saleh. A Scatter Search Algorithm for the Automatic Clustering Problem. 6th Industrial Conference on Data Mining, Jul 2006, Leipzig, Germany. pp.350-364. ⟨hal-01024734⟩
17 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More