Multidimensional Particle Swarm Optimization for Machine Learning and Pattern Recognition by Serkan Kiranyaz Turker Ince & Moncef Gabbouj

Multidimensional Particle Swarm Optimization for Machine Learning and Pattern Recognition by Serkan Kiranyaz Turker Ince & Moncef Gabbouj

Author:Serkan Kiranyaz, Turker Ince & Moncef Gabbouj
Language: eng
Format: epub
Publisher: Springer Berlin Heidelberg, Berlin, Heidelberg


(6.1)

where is the quantization error (or the average intra-cluster distance) as the Compactness term and is the Separation term, by simply penalizing higher cluster numbers with an exponential, Using the validity index yields the simplest form (i.e., only the nominator of ) and becomes entirely parameter-free.

On the other hand, (hard) clustering has some constraints. Let be the set of data points assigned to a (potential) cluster centroid for a particle a at time t. The clusters should maintain the following constraints:1.Each data point should be assigned to one cluster set, i.e.,



Download



Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.