Microsoft's Answer To Google's PageRank Algorithm: Less Privacy

[e21media]

Microsoft researchers have published a paper describing a new method for determining which Web pages are the most relevant for a given keyword search query.

The academic paper, "BrowseRank: Letting Web Users Vote for Page Importance," was co-authored by Microsoft researchers Bin Gao, Tie-Yan Liu, and Hang Li; Zhiming Ma of the Chinese Academy of Sciences; Yuting Liu from Beijing Jiaotong University; Shuyuan He from Peking University; and Nankai University's Ying Zhang.

PageRank treats Web links as votes for relevance. The paper's authors say PageRank can generate inaccurate results "because links can be easily added and deleted by Web content creators."

BrowseRank, Microsoft claims, can deliver better search results by measuring user behavior: the Web pages Internet users visit and the amount of time they remain at those pages.

"The more visits of the page made by the users and the longer time periods spent by the users on the page, the more likely the page is important," the paper states. "With this graph, we can leverage hundreds of millions of users' implicit voting on page importance."

Seems like they may have a point though. The end of link doping for some then?












[/QUOTE][/QUOTE]

[demented]

Browserank.net for sale

[gford]

Here is an updated article on it:

http://news.cnet.com/8301-1023_3-9999038-93.html

[llank]

But the problem with voting is that it can be forged. Whichever direction we go with search results people will always try find a loophole.

[scubita]

Originally Posted by llank

But the problem with voting is that it can be forged. Whichever direction we go with search results people will always try find a loophole.

Agree. It's going to be a cat and mouse game all the time