𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connectives for fuzzy partitions

✍ Scribed by Ion Iancu

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
240 KB
Volume
101
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.

✦ Synopsis

The fuzzy intersection and union are defined by means of a certain pair (T, S) of non-strict Archimedean operators dual with respect to a strict negation having the same additive generator as T. We prove that the equivalence between the Butnariu's definition and the Ruspini's one concerning the fuzzy partitions holds if and only if the connectives for fuzzy operations are T~ and S~.

πŸ“œ SIMILAR VOLUMES

Improved fuzzy partitions for fuzzy regr
Improved fuzzy partitions for fuzzy regression models
✍ Frank HΓΆppner; Frank Klawonn πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 641 KB

Fuzzy clustering algorithms like the popular fuzzy c-means algorithm (FCM) are frequently used to automatically divide up the data space into fuzzy granules. When the fuzzy clusters are used to derive membership functions for a fuzzy rule-based system, then the corresponding fuzzy sets should fulfil

Fuzzy connectives via matrix logic
Fuzzy connectives via matrix logic
✍ JΓ‘nos C. Fodor πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 517 KB
Ordinal decomposability and fuzzy connec
Ordinal decomposability and fuzzy connectives
✍ John W.T. Lee πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 255 KB

The beneΓΏt of computing with linguistic terms is now generally accepted. Fuzzy set theory provides us the conceptual tool for the interpretation and evaluation of linguistic concepts and expressions. It constitutes a quantiΓΏcation of the compatibility degree of objects with the associated linguistic