Hi, My sincere apologies if this is a naïve question (I'm sure it is).
I've engaged a programmer to take an weblog and focus on 250 pages containing items that may be similar (or not). The goal is create item-item relationship tables where every cell contains a score for how similar two items are. He now tells me that only two of the (many) Mahout algorithms can be used to generate such tables, and those that do generate a distance of 1 or some other constant value between all pairs. This can't be true, can it? There must be a way to tease out such information from the algorithms. Any advice? Any ideas why all relationships would be one? While it is common for the website users to have visited only one page at a time, it is not pervasive. Best, Kai Larsen
