[
https://issues.apache.org/jira/browse/MAHOUT-753?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=13069447#comment-13069447
]
Lance Norskog commented on MAHOUT-753:
--------------------------------------
Thanks! It turns out the generator method for java.lang.Random receives a
request for N random bits, and it masks a generated int to give the requested
number of random bits (starting from position 0).
[http://www.javamex.com/tutorials/random_numbers/java_util_random_subclassing.shtml]
Quote from the net: "MurmurHash is good if fed by a linear congruent generator,
but not by directly refeeding the seed. But it is very fast for random access."
Meaning, for continuous setSeed() uses like deterministically projecting
matrices, it is a good choice.
> MurmurHashRandom class: subclass of java.util.Random that uses MurmurHash
> -------------------------------------------------------------------------
>
> Key: MAHOUT-753
> URL: https://issues.apache.org/jira/browse/MAHOUT-753
> Project: Mahout
> Issue Type: New Feature
> Components: Math
> Reporter: Lance Norskog
> Assignee: Sean Owen
> Priority: Minor
> Attachments: MurmurBench.java, MurmurHashRandom.java
>
>
--
This message is automatically generated by JIRA.
For more information on JIRA, see: http://www.atlassian.com/software/jira
