.
PageRank

The name PageRank is a trademark of Google. The PageRank process has been patented (U.S. Patent 6,285,999 ). The patent is not assigned to Google but to Stanford University. PageRank is a link analysis algorithm which assigns a numerical weighting to each element of a hyperlinked set of documents, such as the World Wide Web, with the purpose of "measuring" its relative importance within the set.

The algorithm may be applied to any collection of entities with reciprocal quotations and references. The numerical weight that it assigns to any given element E is also called the PageRank of E and denoted by PR(E).

PageRank was developed at Stanford University by Larry Page (hence the name Page-Rank[1]) and Sergey Brin as part of a research project about a new kind of search engine. The project started in 1995 and led to a functional prototype, named Google, in 1998. Shortly after, Page and Brin founded Google Inc., the company behind the Google search engine. While just one of many factors which determine the ranking of Google search results, PageRank continues to provide the basis for all of Google's web search tools.



Google describes PageRank:
�PageRank relies on the uniquely democratic nature of the web by using its vast link structure as an indicator of an individual page's value. In essence, Google interprets a link from page A to page B as a vote, by page A, for page B. But, Google looks at more than the sheer volume of votes, or links a page receives; it also analyzes the page that casts the vote. Votes cast by pages that are themselves "important" weigh more heavily and help to make other pages "important".� 

Numerous academic papers concerning PageRank have been published since Page and Brin's original paper. In practice, the PageRank concept has proven to be vulnerable to manipulation, and extensive research has been devoted to identifying falsely inflated PageRank and ways to ignore links from documents with falsely inflated PageRank.

In other words, a PageRank results from a "ballot" among all the other pages on the World Wide Web about how important a page is. A hyperlink to a page counts as a vote of support. The PageRank of a page is defined recursively and depends on the number and PageRank metric of all pages that link to it ("incoming links"). A page that is linked to by many pages with high PageRank receives a high rank itself. If there are no links to a web page there is no support for that page.


Alternatives to the PageRank algorithm are the HITS algorithm proposed by Jon Kleinberg and the IBM CLEVER project.
 

( back to top )
LEAR Web Design | LEAR Corporation | How LEAR Corp Works | Welcome To My Site | Learn PHP
South Florida Web Design | Broward Web Design | Miami-Dade Web Design | Palm Beach Web Design
Coral Springs Web Design | Deerfield Beach Web Design | Fort Lauderdale Web Design | Hollywood Web Design | Pompano Beach Web Design | Weston Web Design
Boca Raton Web Design | Boynton Beach Web Design | Delray Beach Web Design | Lantana Web Design | West Palm Beach Web Design
Aventura Web Design | Bal Harbour Web Design | North Miami Beach Web Design | North Miami Web Design | Miami Web Design | South Beach Miami Web Design
Atlanta | Boston Web Design | New York Web Design | Philadelphia Web Design | Pittsburgh
Los Angeles | San Diego | San Francisco | Sacramento | San Jose | Santa Clara | Mountain View | Sunnyvale
Appleton | Eau Claire | Green Bay | Milwaukee | Sturgeon Bay | Wausau | Denver

Copyright © 2003-2007 LEAR Web Design.
A South Florida Web Design Firm | SEO Consultant