Microsoft has revealed details of its new browsing algorithm, developed by a collaborative work between Microsoft researchers and various Asian Universities.
The new browsing algorithm is called BrowseRank and it is meant to compete against Google’s controversial PageRank.
BrowseRank calculates how often and how long users visit the site to determine the rankings; Microsoft believes that will give more control over page relevancy leading to a more democratic Internet
The researchers said
“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,”
This will give more control to web users emphasising the concept of a more democratic rankings systems.
Compared to PageRank the main difference is that BrowseRank uses a continuous-time Markov process while PageRank uses a discrete-time Markov process also know as the Markov Chain.