Back to Results
First PageMeta Content
Data analysis / Statistical tests / Non-parametric statistics / Resampling / SAS / Permutation / Bootstrapping / Fisher–Yates shuffle / Missing data / Statistics / Statistical inference / Monte Carlo methods


Permutation Tests (and Sampling Without Replacement) Orders of Magnitude Faster Using SAS® John Douglas (“J.D.”) Opdyke,* DataMineIt Abstract Six permutation test algorithms coded in SAS® are compared. The fastest
Add to Reading List

Document Date: 2012-06-05 16:13:14


Open Document

File Size: 206,43 KB

Share Result on Facebook

Company

Dulles Research LLC / Quantitative Strategies / /

/

Facility

Bass Institute / Yale University / Harvard University / /

IndustryTerm

straightforward sequential-sampling-without-replacement algorithms / http /

Organization

Harvard University / Bass Institute / MIT / Yale University / /

Person

John Douglas Opdyke / J.D. Opdyke / Muller / John Douglas / DataMineIt Page / /

Position

author / Managing Director / Fisher / /

Product

ZTE C88 Cellular Phone / /

ProgrammingLanguage

Mathematica / MATLAB / C / /

Technology

straightforward sequential-sampling-without-replacement algorithms / RAM / sequential algorithm / OPDY algorithm / particular SRSWOR algorithm / six algorithms / compare algorithms / memory-intensive algorithm / Opdyke / * DataMineIt Abstract Six permutation test algorithms / 2 GHz Pentium chip / valid SRSWOR algorithm / SRSWOR algorithms / permutation test algorithms / SRSWOR algorithm / ordered hash table algorithm / simulation / OPDN algorithm / same algorithm / six permutation test algorithms / draw-by-draw SRSWOR algorithm / /

URL

www.DataMineIt.com / http /

SocialTag