z-logo
Premium
Generalized intuitionistic fuzzy Bonferroni means
Author(s) -
Xia Meimei,
Xu Zeshui,
Zhu Bin
Publication year - 2012
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.20515
Subject(s) - bonferroni correction , mathematics , aggregate (composite) , fuzzy set , set (abstract data type) , fuzzy logic , element (criminal law) , basis (linear algebra) , computer science , mathematical optimization , artificial intelligence , statistics , materials science , geometry , political science , law , composite material , programming language
Intuitionistic fuzzy set is a widely used tool to express the membership, nonmembership, and hesitancy information of an element to a set. To aggregate the intuitionistic fuzzy information, a lot of aggregation techniques have been developed, especially, the ones which reflect the correlations of the aggregated arguments are the hot research topics, among which Bonferroni mean (BM) is an important aggregation technique. However, the classical BM ignores some aggregation information and the weight vector of the aggregated arguments. In this paper, we introduce the generalized weighted BM and the generalized intuitionistic fuzzy weighted BM, both of which focus on the group opinion. Paying more attention to the individual opinions, we further define the generalized weighted Bonferroni geometric mean and the generalized intuitionistic fuzzy weighted Bonferroni geometric mean. Various families of the existing operators can be obtained when the parameters of the developed aggregation techniques are assigned different values. Finally, we propose an approach to multicriteria decision making on the basis of the proposed aggregation techniques and an example is also given to illustrate our results. © 2011 Wiley Periodicals, Inc.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here