Isotonic median regression for orders representable by rooted trees

Nilotpal Chakravarti

Naval Research Logistics (NRL), 1992, vol. 39, issue 5, 599-611

Abstract: The isotonic median regression problem arising in statistics is as follows. We are given m observations falling into n sets, the ith set containing mi observations. The problem requires the determination of n real numbers, the ith being the value “fitted” to each observation in the ith set. These n numbers chosen must satisfy certain (total or partial) order requirements and minimize the distance between the vectors of observed and fitted values in the l1 norm. We present a simple algorithm, of time complexity O(mn), for calculating isotonic median regression for orders representable by rooted trees. We believe that this algorithm is the best currently available for this problem. The algorithm is validated by a linear programming approach which provides additional insight.

Date: 1992
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(199208)39:53.0.CO;2-#

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:39:y:1992:i:5:p:599-611

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().