Original PageRank Flawed, Here Comes The User-sensitive pagerank
January 18th, 2008 | RSS Feed
When the original PageRank algorithm was conceived, it was built around the a mathematical formalization called random walk or RW. Considering a normal surfer to be a random walker, it was assumed that an individual would browse the Internet and randomly visit one of the pages followed by more pages through the hyperlinks on each of the landing pages. When the process ends the visitor would have surfed all the pages. Out of all the pages, the most visited pages would get the highest rank as they are the ones with the maximum number of incoming links.
The problems arises because a normal surfer doesn't follow the random walk formulation, hence the assumptions of the PageRank might not apply to a surfer in the real world.
There has been an intriguing post written by Bill Slawski which highlights, how the assumptions of the PageRank are flawed and how the recent patent for the "User-sensitive pagerank" addresses some of the assumptions of the original PageRank.
The flaws highlighted center around some of the assumptions made by the PageRank.
All the links are created equal: The problem here is that the surfers just don't hit on hyperlinks at random, we read the hyperlink, mentally calculate it's value and then click on it. If this is so the How come all the links are equal?
Bored Surfers Go to Random Pages: True, that we sometimes get bored with a page and move on to another. But, the next page is not chosen at random, rather it's carefully chosen.
Bored Surfers Only Go to Trusted Pages: While it's true that bored surfers don't go to random pages, rather think and then move on, but the page they choose might not necessarily be a trusted one.
Pages Change and Lose Value at Same Rates: The pages can lose value during their lifetime but can they at the same rate. There are a myriad factors governing each pages' popularity and each one changes in value differently.
PageRank Calculations are reliable: This assumption talks about the 'blocked' PageRank," however the the patents application suggests that these aggregations are not perfect.
The User-sensitive pagerank patent application would include various aspects of user behavior to calculate a better PageRank. These aspects pertain to Link Weight; Likelihood of Randomly Leaving to a New Page and Satisfaction with Found Pages.
This patent again underscores the need to design websites which intrigue the visitors to spend a longer time at the website and explore it. However, other aspects such as the usability is important too. There have been many discussions about the PageRank and many people seem to think that there is a need to replace the PageRank with something superior, it seems that we have it already.
Click here to subscribe to our RSS feed to get a daily digest of news around search engine industry. PageTraffic SEO Blog is updated four times a day and is ranked as one of the best search engine resources blog by Pandia!
- del.icio.us
- Digg
- Furl
- Rojo
- StumbleUpon
- Technorati
- Yahoo!
Did you like this article?
Related Posts
Comments
4 Responses to “Original PageRank Flawed, Here Comes The User-sensitive pagerank”
Leave a Reply
Connect with us
SEO Tools
FEATURED CATEGORIES
- adCenter (82)
- AdSense (113)
- AdWords (298)
- Analytics (53)
- AOL (5)
- Ask (101)
- Bing (33)
- Blogging (19)
- Copywriting (1)
- Directory (6)
- Google (1876)
- Industry News (805)
- Keyword Research & Targeting (21)
- Link Building (1)
- Link Popularity (60)
- Live (78)
- Local SEO (7)
- Microsoft (131)
- Mobile Search (13)
- MSN (170)
- PageTraffic Happenings (6)
- Panama (21)
- Pay Per Click (33)
- Reputation Management (1)
- Search Engine Conferences (153)
- Search Engines (95)
- SEO (222)
- SEO Tools (40)
- Social Media (19)
- Tips & Tricks (12)
- Web Marketing (4)
- Yahoo! (565)
- Yahoo! Search Marketing (66)










January 25th, 2008 at 07:57
[...] Fuente: PageTrafficBlog [...]
January 26th, 2008 at 17:43
[...] Fuente: PageTrafficBlog [...]
June 26th, 2009 at 13:39
[...] Comments Share and Enjoy: [...]
June 30th, 2009 at 16:40
[...] Comments [...]