Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 375-380 |
| Number of pages | 6 |
| Journal | Kybernetika |
| Volume | 34 |
| Issue number | 4 |
| State | Published - 1998 |