LANGREITER.COM plain, simple | |||||||
![]() ![]() | |||||||
Steve Kirsch interviews his former employee Matt Wells, now of Gigablast: "I'm hoping to build Gigablast up to 5 billion pages this year. My income level should allow me to do that if I invest everything in hardware and bandwidth. It will still be a modest number of machines, too, not a whole lot more than the eight I have now." "Hey, it was the thing to do at the time." ![]() I played a bit with PageRank at the beginning of last week, triggered by Peter Bengtsson's Python implementation. In its pure form, the algorithm is amazingly simple (compacted from Peter's version): def pageRank( web, p = 0.85, i = 100 ):The K version is even simpler and should scale much better (as the link structure isn't represented as n-by-n matrix but as a nested list of outlinks). Testing it with graphs of interesting dimensions is left as an exercise for the reader (or next weekend), though: O:(,1;,2;,1;,1;1 3)V is the inverse count of outlinks per node multiplied with the damping factor p (i.e. the "link value"), I:.[n#,!0;,O;,;!n] transforms outlinks to inlinks, S:i{q+/'x[I]*V[I]}/n#1 does all the work, the rest is set-up. In case you haven't noticed, K rocks (and Python with numarray and matplotlib is fairly nice too). ![]() ![]() |
![]() ![]() ![]() So log in, fella — or finally get your langreiter.com account. You always wanted one. Nearby in the temporal dimension: Nobody. ... and 14 of the anonymous kind. Click on ![]() THIS DAY IN HISTORY 2008 / 2007 / 2006 / 2005 / 2004 / 2003 / 2002 BACKLINKS none RECENT EDITS (MORE) ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() POWERED BY ![]() &c. GeoURL RSS 0.92 FRIENDLY SHOPS Uncut Games bei Gameware OFFEN! Offenlegung gem. §25 MedienG: Christian Langreiter, Langkampfen See also: Privacy policy. |