IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v15y1992i1p31-35.html
   My bibliography  Save this article

Minimum lower sets algorithms for isotonic regression

Author

Listed:
  • Qian, Shixian

Abstract

We find that in the minimum lower sets algorithm, the largest minimum lower sets can be replaced by any minimum lower sets. We give a new minimum lower sets algorithm for set functions satisfying the Cauchy mean value property, which selects minimal minimum lower sets instead of the largest ones, then pools adjacent level sets when they are not in order.

Suggested Citation

  • Qian, Shixian, 1992. "Minimum lower sets algorithms for isotonic regression," Statistics & Probability Letters, Elsevier, vol. 15(1), pages 31-35, September.
    • Handle: RePEc:eee:stapro:v:15:y:1992:i:1:p:31-35
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0167-7152(92)90281-9
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wojciech Gamrot, 2013. "Maximum likelihood estimation for ordered expectations of correlated binary variables," Statistical Papers, Springer, vol. 54(3), pages 727-739, August.
    2. Park, Chul Gyu, 1998. "Least squares estimation of two functions under order restriction in isotonicity," Statistics & Probability Letters, Elsevier, vol. 37(1), pages 97-100, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:15:y:1992:i:1:p:31-35. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.