Interesting. So we're creating the item-item matrix using one of the Mahout algorithms (like Taste?), then dumping it into Lucene. I don't have any experience with the item-item matrix part so working on an example will help me understand it better. Showing the Lucene part may help others who work along these lines.
On Fri, Jul 10, 2009 at 12:57 PM, Ted Dunning <[email protected]> wrote: > Don't think so. Sean should comment definitively. > > It is actually very easy to do. The output of the recommendation off-line > process (in my case, statistical filtering of the coocurrence matrix, in > other cases something different) is generally a sparse matrix of item-item > links. Each line of this sparse matrix can be considered a document in > creating a Lucene index. You will have to use a correct analyzer and a > line > by line document segmenter, but that is trivial. > > Then recommendation is a simple query step. > > You guys at Linked-in have nice ability to present Lucene results in > real-time so the part after gettting the item-item matrix should be dead > simple for you. > > On Fri, Jul 10, 2009 at 12:48 PM, Jason Rutherglen < > [email protected]> wrote: > > > Is there an example of this (using Lucene to store item-item links in > > Lucene) in Mahout? Sounds interesting. > > > > On Fri, Jul 10, 2009 at 11:35 AM, Ted Dunning <[email protected]> > > wrote: > > > > > Storing the item-item links in Lucene and forming a query with recent > > > history is a pretty easy way to get real-time recommendations. This > can > > > also get rid of the cache because standard measures applied to make > > Lucene > > > fast will work on this. > > > > > >
