An algorithm to compute the transitive closure, a transitive approximation and a transitive opening of a proximity
Document typeConference report
Rights accessOpen Access
A method to get the transitive closure, a transitive opening and a transitive approximation of a reflexive and symmetric fuzzy relation is presented. The method builds at the same time a binary partition tree for the output similarities.