Please use this identifier to cite or link to this item:
|Title||A family of novel clustering algorithms|
We review the performance function associated with the familiar K-Means algorithm and that of the recently developed K-Harmonic Means. The inadequacies in these algorithms leads us to investigate a family of performance functions which exhibit superior clustering on a variety of data sets over a number of different initial conditions. In each case, we derive a fixed point algorithm for convergence by finding the fixed point of the first derivative of the performance function. We give illustrative results on a variety of data sets. We show how one of the algorithms may be extended to create a new topology-preserving mapping.
|Published in||International Conference on Intelligent Data Engineering and Automated Learning|
|Publisher||Springer, Berlin, Heidelberg|
|Item link||Item Link|
|Files in this item|