The arithmetic recursive average as an instance of the recursive weighted power mean
Department of Electrical and Computer Engineering, Center for Data Sciences
The aggregation of multiple information sources has a long history and ranges from sensor fusion to the aggregation of individual algorithm outputs and human knowledge. A popular approach to achieve such aggregation is the fuzzy integral (FI) which is defined with respect to a fuzzy measure (FM) (i.e. a normal, monotone capacity). In practice, the discrete FI aggregates information contributed by a discrete number of sources through a weighted aggregation (post-sorting), where the weights are captured by a FM that models the typically subjective `worth' of subsets of the overall set of sources. While the combination of FI and FM has been very successful, challenges remain both in regards to the behavior of the resulting aggregation operators - which for example do not produce symmetrically mirrored outputs for symmetrically mirrored inputs - and also in a manifest difference between the intuitive interpretation of a stand-alone FM and its actual role and impact when used as part of information fusion with a FI. This paper elucidates these challenges and introduces a novel family of recursive average (RAV) operators as an alternative to the FI in aggregation with respect to a FM; focusing specifically on the arithmetic recursive average. The RAV is designed to address the above challenges, while also facilitating fine-grained analysis of the resulting aggregation of different combinations of sources. We provide the mathematical foundations of the RAV and include initial experiments and comparisons to the FI for both numeric and interval-valued data.
2017 IEEE International Conference on Fuzzy Systems
Havens, T. C.,
The arithmetic recursive average as an instance of the recursive weighted power mean.
2017 IEEE International Conference on Fuzzy Systems.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/989