Computación y Sistemas
versión impresa ISSN 1405-5546
In this paper it is described a method to compute the distance between sets, that implies the formation of distance functions different from Hausdorff metric. Two functions with metric properties, which describe quantitatively distances between sets, are formed. First function can be used for sets arbitrary situated from each other. Second distance is more suited for sets clustered by rank links. For reconstructing the metric functions, we define the so-called boundary points between sets. This allows to defining the minimal and the maximal distances between them, which represents the arguments for the formed metric functions. This also allows quantitatively estimate in amore complete way the isolation degree between given sets.
Palabras llave : Clusterization; Metric Functions; Pattern Recognition.