↳
Sorting the strings is not optimal because each sort is O(N log N) where N is the number of characters in each word. A more optimal solution is to create a function to encode each word as a hash table of character frequencies, which is O(N) for each word. Less
↳
sort the strings and compare
↳
Use collaborate filtering to compare personal preference with others. If A and B are similar, we can recommend preferred items in B to A. Less
↳
Why downvote on other answer? He/she is right. Collaborative filtering is the most common strategy for recommendation systems. You see user A buys these things and user B also bought those things but user B bought this other thing too so let's show that thing to User A. Less
↳
Remove screen and look at the unbiased data.
↳
Yes, remove prescreen and look the unbiased sample. IF the unbiased sample becomes too big, then just randomly choose 1/2, or small, for the purpose of representation of fraud events. Less
↳
I'm hard working, great team player, reliable, quick learner etc etc
↳
cuz i got a 10inch and great performer in front of the camera - porn industry
↳
I think you mean Normal distribution! If you are using R use set.seed(). You can then use rnorm() with size, mean & SD. e.g. >set.seed(123) >rnorm(100, 2, 5) Less
↳
I'm the original poster, sorry for my typo. I actually mean multinomial distribution. And the advanced question was, if the probability is a skewed distribution, how would you speed up your algorithm. You can find both answer from Wikipedia. :) Less
↳
Provided examples from my education and work.