This approach is really three approaches put together. Elements of two of the approaches exist in the project -- recommendations based on co-occurrence, and based on clustering (though not MinHash). I don't believe there's much proper LSI in the project at the moment?
I would steer you towards looking at implementing the pieces of this, which are more useful and reusable. Implementing this whole thing is quite a large project. On Wed, Apr 13, 2011 at 8:19 AM, ke xie <[email protected]> wrote: > Dear all: > > I've read a paper from google, which is about their news recommender > system. > They implemented a LSH algorithm to find the closest neibourhoods and the > algorithm is fast for that. > > Can we implement one and contribute into the mahout project? Any > suggestions? > > paper is here: > http://iws.seu.edu.cn/resource/Proceedings/WWW/2007/papers/paper570.pdf > > > Cheers > > > -- > Name: Ke Xie Eddy > Research Group of Information Retrieval > State Key Laboratory of Intelligent Technology and Systems > Tsinghua University >
