An Analytic Approach for Obtaining Maximal Entropy Owa Operator Weights

One important issue in the theory of ordered weighted averaging (OWA) operators is the determination of the associated weights. One of the first approaches, suggested by O'Hagan, determines a special class of OWA operators having maximal entropy of the OWA weights for a given level of orness; algorithmically it is based on the solution of a constrained optimization problem. In this paper, using the method of Lagrange multipliers, we shall solve this constrained optimization problem analytically and derive a polynomial equation which is then solved to determine the optimal weighting vector.

[1]  M. O'Hagan,et al.  Aggregating Template Or Rule Antecedents In Real-time Expert Systems With Fuzzy Set Logic , 1988, Twenty-Second Asilomar Conference on Signals, Systems and Computers.

[2]  Dimitar Filev,et al.  Induced ordered weighted averaging operators , 1999, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Xinwang Liu,et al.  The equivalence of maximum entropy OWA operator and geometric OWA operator , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).

[4]  Gleb Beliakov,et al.  How to build aggregation operators from data , 2003, Int. J. Intell. Syst..

[5]  Dimitar Filev,et al.  On the issue of obtaining OWA operator weights , 1998, Fuzzy Sets Syst..

[6]  R. Yager.  Families of OWA operators , 1993 .

[7]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decision-making , 1988 .

[8]  Ronald R. Yager,et al.  On ordered weighted averaging aggregation operators in multicriteria decisionmaking , 1988, IEEE Trans. Syst. Man Cybern..