Related Experiment Videos
N-tuple network, CART and bagging
1Electrical and Computer Engineering Department, University of Colorado at Colorado Springs, Colorado Springs, CO 80918, USA.
Abstract:
Similarities between bootstrap aggregation (bagging) and N-tuple sampling are explored to propose a retina-free data-driven version of the N-tuple network, whose close analogies to aggregated regression trees, such as classification and regression trees (CART), lead to further architectural enhancements. Performance of the proposed algorithms is compared with the traditional versions of the N-tuple and CART networks on a number of regression problems. The architecture significantly outperforms conventional N-tuple networks while leading to more compact solutions and avoiding certain implementational pitfalls of the latter.
Related Concept Videos
Residual Plots
When the residual values are plotted against the variable x, it is called a residual...
Scatter Plot
End Point Prediction: Gran Plot
For potentiometric titration, the Gran plot is created by plotting the...
Probability Histograms
Bode Plots
A network function represents the ratio of a system's output to its input, with the magnitude and phase angle derived from the complex network function. The decibel logarithmic gain is...
Plotting of Topographic Maps