Wyniki wyszukiwania - BazTech

Ograniczanie wyników

1 Foundations of Computing and Decision Sciences

1 2004

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: annealing-evolution technique

Sortuj według:

Ogranicz wyniki do:

An annealing-evolution technique for clustering

Pakhira M. K., Bandyopadhyay S., Maulik U.

Foundations of Computing and Decision Sciences

2004

Vol. 29, No. 4

345-372

An efficient partitional clustering technique, called Annealing-Evolution-clustering (ANEV-clustering), and its fuzzy version, that integrate the power of simulated annealing for obtaining minimum energy configuration, and the searching capability of evolutionary programming are proposed in this article. Two other evolutionary programming based clustering techniques are also developed where Gauss and Cauchy mutation strategies have been used. The clustering methodology is used to search for appropriate cluster centers in multi-dimensional feature space such that a similarity metric of the resulting clusters is optimized. In ,AN.EV-clustering, data points are redistributed among the clusters probabilistically in the mutation phase of the evolution process, so that points that are farther away from the cluster center have higher probabilities of migrating to other clusters than those which are closer to it. The superiority of the AN EV -clustering algorithm over the widely used fc-means algorithm, simulated annealing and conventional evolutionary programming based clustering algorithms is extensively demonstrated for artificial and real life data sets. For the fuzzy clustering algorithm, we have compared the results with the well known fuzzy c-means algorithm. The proposed crisp clustering method is also used for classifying the pixels of a satellite image of a part of the city of Kolkata.