Abstract
Term cluster analysis (introduced by Tryon, 1939 for the first time) actually includes a set of various algorithms of classification without teacher [1]. The general question asked by researchers in many areas is how to organize observed data in evident structures, i.e. to develop taxonomy. For example, biologists set the purpose to divide animals into different types that to describe distinctions between them. According to the modern system accepted in biology, the person belongs to primacies, mammals, vertebrate and an animal. Notice that in this classification, the higher is aggregation level, the less is the similarity between members in the corresponding class. The person has more similarity to other primacies (i.e. with monkeys), than with the “remote” members of family of mammals (for example, dogs), etc.The clustering is applied in the most various areas. For example, in the field of medicine the clustering of diseases, treatments of diseases or symptoms of diseases leads to widely used taksonomy. In the field of psychiatry the correct diagnostics of clusters of symptoms, such as paranoia, schizophrenia, etc., is decisive for successful therapy. In archeology by means of the cluster analysis researchers try to make taxonomy of stone tools, funeral objects, etc. Broad applications of the cluster analysis in market researches are well known. Generally, every time when it is necessary to classify “mountains” of information to groups, suitable for further processing, the cluster analysis is very useful and effective. In recent years the cluster analysis is widely used in the intellectual analysis of data (Data Mining), as one of the principal methods [1]. The purpose of this chapter is the consideration of modern methods of the cluster analysis, crisp methods(a method of C-means, Ward’s method, the next neighbor, the most distant neighbor), and fuzzy methods, robust probabilistic and possibilistic clustering methods. In the Sect. 7.2 problem of cluster analysis is formulated, main criteria and metrics are considered and discussed. In the Sect. 7.3 classification of cluster analysis methods is presented, several crisp methods are considered, in particular hard C-means method and Ward’s method. In the Sect. 7.4 fuzzy C-means method is described. In the Sect. 7.5 the methods of initial location of cluster centers are considered: peak and differential grouping and their properties analyzed.
In the Sect. 7.6 Gustavsson-Kessel’s method of cluster analysis is considered which is a generalization of fuzzy C-means method when metrics of distance differs from Euclidian.
In the Sect. 7.7 adaptive robust clustering algorithms are presented and analyzed which are used when initial data are distorted by high level of noise, or by outliers. In the Sect. 7.8 robust probabilistic algorithms of fuzzy clustering are considered. Numerous results of pilot studies of fuzzy methods of a cluster analysis are presented in the Sect. 7.9 among them is a problem of UN countries clustering by indicators of sustainable development.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Durant, B., Smith, G.: Cluster analysis.- M.Statistica 289 p. (rus)
Zaychenko, Y.P.: Fundamentals of Intellectual Systems Design, 352 p. Kiev Publ. house, Slovo (2004). (in Russ.)
Zaychenko, Y.P.: Fuzzy models and methods in intellectual systems, 354 p. Publ. House “Slovo”, Kiev (2008). Zaychenko, Y.: Fuzzy Group Method of Data Handling under fuzzy input data. In: System research and information technologies, №3, pp. 100–112 (2007). (in Russ.)
Osovsky, S.: Neural networks for information processing, transl. from pol. M Publ. house Finance and Statistics, 344 p. (2002). (in Russ.)
Yager, R.R., Filev, D.P.: Approximate clustering via the mountain method. IEEE Trans. Syst. Man Cybern. 24, 1279–1284 (1994)
Krishnapuram, R., Keller, J.: A possibilistic approach to clustering. IEEE Trans. Fuzzy Syst. 1, 98–110 (1993)
Krishnapuram, R., Keller, J.: Fuzzy and possibilistic clustering methods for computer vision. IEEE Trans. Fuzzy Syst. 1, 98–110 (1993)
Chung, F.L., Lee, T.: Fuzzy competitive learning. Neural Netw. 7, 539–552 (1994)
Park, D.C., Dagher, I.: Gradient based fuzzy C-means (GBFCM) algorithm. In: Proceedings of IEEE Inernational Conference on Neural Networks, pp. 1626−1631 (1984)
Bodyanskiy, Y., Gorshkov Y., Kokshenev, I., Kolodyazhniy, V.: Robust recursive fuzzy clustering algorithms. In: Proceedings of East West Fuzzy Colloquim 2005, pp. 301–308, HS, Zittau/Goerlitz (2005)
Bodyanskiy, Y., Gorshkov, Y., Kokshenev, I., Kolodyazhniy, V.: Outlier resistant recursive fuzzy clustering algorithm. In: Reusch, B. (ed.) Computational Intelligence: Theory and Applications. Advances in Soft Computing, vol. 38, pp. 647–652. Springer, Berlin (2006)
Bodyanskiy, Y.: Computational intelligence techniques for data analysis. In: Lecture Notes in Informatics, vol. P-72, pp. 15–36. GI, Bonn (2005)
Vasiliyev, V.I.: Pattern-recognition systems. Naukova Dumka, Kiev (1988). (in Russ)
Bodyanskiy, Y., Gorshkov, Y., Kokshenev, I., Kolodyazhniy, V., Shilo, O.: Robust recursive fuzzy clustering-based segmentation of biomedical time series. In: Proceedings of 2006 International Symposium on Evolving Fuzzy Systems, pp. 101–105, Lancaster, UK (2006)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Zgurovsky, M.Z., Zaychenko, Y.P. (2016). The Cluster Analysis in Intellectual Systems. In: The Fundamentals of Computational Intelligence: System Approach. Studies in Computational Intelligence, vol 652. Springer, Cham. https://doi.org/10.1007/978-3-319-35162-9_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-35162-9_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-35160-5
Online ISBN: 978-3-319-35162-9
eBook Packages: EngineeringEngineering (R0)