Aggregation Operators Based on Indistinguishability Operators
View/Open
328-jacas.pdf (300,7Kb) (Restricted access)
Request copy
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Document typeArticle
Defense date2006-08
PublisherWiley InterScience
Rights accessRestricted access - publisher's policy
All rights reserved. This work is protected by the corresponding intellectual and industrial
property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public
communication or transformation of this work are prohibited without permission of the copyright holder
Abstract
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 more logical language, the degrees of equivalence of l with a and b must coincide. Interesting aggregation operators on the unit interval are obtained from natural indistinguishability
operators associated to t-norms that are ordinal sums.
CitationJacas, J.; Recasens, J. Aggregation Operators Based on Indistinguishability Operators. "International journal of intelligent systems", Agost 2006, vol. 21, núm. 8, p. 857-873.
ISSN0884-8173
Publisher versionhttp://onlinelibrary.wiley.com/doi/10.1002/int.20165/pdf
Files | Description | Size | Format | View |
---|---|---|---|---|
328-jacas.pdf![]() | 300,7Kb | Restricted access |