Max-min and max-Δ transitive resemblance matrices in classification problems

Abstract

The basic properties and methods of developing max-min and max-Δ transitive approximations of resemblance matrices of observed objects are reviewed. A new algorithm of constructing max-Δ transitive closure of such matrices is presented. The conditions of applications of the max-min and max-Δ transitive measures of similarity are considered.