.png){kind=icon}
.png){kind=icon}
Return
Hierarchical Estimator
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2011.04.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a new machine learning solution for function approximation is presented. It combines many simple and relatively inaccurate estimators to achieve high accuracy. It creates - in incremental manner - hierarchical, tree-like structure, adapting it to the specific problem being solved. As most variants use the errors of already constructed parts to direct further construction, it may be viewed as example of boosting - as understood in general sense. The influence of particular constituent estimator on the whole solution's output is not constant, but depends on the feature vector being evaluated. Provided in this paper are: general form of the metaalgorithm, a few specific, detailed solutions, theoretical basis and experimental results with one week power load prediction for country-wide power distribution grid and on simple test datasets. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Hierarchical models
Neural networks
Nonlinear regression
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W