On Sat, Apr 6, 2013 at 3:26 PM, Pat Ferrel <p...@occamsmachete.com> wrote:
> I guess I don't understand this issue. > > In my case both the item ids and user ids of the separate DistributedRow > Matrix will match and I know the size for the entire space from a previous > step where I create id maps. I suppose you are saying the the m/r code > would be super simple if a row of B' and a column of A could be processed > together, which I understand as an optimal implementation. > Well.... rows of B and A should match so columns of B' and rows of A rather than the reverse. > So calculating [B'A] seems like TransposeJob and MultiplyJob and does seem > to work. You loose the ability to substutute different RowSimilarityJob > measures. I assume this creates something like the co-occurrence similairty > measure. But oh, well. Maybe I'll look at that later. > Yes. Exactly. > I also see why you say the two matrices A and B don't have to have the > same size since [B'A]H_v = [B'A]A' so the dimensions will work out as long > as the users dimension is the same throughout. > Yes. All we need is user id match.
