Name
Abstract | ||
|---|---|---|
The use of supervised learning techniques for fitting weights and/or generator functions of weighted quasi-arithmetic means - a special class of idempotent and nondecreasing aggregation functions - to empirical data has already been considered in a number of papers. Nevertheless, there are still some important issues that have not been discussed in the literature yet. In the first part of this two-part contribution we deal with the concept of regularization, a quite standard technique from machine learning applied so as to increase the fit quality on test and validation data samples. Due to the constraints on the weighting vector, it turns out that quite different methods can be used in the current framework, as compared to regression models. Moreover, it is worth noting that so far fitting weighted quasi-arithmetic means to empirical data has only been performed approximately, via the so-called linearization technique. In this paper we consider exact solutions to such special optimization tasks and indicate cases where linearization leads to much worse solutions. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-40581-0_62 | Communications in Computer and Information Science |
Keywords | Field | DocType |
Aggregation functions,Weighted quasi-arithmetic means,Least squares fitting,Regularization,Linearization | Least squares,Applied mathematics,Mathematical optimization,Weighting,Regression analysis,Supervised learning,Regularization (mathematics),Operator (computer programming),Idempotence,Linearization,Mathematics | Conference |
Volume | ISSN | Citations |
611 | 1865-0929 | 3 |
PageRank | References | Authors |
0.47 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Maciej Bartoszuk | 1 | 17 | 3.62 |
| Gleb Beliakov | 2 | 989 | 78.95 |
| Marek Gagolewski | 3 | 186 | 23.86 |
| Simon James | 4 | 272 | 20.35 |