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.
KeywordsCluster Algorithm Performance Function Minimum Performance Fixed Point Algorithm Gaussian Basis Function
Unable to display preview. Download preview PDF.
- Barbakh, W., Fyfe, C.: Performance functions and clustering algorithms. Computing and Information Systems 10(2), 2–8 (2006) ISSN 1352-9404Google Scholar
- Bishop, C.M., Svensen, M., Williams, C.K.I.: Gtm: The generative topographic mapping. Neural Computation (1997)Google Scholar
- Fyfe, C.: Two topographic maps for data visualization. Data Mining and Knowledge Discovery (2006)Google Scholar
- Kohonen, T. (ed.): Self-Organising Maps. Springer, Heidelberg (1995)Google Scholar
- Pẽna, M., Fyfe, C.: Model- and data-driven harmonic topographic maps. WSEAS Transactions on Computers 4(9), 1033–1044 (2005)Google Scholar
- Zhang, B.: Generalized k-harmonic means – boosting in unsupervised learning. Technical report, HP Laboratories, Palo Alto (October 2000)Google Scholar
- Zhang, B., Hsu, M., Dayal, U.: K-harmonic means - a data clustering algorithm. Technical report, HP Laboratories, Palo Alto (October 1999)Google Scholar