Premium
Aggregation operators based on indistinguishability operators
Author(s) -
Jacas J.,
Recasens J.
Publication year - 2006
Publication title -
international journal of intelligent systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.291
H-Index - 87
eISSN - 1098-111X
pISSN - 0884-8173
DOI - 10.1002/int.20165
Subject(s) - equivalence (formal languages) , operator (biology) , simple (philosophy) , mathematics , aggregate (composite) , unit interval , value (mathematics) , similarity (geometry) , computer science , discrete mathematics , algebra over a field , pure mathematics , artificial intelligence , epistemology , philosophy , biochemistry , chemistry , materials science , statistics , repressor , transcription factor , composite material , gene , image (mathematics)
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 λ that is as similar to a as to b or, in a more logical language, the degrees of equivalence of λ 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. © 2006 Wiley Periodicals, Inc. Int J Int Syst 21: 857–873, 2006.