Mathematics – Statistics Theory
Scientific paper
2007-08-02
Annals of Statistics 2007, Vol. 35, No. 1, 1-12
Mathematics
Statistics Theory
Published at http://dx.doi.org/10.1214/009053606000001000 in the Annals of Statistics (http://www.imstat.org/aos/) by the Inst
Scientific paper
10.1214/009053606000001000
This paper provides answers to questions regarding the almost sure limiting behavior of rooted, binary tree-structured rules for regression. Examples show that questions raised by Gordon and Olshen in 1984 have negative answers. For these examples of regression functions and sequences of their associated binary tree-structured approximations, for all regression functions except those in a set of the first category, almost sure consistency fails dramatically on events of full probability. One consequence is that almost sure consistency of binary tree-structured rules such as CART requires conditions beyond requiring that (1) the regression function be in ${\mathcal {L}}^1$, (2) partitions of a Euclidean feature space be into polytopes with sides parallel to coordinate axes, (3) the mesh of the partitions becomes arbitrarily fine almost surely and (4) the empirical learning sample content of each polytope be ``large enough.'' The material in this paper includes the solution to a problem raised by Dudley in discussions. The main results have a corollary regarding the lack of almost sure consistency of certain Bayes-risk consistent rules for classification.
No associations
LandOfFree
Tree-structured regression and the differentiation of integrals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Tree-structured regression and the differentiation of integrals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tree-structured regression and the differentiation of integrals will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-245303