Abstract
The fuzzy transitive relation is very essential for a fuzzy ordering relation in fuzzy decision problems and also for a fuzzy equivalence relation in fuzzy clustering problems. But data of binary relation given by questionnaires do not usually satisfy the transitivity condition. Then the transitive closures of binary relation are used to be transitive. This paper deals with a heuristic method for finding a fuzzy transitive relation which is a good approximation to a given relation. The fuzzy transitive relation obtained by this method is closer to the relation in the system under consideration than the transitive closure is in the sense of the error sum of squares.
