Hey Lewis, We didn't use it in the end, but did run the LinkRank on large amounts of data. We then used the scores generated by it for biasing a deduplication algorithm. We tested it thoroughly and never stumbled on issues that could have been resolved using the Loops algorithm.
Markus -----Original message----- > From:Lewis John Mcgibbney <[email protected] > <mailto:[email protected]> > > Sent: Wednesday 10th September 2014 9:51 > To: [email protected] <mailto:[email protected]> > Subject: Revisiting Loops Job in Nutch Trunk > > Hi Folks, > > @Markus especially, during investing this query I bumped into this thread > [0] > > I'm going to make an attempt to clarify documentation for the LinkRank > scoring algirithm in an attemp to make it also more comprehensive. > > First however I want to ask a real bare bones question to guage some > opinions on this one... what is the ultimate effect of skipping the Loops > job within the LinkRank scoring in Nutch? > > Thanks folks > Lewis > > [0] http://www.mail-archive.com/user%40nutch.apache.org/msg05330.html > <http://www.mail-archive.com/user%40nutch.apache.org/msg05330.html> > > -- > *Lewis* >
