Secrets of Google ranking


“Building upon the breakthrough work of B. F. Skinner, Page and Brin reasoned that low cost pigeon clusters (PCs) could be used to compute the relative value of web pages faster than human editors or machine-based algorithms. And while Google has dozens of engineers working to improve every aspect of our service on a daily basis, PigeonRank continues to provide the basis for all of our web search tools.

Why Google’s patented PigeonRank™ works so well

PigeonRank’s success relies primarily on the superior trainability of the domestic pigeon (Columba livia) and its unique capacity to recognize objects regardless of spatial orientation. The common gray pigeon can easily distinguish among items displaying only the minutest differences, an ability that enables it to select relevant web sites from among thousands of similar pages.

By collecting flocks of pigeons in dense clusters, Google is able to process search queries at speeds superior to traditional search engines, which typically rely on birds of prey, brooding hens or slow-moving waterfowl to do their relevance rankings.”

This revelation is further expounded here at Google Pigeon Ranking

It’s a demonstration of the fact that you cannot believe everything you read on the web.

I mean, is this Google Job real?

And what about this? anti-bearded men feline research, should I really shave my beard off?

The point is that we cannot always trust what we read on the web, however reliable or authoritative it might seem at first glance. Which is why we should take steps to ensure that our own websites are enhancing, not damaging, our reputations.

Of course this is part of a wider website / online information credibility issue. An issue, that some of you may already know, interests me a lot !

Let me leave you with a true story about the endangered Pacific tree octopus……

Loading Facebook Comments ...

There is 1 comment .

Paul —

The lines blur further, the tree octopus by these guys out there is not alone

Reply »

Share Your Thoughts!

Copyright ©2005-. All Rights Reserved.