Forum Moderators: open
Edited by: JamesR
On another thread, a paper was referenced on the Voting Model for Ranking Web Pages [citeseer.nj.nec.com] It's a good read. Google's model -- the random walk -- is a subset of this Voting Model. I understand that the paper's author, Maxim Lifantsev [cs.sunysb.edu], is contributing to the Google brain power. He's also involved with the GRiD Project [webmasterworld.com], mentioned on another thread here.
Here are some intriguing passages:
In this model we consider nodes (collections of Web pages authored by the same entity) and their connectivity, rather than just individual pages and links between them. In practice the borders of such nodes can be estimated using simple heuristics analyzing the structure of the URL's of the pages...The voting model also allows for very strong search engine persuasion (SEP) protection: the only source of SEP is the votes originating from fake nodes created by the same physical entity. Since the only place where votes are created is when we consider how many nodes we have, it is easy to hunt down SEP attempts because, in order to have noticeable influence, a SEP attempt must have an abnormally high number of fake authors hosted on Web servers with the same or similar IP addresses.
From Tedsters post:
"...hunt down SEP attempts because, in order to have noticeable influence, a SEP attempt must have an abnormally high number of fake authors hosted on Web servers with the same or similar IP addresses"
That would definitely smoke us if they got it right!