Monotone approximation of aggregation operators using least squares splines
Beliakov, Gleb 2002, Monotone approximation of aggregation operators using least squares splines, International journal of uncertainty, fuzziness, and knowledge-based systems, vol. 10, no. 6, pp. 659-676.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
International journal of uncertainty, fuzziness, and knowledge-based systems
Place of publication
The need for monotone approximation of scattered data often arises in many problems of regression, when the monotonicity is semantically important. One such domain is fuzzy set theory, where membership functions and aggregation operators are order preserving. Least squares polynomial splines provide great flexbility when modeling non-linear functions, but may fail to be monotone. Linear restrictions on spline coefficients provide necessary and sufficient conditions for spline monotonicity. The basis for splines is selected in such a way that these restrictions take an especially simple form. The resulting non-negative least squares problem can be solved by a variety of standard proven techniques. Additional interpolation requirements can also be imposed in the same framework. The method is applied to fuzzy systems, where membership functions and aggregation operators are constructed from empirical data.
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.