On Sun, Apr 11, 2010 at 6:49 AM, Ted Dunning <ted.dunn...@gmail.com> wrote:
> I am working out the details of a fully scalable MR implementation of the > stochastic decomposition and would appreciate some reviews. > > See https://issues.apache.org/jira/browse/MAHOUT-376 for details. > The first step feels a little different from our previous discussion. I remember asking questions like how we get the Q and you seem to have implied we just take AOmega instead of orthonormalizing it (i was wondering where that step would go). For reference, i am attaching summary of our previous discussion which i took liberty of slightly reworking. ( i wanted to test it out using Pig but still did not quite manage to squeeze it into my schedule). Could you please elaborate on qr() proceduer there? If you mean QR decompostion, then Q is commonly thought of as a result of Gramm-Schmidt procedure which is iterative (and hence kinda tough to do without considering other rows of AOmega)
