A finite algorithm for monotone regression and the application of its principle to the aggregation of ranks and indifference curve fitting (Q1094045)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A finite algorithm for monotone regression and the application of its principle to the aggregation of ranks and indifference curve fitting |
scientific article |
Statements
A finite algorithm for monotone regression and the application of its principle to the aggregation of ranks and indifference curve fitting (English)
0 references
1989
0 references
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.
0 references
indifference curve fitting
0 references
monotone regression
0 references
adjusted value assignments
0 references
ordinal dependent data
0 references
multiattribute value
0 references
Kruskal stress criterion
0 references
iterative computational methodology
0 references
convex quadratic programming
0 references
aggregation of ranks
0 references
minimax data fitting criterion
0 references
MAV estimation
0 references
conjoint analysis
0 references