Algorithms and error estimations for monotone regression on partially preordered sets (Q2373448)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithms and error estimations for monotone regression on partially preordered sets |
scientific article; zbMATH DE number 5170508
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and error estimations for monotone regression on partially preordered sets |
scientific article; zbMATH DE number 5170508 |
Statements
Algorithms and error estimations for monotone regression on partially preordered sets (English)
0 references
11 July 2007
0 references
Monotone (or isotopic) regression is used in many fields, including data analysis (multidimensional scaling, describing ordinal data by cardinal methods, etc.), archaeology, and isotonic likelihood estimation. In many cases, the monotonicity is only defined for a partial instead of a total preorder. No efficient algorithm is known which solves the general problem in a finite number of steps. In this paper, some error estimations are given for an approximate solution of the optimum. In addition, some results concerning monotone regression and the treatment of missing values are presented.
0 references
isotonic regression
0 references
projection
0 references
partial order
0 references
least squares solution
0 references
0 references
0.801050066947937
0 references
0.7864064574241638
0 references
0.7757012248039246
0 references
0.7750680446624756
0 references