PageRank: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Robert Badgett
No edit summary
mNo edit summary
 
(7 intermediate revisions by 4 users not shown)
Line 1: Line 1:
In [[information retrieval]], '''PageRank''' is algorithm developed by Larry Page and Sergey Brin while at [[Sanford University]].<ref name="isbn1-59184-141-0">{{cite book |author=John Battelle |title=The Search: How Google and Its Rivals Rewrote the Rules of Business and Transformed Our Culture |publisher=Portfolio Trade |location= |year= |pages= |isbn=1-59184-141-0 |oclc= |doi=}}</ref> Brin and Page published their article, "The anatomy of a large-scale hypertextual Web search engine", in 1998.<ref>{{Cite journal | doi = 10.1016/S0169-7552(98)00110-X | issn = 0169-7552 | volume = 30 | issue = 1-7 | pages = 107-117 | last = Brin | first = Sergey | coauthors = Lawrence Page | title = The anatomy of a large-scale hypertextual Web search engine | journal = Computer Networks and ISDN Systems | accessdate = 2008-12-17 | date = 1998-04 | url = http://www.sciencedirect.com/science/article/B6TYT-3WRC342-2N/2/63e7d8fb6a64027a0c15e6ae3e402889}}</ref> Their patent for [[PageRank]] was filed in 1998 and issued in 2001.<ref>Page L. (2001) Method for node ranking in a linked database. [http://patft.uspto.gov/netacgi/nph-Parser?patentnumber=6285999 United States Patent Office] [http://www.google.com/patents?q=patent%3A6285999 Google Patents] {{US patent|6285999}}</ref>
{{subpages}}
In [[information retrieval]], '''PageRank''' is an algorithm developed by Larry Page and Sergey Brin while at [[Stanford University]].<ref name="isbn1-59184-141-0">{{cite book |author=John Battelle |title=The Search: How Google and Its Rivals Rewrote the Rules of Business and Transformed Our Culture |publisher=Portfolio Trade |location= |year= |pages= |isbn=1-59184-141-0 |oclc= |doi=}}</ref>  


PageRank is used by [[Google]].
The value for the PageRank of an [[Internet]] page varies from 0 to 1 on a logarithmic scale<ref name="patent6285999">Page L. (2001) Method for node ranking in a linked database. [http://patft.uspto.gov/netacgi/nph-Parser?patentnumber=6285999 United States Patent Office] [http://www.google.com/patents?q=patent%3A6285999 Google Patents] {{US patent|6285999}}</ref> PageRank is based on links to an Internet page. The links are considered votes. According to Google:<ref name="urlCorporate Information - Technology Overview">{{cite web |url=http://www.google.com/corporate/tech.html |title=Corporate Information - Technology Overview |author=Anonymous  |authorlink= |coauthors= |date= |format= |work= |publisher=Google |pages= |language= |archiveurl= |archivedate= |quote= |accessdate=03/30/2009}}</ref>
:PageRank "considers the importance of each page that casts a vote, as votes from some pages are considered to have greater value, thus giving the linked page greater value"
An alternative is Kleinberg's Hyperlink-Induced Topic Search (HITS).<ref name="Kleinberg1998">Kleinberg J. Authoritative sources in a hyperlinked environment. Paper presented at Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, January 25–27, 1998, San Francisco, CA. Available at http://www.cs.cornell.edu/home/kleinber/auth.ps.</ref><ref name="Kleinberg1999">{{cite journal |last=Kleinberg |first=Jon |authorlink= |coauthors= |year=1999 |month= |title=Authoritative sources in a hyperlinked environment |journal=Journal of the ACM |volume=46 |issue=5 |pages=604–632 |id= |url=http://www.cs.cornell.edu/home/kleinber/auth.pdf |format=PDF|accessdate= |quote= }}</ref>


An alternative is Kleinberg's Hyperlink-Induced Topic Search (HITS).<ref name="Kleinberg1998">Kleinberg J. Authoritative sources in a hyperlinked environment. Paper presented at Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, January 25–27, 1998, San Francisco, CA. Available at http://www.cs.cornell.edu/home/kleinber/auth.ps.</ref><ref name="Kleinberg1999">{{cite journal |last=Kleinberg |first=Jon |authorlink= |coauthors= |year=1999 |month= |title=Authoritative sources in a hyperlinked environment |journal=Journal of the ACM |volume=46 |issue=5 |pages=604–632 |id= |url=http://www.cs.cornell.edu/home/kleinber/auth.pdf |format=PDF|accessdate= |quote= }}</ref>
==History==
Brin and Page published their article, "The anatomy of a large-scale hypertextual Web search engine", in 1998.<ref>{{Cite journal | doi = 10.1016/S0169-7552(98)00110-X | issn = 0169-7552 | volume = 30 | issue = 1-7 | pages = 107-117 | last = Brin | first = Sergey | coauthors = Lawrence Page | title = The anatomy of a large-scale hypertextual Web search engine | journal = Computer Networks and ISDN Systems | accessdate = 2008-12-17 | date = 1998-04 | url = http://www.sciencedirect.com/science/article/B6TYT-3WRC342-2N/2/63e7d8fb6a64027a0c15e6ae3e402889}}</ref> Their patent for PageRank was filed in 1998 and issued in 2001.<ref name="patent6285999">Page L. (2001) Method for node ranking in a linked database. [http://patft.uspto.gov/netacgi/nph-Parser?patentnumber=6285999 United States Patent Office] [http://www.google.com/patents?q=patent%3A6285999 Google Patents] {{US patent|6285999}}</ref>
 
PageRank is used by [[Google]] who owns its [[trademark]] which was filed and published in 2003.<ref>[http://www.uspto.gov United States Patent and Trademark Office] Serial number [http://tess2.uspto.gov/bin/gate.exe?state=4010:5cas1h.4.1&f=toc&a_search=&p_s_ALL=2820024 2820024]</ref>


==References==
==References==
<references/>
<references/>[[Category:Suggestion Bot Tag]]

Latest revision as of 16:00, 30 September 2024

This article is a stub and thus not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
This editable Main Article is under development and subject to a disclaimer.

In information retrieval, PageRank is an algorithm developed by Larry Page and Sergey Brin while at Stanford University.[1]

The value for the PageRank of an Internet page varies from 0 to 1 on a logarithmic scale[2] PageRank is based on links to an Internet page. The links are considered votes. According to Google:[3]

PageRank "considers the importance of each page that casts a vote, as votes from some pages are considered to have greater value, thus giving the linked page greater value"

An alternative is Kleinberg's Hyperlink-Induced Topic Search (HITS).[4][5]

History

Brin and Page published their article, "The anatomy of a large-scale hypertextual Web search engine", in 1998.[6] Their patent for PageRank was filed in 1998 and issued in 2001.[2]

PageRank is used by Google who owns its trademark which was filed and published in 2003.[7]

References

  1. John Battelle. The Search: How Google and Its Rivals Rewrote the Rules of Business and Transformed Our Culture. Portfolio Trade. ISBN 1-59184-141-0. 
  2. 2.0 2.1 Page L. (2001) Method for node ranking in a linked database. United States Patent Office Google Patents U.S. Patent 6,285,999, PDF
  3. Anonymous. Corporate Information - Technology Overview. Google. Retrieved on 03/30/2009.
  4. Kleinberg J. Authoritative sources in a hyperlinked environment. Paper presented at Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, January 25–27, 1998, San Francisco, CA. Available at http://www.cs.cornell.edu/home/kleinber/auth.ps.
  5. Kleinberg, Jon (1999). "Authoritative sources in a hyperlinked environment" (PDF). Journal of the ACM 46 (5): 604–632.
  6. Brin, Sergey; Lawrence Page (1998-04). "The anatomy of a large-scale hypertextual Web search engine". Computer Networks and ISDN Systems 30 (1-7): 107-117. DOI:10.1016/S0169-7552(98)00110-X. ISSN 0169-7552. Retrieved on 2008-12-17. Research Blogging.
  7. United States Patent and Trademark Office Serial number 2820024