Algorithms and error estimations for monotone regression on partially preordered sets (Q2373448)

From MaRDI portal
Revision as of 11:03, 26 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms and error estimations for monotone regression on partially preordered sets
scientific article

    Statements

    Algorithms and error estimations for monotone regression on partially preordered sets (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references