This article gives a new approach to aggregating assuming that there is an indistinguishability operator or similarity defined on the universe of discourse. The very simple idea is that when we want to aggregate two values a and b we are looking for a value l that is as similar to a as to b or, in a
One-dimensional indistinguishability operators
✍ Scribed by J. Jacas; J. Recasens
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 90 KB
- Volume
- 109
- Category
- Article
- ISSN
- 0165-0114
No coin nor oath required. For personal study only.
✦ Synopsis
The main result of the paper is an algorithm that allows us to decide when a given fuzzy relation is a one-dimensional T-indistinguishability operator for some archimedean t-norm T (in the sense of the Representation Theorem of Valverde (Fuzzy Sets and Systems 17 (1985) 313-328)). The algorithm also ÿnds all t-norms with this property.
📜 SIMILAR VOLUMES
Given a T-indistinguishability operator E defined between some fuzzy subsets of a universe of discourse X, this paper studies three ways to generate an indistinguishability operator on X compatible with E inspired by the tools used in approximate reasoning and on the duality principle. Of special in