Abstract
An aggregation operator [1, 5, 7, 8, 9, 12] is usually defined as a real function A n such that, from n data items x 1, …, x n in [0,1], produces an aggregated value A n (x 1,…,x n ) in [0,1] [4]. This definition can be extended to consider the whole family of operators for any n instead of a single operator for an specific n. This has led to the current standard definition [4, 15] of a family of aggregation operators (FAO) as a set {A n :[0,1]n → [0,1],n ∈ N}, providing instructions on how to aggregate collections of items of any dimension n. This sequence of aggregation functions {A n } n ∈ N is also called extended aggregation functions (EAF) by other authors [15, 5].KeywordsAggregation ProcessAggregation FunctionAggregation OperatorStable FamilyRecursive RuleThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Accepted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call