IDEAS home Printed from https://ideas.repec.org/a/eee/jmvana/v15y1984i2p147-163.html
   My bibliography  Save this article

Almost surely consistent nonparametric regression from recursive partitioning schemes

Author

Listed:
  • Gordon, Louis
  • Olshen, Richard A.

Abstract

Presented here are results on almost sure convergence of estimators of regression functions subject to certain moment restrictions. Two somewhat different notions of almost sure convergence are studied: unconditional and conditional given a training sample. The estimators are local means derived from certain recursive partitioning schemes.

Suggested Citation

  • Gordon, Louis & Olshen, Richard A., 1984. "Almost surely consistent nonparametric regression from recursive partitioning schemes," Journal of Multivariate Analysis, Elsevier, vol. 15(2), pages 147-163, October.
    • Handle: RePEc:eee:jmvana:v:15:y:1984:i:2:p:147-163
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0047-259X(84)90022-8
    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. Bilton, Penny & Jones, Geoff & Ganesh, Siva & Haslett, Steve, 2017. "Classification trees for poverty mapping," Computational Statistics & Data Analysis, Elsevier, vol. 115(C), pages 53-66.
    2. Hua Jin & Ying Lu & Kaite Stone & Dennis M. Black, 2004. "Alternative Tree-Structured Survival Analysis Based on Variance of Survival Time," Medical Decision Making, , vol. 24(6), pages 670-680, November.
    3. Gábor Lugosi & Andrew B. Nobel, 1998. "Adaptive model selection using empirical complexities," Economics Working Papers 323, Department of Economics and Business, Universitat Pompeu Fabra.
    4. Abhinandan Dalal & Patrick Blobaum & Shiva Kasiviswanathan & Aaditya Ramdas, 2024. "Anytime-Valid Inference for Double/Debiased Machine Learning of Causal Parameters," Papers 2408.09598, arXiv.org, revised Sep 2024.
    5. Zhang, Heping, 2004. "Recursive Partitioning and Tree-based Methods," Papers 2004,30, Humboldt University of Berlin, Center for Applied Statistics and Economics (CASE).

    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:jmvana:v:15:y:1984:i:2:p:147-163. 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.