An Ensemble Method for Combining Subset-Specific Algorithm Fits

The Subsemble algorithm is a general subset ensemble prediction method, which can be used for small, moderate, or large datasets. Subsemble partitions the full dataset into subsets of observations, fits a specified underlying algorithm on each subset, and uses a unique form of k-fold cross-validation to output a prediction function that combines the subset-specific fits. An oracle result provides a theoretical performance guarantee for Subsemble. The paper, "Subsemble: An ensemble method for combining subset-specific algorithm fits" is authored by Stephanie Sapp, Mark J. van der Laan & John Canny (2014) .


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.

install.packages("subsemble")

0.1.0 by Erin LeDell, 5 years ago


https://github.com/ledell/subsemble


Report a bug at https://github.com/ledell/subsemble/issues


Browse source code at https://github.com/cran/subsemble


Authors: Erin LeDell [cre] , Stephanie Sapp [aut] , Mark van der Laan [aut]


Documentation:   PDF Manual  


Apache License (== 2.0) license


Depends on SuperLearner

Suggests arm, caret, class, cvAUC, e1071, earth, gam, gbm, glmnet, Hmisc, ipred, lattice, LogicReg, MASS, mda, mlbench, nnet, parallel, party, polspline, quadprog, randomForest, rpart, SIS, spls, stepPlr


See at CRAN