A Data Science Central Community
In my recent article on a new, robust coefficient of correlation and R Squared, I mentioned an algorithm to generate random permutations: Rudimentary algorithm to generate a random permutation (p(0), p(1), ... , p(n-1)) For k=0 to n-1, do: Step 1. Generate p(k) as a random number on {0, ... , n-1} Step 2. Repeat Step 1 until p(k) is different from p(0), p(1), ... , p(k-1) End I also asked what…
© 2019 AnalyticBridge.com is a subsidiary and dedicated channel of Data Science Central LLC Powered by
Badges | Report an Issue | Privacy Policy | Terms of Service
Most Popular Content on DSC
To not miss this type of content in the future, subscribe to our newsletter.
Other popular resources
Archives: 2008-2014 | 2015-2016 | 2017-2019 | Book 1 | Book 2 | More
Most popular articles