Deakin home > Deakin University Library > Deakin Research Online > Methods of construction of OWA operators from data
Openly accessible

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.

Attached Files (Some files may be inaccessible until you login with your Deakin Research Online credentials)
Name Description MIMEType Size Downloads
beliakov-methodsofconstruction-2001.pdf Published version application/pdf 260.42KB 74

Title Methods of construction of OWA operators from data
Author(s) Beliakov, Gleb
Conference name IEEE International Conference on Fuzzy Systems (10th : 2001 : Melbourne, Australia)
Conference location University fo Melbourne
Conference dates 2-5 December 2001
Title of proceedings 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
Editor(s) Yan, Hong
Publication date 2001
Start page 184
End page 187
Publisher IEEE
Place of publication Melbourne, Vic
Keyword(s) convergence of numerical methods
fuzzy set theory
least squares approximations
optimisation
Summary 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
Notes 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.
ISBN 9780780372931
078037293X
Language eng
Field of Research 010201 Approximation Theory and Asymptotic Methods
HERDC Research category E1 Full written paper - refereed
Copyright notice ©2001, IEEE
Persistent URL http://hdl.handle.net/10536/DRO/DU:30004554

Document type: Conference Paper
Collections: School of Information Technology
Open Access Collection
Connect to link resolver
 
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 drosupport@deakin.edu.au.

Versions
Version Filter Type
Access Statistics: 437 Abstract Views, 74 File Downloads  -  Detailed Statistics
Created: Mon, 07 Jul 2008, 09:38:38 EST