Efficient computation of an isotonic median regression

P. M. Pardalos; G. L. Xue; L. Yong

doi:10.1016/0893-9659(95)00013-G

Efficient computation of an isotonic median regression

P. M. Pardalos, G. L. Xue, L. Yong

Research output: Contribution to journal › Article › peer-review

14 Scopus citations

Abstract

The isotonic median regression problem arises from statistics. An algorithm, the PAV algorithm, has been proposed for solving this problem since 1980. In this paper, we propose two kinds of data structures for efficiently implementing the PAV algorithm. The running time of the algorithm is also improved.

Original language	English (US)
Pages (from-to)	67-70
Number of pages	4
Journal	Applied Mathematics Letters
Volume	8
Issue number	2
DOIs	https://doi.org/10.1016/0893-9659(95)00013-G
State	Published - Mar 1995
Externally published	Yes

Keywords

Balanced search tree
Median
Merging
Running time

ASJC Scopus subject areas

Applied Mathematics

Access to Document

10.1016/0893-9659(95)00013-G

Cite this

@article{4aeb9e233e4447e499902ab6d0304961,

title = "Efficient computation of an isotonic median regression",

abstract = "The isotonic median regression problem arises from statistics. An algorithm, the PAV algorithm, has been proposed for solving this problem since 1980. In this paper, we propose two kinds of data structures for efficiently implementing the PAV algorithm. The running time of the algorithm is also improved.",

keywords = "Balanced search tree, Median, Merging, Running time",

author = "Pardalos, {P. M.} and Xue, {G. L.} and L. Yong",

year = "1995",

month = mar,

doi = "10.1016/0893-9659(95)00013-G",

language = "English (US)",

volume = "8",

pages = "67--70",

journal = "Applied Mathematics Letters",

issn = "0893-9659",

publisher = "Elsevier Limited",

number = "2",

}

TY - JOUR

T1 - Efficient computation of an isotonic median regression

AU - Pardalos, P. M.

AU - Xue, G. L.

AU - Yong, L.

PY - 1995/3

Y1 - 1995/3

N2 - The isotonic median regression problem arises from statistics. An algorithm, the PAV algorithm, has been proposed for solving this problem since 1980. In this paper, we propose two kinds of data structures for efficiently implementing the PAV algorithm. The running time of the algorithm is also improved.

AB - The isotonic median regression problem arises from statistics. An algorithm, the PAV algorithm, has been proposed for solving this problem since 1980. In this paper, we propose two kinds of data structures for efficiently implementing the PAV algorithm. The running time of the algorithm is also improved.

KW - Balanced search tree

KW - Median

KW - Merging

KW - Running time

UR - http://www.scopus.com/inward/record.url?scp=0007390325&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0007390325&partnerID=8YFLogxK

U2 - 10.1016/0893-9659(95)00013-G

DO - 10.1016/0893-9659(95)00013-G

M3 - Article

AN - SCOPUS:0007390325

SN - 0893-9659

VL - 8

SP - 67

EP - 70

JO - Applied Mathematics Letters

JF - Applied Mathematics Letters

IS - 2

ER -

Efficient computation of an isotonic median regression

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this