This paper deals with the concepts of fuzzy equivalence relations and fuzzy partitions. We define these concepts in such ways that it is possible to construct fuzzy partitions from fuzzy equivalence relations and vice versa. Our definitions have the property that a fuzzy partition /spl Pscr/ constructed from a fuzzy equivalence relation which itself was constructed from a fuzzy partition /spl Pscr/' is equal to /spl Pscr/'. The same property can be proved if the process of construction starts and ends with an equivalence relation. These two properties are called involution properties and are the essential parts of our considerations. We underline that these involution properties are very important though frequently forgotten in publications and textbooks. In this paper we consider two different definitions for transitivity and present the definitions of the corresponding fuzzy partitions.<<ETX>>
[1]
Lotfi A. Zadeh,et al.
Similarity relations and fuzzy orderings
,
1971,
Inf. Sci..
[2]
James C. Bezdek,et al.
Pattern Recognition with Fuzzy Objective Function Algorithms
,
1981,
Advanced Applications in Pattern Recognition.
[3]
Sankar K. Pal,et al.
Fuzzy models for pattern recognition : methods that search for structures in data
,
1992
.
[4]
Siegfried Gottwald,et al.
Fuzzy Sets and Fuzzy Logic
,
1993
.
[5]
H. Zimmermann,et al.
Fuzzy Set Theory and Its Applications
,
1993
.
[6]
Ivan Kramosil.
Fuzzy Sets and Fuzzy Logic --Foundations of Applications from a Mathematical Point of View
,
1995
.