{
  "patent_number": "US 6285999",
  "country": "US",
  "title": "How Websites Get Ranked by Importance",
  "original_title": "Method for node ranking in a linked database",
  "summary": "This patent describes a computer method for scoring documents in a linked database, like the internet, by considering the importance of other documents that link to them, helping search engines find better results.",
  "what_it_does": "This patent outlines a computer method for assigning an \"importance score\" to documents within a network, such as web pages (Claim 1). It works by first obtaining a collection of documents where some link to others. Then, it calculates a score for each linked document based on the scores of all the other documents that point to it (Claim 1). For example, if a highly-scored website links to your blog post, your blog post's score would increase. The patent also describes various ways to adjust these scores, such as considering how many links a linking document has (Claim 2) or even how likely a user is to access that linking document (Claim 3). This process helps in organizing and presenting documents based on their calculated importance.",
  "what_it_does_not_cover": [
    "Does not cover ranking documents solely based on the words they contain, without considering incoming links.",
    "Does not cover ranking documents where the score is not influenced by the scores of other documents linking to it.",
    "Does not cover ranking systems that only count the number of links to a document, without adjusting for the importance of the linking document itself.",
    "Does not cover ranking based purely on user behavior metrics like clicks, unless those metrics are used to adjust the linking document's weighting factor (Claim 7).",
    "Does not cover ranking where a \"random traversal\" (Claim 10) does not assign rank based on how many times a document has been traversed."
  ],
  "filed": "1998-01-09",
  "granted": "2001-09-04",
  "expires": "2018-01-09",
  "status": "expired",
  "holder": "Leland Stanford Junior University",
  "holder_url": "https://patentbrief.org/company/leland-stanford-junior-university",
  "inventors": [
    {
      "name": "Lawrence Page",
      "url": "https://patentbrief.org/inventor/lawrence-page"
    }
  ],
  "times_cited": 818,
  "tags": [
    "software",
    "telecommunications",
    "ai_ml",
    "ecommerce",
    "consumer_electronics"
  ],
  "abstract": "A method assigns importance ranks to nodes in a linked database, such as any database of documents containing citations, the world wide web or any other hypermedia database. The rank assigned to a document is calculated from the ranks of documents citing it. In addition, the rank of a document is calculated from a constant representing the probability that a browser through the database will randomly jump to the document. The method is particularly useful in enhancing the performance of search engine results for hypermedia databases, such as the world wide web, whose documents have a large variation in quality.",
  "url": "https://patentbrief.org/patent/us/6285999/google-pagerank",
  "markdown_url": "https://patentbrief.org/patent/us/6285999/google-pagerank/md",
  "google_patents_url": "https://patents.google.com/patent/US6285999",
  "relatedPatents": [
    {
      "patentNumber": "8615514",
      "countryCode": "US",
      "title": "How Google Uses User Feedback to Rank Websites by Quality",
      "url": "https://patentbrief.org/patent/us/8615514/evaluating-website-properties-by-partitioning-user-feedback"
    },
    {
      "patentNumber": "6370526",
      "countryCode": "US",
      "title": "Smart Ranking of Emails and Files Based on How You Click",
      "url": "https://patentbrief.org/patent/us/6370526/google-adwords-pay-per-click"
    },
    {
      "patentNumber": "8311950",
      "countryCode": "US",
      "title": "Predicting User Interests Based on Who Looks at Whose Profile",
      "url": "https://patentbrief.org/patent/us/8311950/detecting-content-on-a-social-network-using-browsing-patterns"
    },
    {
      "patentNumber": "9361579",
      "countryCode": "US",
      "title": "How Computers Calculate Probabilities in Large Knowledge Bases",
      "url": "https://patentbrief.org/patent/us/9361579/large-scale-probabilistic-ontology-reasoning"
    },
    {
      "patentNumber": "7233978",
      "countryCode": "US",
      "title": "How Distributed Servers Find Data Using Location Pointers",
      "url": "https://patentbrief.org/patent/us/7233978/method-and-apparatus-for-managing-location-information-in-a-network-separate-from-the-data-to-which-the-location-information-pertains"
    }
  ]
}