A generalization of the Bonferroni mean based on partitions
Beliakov, Gleb, James, Simon and Radko, Mesiar 2013, A generalization of the Bonferroni mean based on partitions, in FUZZ-IEEE 2013 : Proceedings of the IEEE International Conference on Fuzzy Systems, IEEE Computational Intelligence Society, Piscataway, N.J..
The mean defined by Bonferroni in 1950 (known by the same name) averages all non-identical product pairs of the inputs. Its generalizations to date have been able to capture unique behavior that may be desired in some decision-making contexts such as the ability to model mandatory requirements. In this paper, we propose a composition that averages conjunctions between the respective means of a designated subset-size partition. We investigate the behavior of such a function and note the relationship within a given family as the subset size is changed. We found that the proposed function is able to more intuitively handle multiple mandatory requirements or mandatory input sets.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Field of Research
080108 Neural, Evolutionary and Fuzzy Computation
Socio Economic Objective
970108 Expanding Knowledge in the Information and Computing Sciences
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact firstname.lastname@example.org.