Efficient allocation of random numbers(U(0,1)) into categories

Question

DoVile Last Name: 2012-9-29

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/49432-efficient-allocation-of-random-numbers-u-0-1-into-categories

I am trying to create a function which takes two arguments as input, one a vector of values drawn from a uniform distribution and the other input a number of values between 0 ad 1. It should then index the values from the first input with a number corresponding to its category in the second input.

For example Input1 = [0.2 0.5 0.90 0.995] input2 = [0 0.81 0.99 1] Output = [0 0 1 2]

At present i am using a double for loop with an if statement

    for i=1:length(randoms)
    for r = 1:(length(ShockProbabilities)-1)
       if  randoms(i) >= (ShockProbabilities(r)) && randoms(i) < (ShockProbabilities(r+1));  randoms(i)=(r-1); end 
    end
end

Could any one suggest how i might speed this up ? i am sure there is a way and i dont like using 2 for loops and an if statement. I am just curious, i dont really need it as such

Thanks :)

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

请先登录，再回答此问题。

Answer 1

Matt Fig 2012-9-29

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/49432-efficient-allocation-of-random-numbers-u-0-1-into-categories#answer_60395

编辑：Matt Fig 2012-9-29

How about the HISTC function?

Also, in your code there is no reference to either input1 or input2, so I cannot run it...

3 个评论
显示 1更早的评论隐藏 1更早的评论

Matt Fig 2012-9-29

编辑：Matt Fig 2012-9-29

在 MATLAB Online 中打开

Try this:

[J,K] = histc(randoms,ShockProbabilities);
K = K-1

By the way, to make your code faster you could put a break after the randoms(i) reassignment since it is presumed that only one fit will be found per element. As it is you continue to check even after you find where randoms(i) goes! You could also only run the inner loop from the last r found to the end-1 because randoms is sorted. These two hints would speed things up considerably for large arrays. Still, I doubt you will beat HISTC.

DoVile Last Name: 2012-9-29

Great i got it working, and the break tip was a real eye opener for me! in the actual program i will be using quasirandom numbers instead of the ones from the example so they wont be sorted, also i kind of want a more robust function.

Thanks Matt :)

请先登录，再进行评论。