A finite algorithm for monotone regression and the application of its principle to the aggregation of ranks and indifference curve fitting

From MaRDI portal
Publication:1094045





Monotone regression makes optimal consistent adjusted value assignments to ordinal dependent data, or monotonically adjusts ratio level dependent variable data to achieve the best possible agreement with an explanatory linear (in the sense of parameters) model. Thus, for example, as a tool for building group or individual multiattribute value (MAV) functions, it partially obviates the need to prespecify a particular MAV function class. The height of the unknown MAV function at each comparison bundle is determined along with the other model parameters. In this paper, the Kruskal stress criterion and iterative computational methodology are shown to be reducible to one of three simpler convex quadratic programming problems. The fundamental idea underlying the method is not restricted to least squares objectives. An application to the problem of aggregation of ranks is shown. Here, the minimax data fitting criterion is employed.





Describes a project that uses

Uses Software






This page was built for publication: A finite algorithm for monotone regression and the application of its principle to the aggregation of ranks and indifference curve fitting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1094045)