Methods of construction of OWA operators from data
Beliakov, Gleb 2001, Methods of construction of OWA operators from data, in Meeting the grand challenge : machines that serve people : [proceedings of] the 10th IEEE International Conference on Fuzzy Systems, December 2001, 2-5 December, the University of Melbourne, Australia, IEEE, Melbourne, Vic, pp. 184-187.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
This paper investigates the problem of obtaining the weights of the ordered weighted aggregation (OWA) operators from observations. The problem is formulated as a restricted least squares and uniform approximation problems. We take full advantage of the linearity of the problem. In the former case, a well known technique of non-negative least squares is used. In a case of uniform approximation, we employ a recently developed cutting angle method of global optimisation. Both presented methods give results superior to earlier approaches, and do not require complicated nonlinear constructions. Additional restrictions, such as degree of orness of the operator, can be easily introduced
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
010201 Approximation Theory and Asymptotic Methods
Unless expressly stated otherwise, the copyright for items in Deakin Research Online 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 firstname.lastname@example.org.