Abstract
Fuzzy partitions with large (small) coefficients at the same locations are considered to be compatible. We investigate to what extent two or more fuzzy partitions are compatible and to what extent two fuzzy partitions are complementary. Linguistic expressions large and small are defined by comparison with a threshold α ∈ (0, 1). We discuss how to find α at which two or more fuzzy partitions are compatible and how to find α at which two fuzzy partitions are complementary. Then we explain how α-compatibility and α-complementarity can be used in decision making.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bezdek, J. C. (1981). Pattern Recognition with Fuzzy Objective Function Algorithms, Plenum Press, New York. Bodjanova, S. (1997). Aggregation Operations on Fuzzy Partitions, in: IFSA’97 Proceedings, Mares et al. (Eds.), Academia, Prague, 181–186.
Bodjanova, S. (1997). Aggregation Operations on Fuzzy Partitions, in: IFSA’97 Proceedings, Mares et al. (Eds.), Academia, Prague, 181–186.
Klir, J. G. & Youan, B. (1995). Fuzzy Sets and Fuzzy Logic: Theory and Applications, Prentice Hall, Englewood Cliffs.
Miyamoto, S. (1990). Fuzzy Set in Information Retrieval and Cluster Analysis, Kluwer, Dordrecht.
Zadeh, L. A. (1965). Fuzzy Sets, Information and Control, 8, 3, 338–353.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin · Heidelberg
About this paper
Cite this paper
Bodjanova, S. (1998). Compatible and Complementary Fuzzy Partitions. In: Rizzi, A., Vichi, M., Bock, HH. (eds) Advances in Data Science and Classification. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-72253-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-72253-0_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64641-9
Online ISBN: 978-3-642-72253-0
eBook Packages: Springer Book Archive