Abstract
The rival penalized competitive learning (RPCL) algorithm has been developed to make the clustering analysis on a set of sample data in which the number of clusters is unknown, and recent theoretical analysis shows that it can be constructed by minimizing a special kind of cost function on the sample data. In this paper, we use the Mahalanobis distance instead of the Euclidean distance in the cost function computation and propose the Mahalanobis distance based rival penalized competitive learning (MDRPCL) algorithm. It is demonstrated by the experiments that the MDRPCL algorithm can be successful to determine the number of elliptical clusters in a data set and lead to a good classification result.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Galinski, R.B., Harabasz, J.A.: A Dendrite Method for Cluster Analysis. Communications in Statistics 3, 1–27 (1974)
Hartigan, J.A.: Distribution Problems in Clustering. In: Van Ryzin, J. (ed.) Classification and Clustering, pp. 45–72. Academic Press, New York (1977)
Nasrabadi, N., King, R.A.: Image Coding Using Vector Quantization: A Review. IEEE Trans. Commun. 36, 957–971 (1988)
Hecht-Nielsen, R.: Neurocomputing. Addison-Wesley, Reading (1990)
Ahalt, S.C., Krishnamurty, A.K., Chen, P., Melton, D.E.: Competitive Learning Algorithms for Vector Quantization. Neural Networks 3, 277–291 (1990)
Xu, L., Krzyzak, A., Oja, E.: Rival Penalized Competitive Learning for Clustering Analysis, RBF Net, and Curve Detection. IEEE Trans. Neural Networks 4, 636–649 (1993)
Xu, L.: Rival Penalized Competitive Learning, Finite Mixture, and Multisets Clustering. In: Proc. of International Joint Conference on Neural Networks (IJCNN 1998), vol. 3, pp. 2525–2530. IEEE Press, Alaska (1998)
Ma, J., Wang, T.: A Cost Function Approach to Rival penalized competitive Learning (RPCL). IEEE Trans. Systems, Man, and Cybernetics B (in Press)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ma, J., Cao, B. (2006). The Mahalanobis Distance Based Rival Penalized Competitive Learning Algorithm. In: Wang, J., Yi, Z., Zurada, J.M., Lu, BL., Yin, H. (eds) Advances in Neural Networks - ISNN 2006. ISNN 2006. Lecture Notes in Computer Science, vol 3971. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11759966_66
Download citation
DOI: https://doi.org/10.1007/11759966_66
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34439-1
Online ISBN: 978-3-540-34440-7
eBook Packages: Computer ScienceComputer Science (R0)