Premium
Bin smoother
Author(s) -
Klemelä Jussi
Publication year - 2012
Publication title -
wiley interdisciplinary reviews: computational statistics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.693
H-Index - 38
eISSN - 1939-0068
pISSN - 1939-5108
DOI - 10.1002/wics.1214
Subject(s) - mathematics , bin , estimator , partition (number theory) , piecewise , rate of convergence , exploratory data analysis , statistics , algorithm , computer science , combinatorics , channel (broadcasting) , mathematical analysis , computer network
Bin smoothers, or regressograms, are piecewise constant regression function estimators whose values are averages of the response variable over the sets of a partition of the space of the explanatory variables. First, we review results about bin smoothers whose partition is regular, giving conditions for consistency and for achieving the optimal rate of convergence. Second, we review representative results about bin smoothers whose partition is irregular, again giving conditions for consistency and for achieving the optimal rate of convergence. Third, we give an exposition of recursive partitioning, main examples being greedy partitions and the classification and regression tress (CART) methodology. WIREs Comput Stat 2012 doi: 10.1002/wics.1214 This article is categorized under: Statistical Learning and Exploratory Methods of the Data Sciences > Classification and Regression Trees (CART) Statistical and Graphical Methods of Data Analysis > Density Estimation Statistical and Graphical Methods of Data Analysis > Nonparametric Methods