๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Deduction-seeking procedures and transitive relations

โœ Scribed by M. K. Morokhovets

Publisher
Springer US
Year
1986
Tongue
English
Weight
577 KB
Volume
21
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Aggregation of T-transitive relations
Aggregation of T-transitive relations
โœ J. Jacas; J. Recasens ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

This article studies the aggregation of transitive fuzzy relations. We first find operators that preserve transitivity and then extend the results to aggregating operators. As special cases, means and some kind of suitable ordered weighted averaging (OWAs) are used to aggregate transitive fuzzy rela

A method to make some fuzzy relations T-
A method to make some fuzzy relations T-transitive
โœ Luis Garmendia; Cristina del Campo; Susana Cubillo; Adela Salvador ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 153 KB

A new method is given for a finite reflexive relation with a fixed set of properties and a t-norm T, so that a different, but similar, T-transitive relation could be found. The transitive closure is greater than the given relation; however, the T-transitivized relation defined in this article is les

Strongly transitive fuzzy relations: An
Strongly transitive fuzzy relations: An alternative way to describe similarity
โœ Vladik Kreinovich ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 936 KB

The notion of a transitive closure of a fuzzy relation is very useful for clustering in pattern recognition, for fuzzy databases, etc. It is based on translating the standard definition of transitivity and transitive closure into fuzzy terms. This definition works fine, but to some extent it does no