Article
Keywords:
cluster structure; nonlinear projection
Summary:
Detecting a cluster structure is considered. This means solving either the problem of discovering a natural decomposition of data points into groups (clusters) or the problem of detecting clouds of data points of a specific form. In this paper both these problems are considered. To discover a cluster structure of a specific arrangement or a cloud of data of a specific form a class of nonlinear projections is introduced. Fitness functions that estimate to what extent a given subset of data points (in the form of the corresponding projection) represents a good solution for the first or the second problem are presented. To find a good solution one uses a search and optimization procedure in the form of Evolutionary Programming. The problems of cluster validity and robustness of algorithms are considered. Examples of applications are discussed.
References:
[1] Ballard D. H., Brown C. H.: Computer Vision. Prentice–Hall, 1982
[2] Brailovsky V. L., Har-even M.: Detecting a data set structure through the use of nonlinear projections and stochastic optimization. In: Proc. 1st IARP TC1 Workshop on Statistical Techniques in Pattern Recognition, Prague 1997, pp. 7–12
[3] Everitt B. S.:
Cluster Analysis. Wiley, New York 1974
MR 0455213
[4] Har–even M., Brailovsky V. L.:
Probabilistic validation approach for clustering. Pattern Recognition Lett. 16 (1995), 1189–1196
DOI 10.1016/0167-8655(95)00073-P
[7] Porto V. W., Fogel D. B., Fogel L. J.:
Alternative neural network training methods. IEEE Expert 10 (1995), 3, 16–22
DOI 10.1109/64.393138
[8] (ed.) S. C. Shapiro:
Encyclopedia of Artificial Intelligence, Vol. 1, ‘Clustering’. Wiley, New York 1990, pp. 103–111
MR 1059716