Much Faster Bootstraps Using SAS®

by J.D. Opdyke .

Abstract: Seven bootstrap algorithms coded in SAS® are compared. The fastest (“OPDY”), which uses no modules beyond Base SAS®, achieves speed increases almost two orders of magnitude faster (over 80x faster) than the relevant "built-in” SAS® procedure (Proc SurveySelect). It is even much faster than hashing, but unlike hashing it requires virtually no storage space, and its memory usage efficiency allows it to execute bootstraps on input datasets larger (sometimes by orders of magnitude) than the largest a hash table can use before aborting. This makes OPDY arguably the only truly scalable bootstrap algorithm in SAS®.

Key Words: bootstrap, SAS, scalable, hashing, with replacement, sampling

Author:
J.D. Opdyke, JDOpdyke@DataMineIt.com

Editor: Richard Graf, rgraf@sunstroke.sdsu.edu

READING THE ARTICLE: You can read the article in portable document (.pdf) format (211248 bytes.)

NOTE: The content of this article is the intellectual property of the authors, who retains all rights to future publication.

This page has been accessed 2881 times since OCTOBER 18, 2010.


Return to the InterStat Home Page.