Journal
INTERNATIONAL JOURNAL OF APPROXIMATE REASONING
Volume 45, Issue 1, Pages 68-81Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ijar.2006.06.004
Keywords
OWA operator; minimum variance; minimax disparity
Categories
Ask authors/readers for more resources
The aim of this paper is to answer the open question of Wang and Parkan (Information Sciences 175 (2005), 20-29) that the solutions of maximum entropy OWA operator problem under given orness level and the minimax disparity OWA operator problem under given orness level are equivalent. They both have the: same equidifferent form, which composes a weighting vector of nonnegative arithmetic progression and zeros. This equidifferent OWA weighting vector generating method can also be seen as an improved solution method for the minimum variance and minimax dispersion problems respectively. (c) 2006 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available