{
  "patent_number": "US 12340316",
  "country": "US",
  "title": "How to Build a Smart Knowledge Graph for Specific Topics",
  "original_title": "Techniques for building a knowledge graph in limited knowledge domains",
  "summary": "Oracle's patent describes a method for automatically expanding a small, topic-specific knowledge graph by intelligently pulling relevant information from a much larger knowledge graph, helping applications understand user requests better.",
  "what_it_does": "This patent describes a computer-implemented method for creating a specialized knowledge graph for a particular application. It starts by taking information from a user's own data, like conversations or documents, to build a basic \"seed graph\" of important entities and how they connect (Claim 1). The system then looks for groups of related entities in this seed graph, called \"weakly connected components\" (Claim 1). It maps these entities to a much larger, existing \"reference knowledge graph.\" Using a \"finite state machine,\" it explores the reference graph from these mapped points to find new, potentially relevant entities and connections (Claim 1). A special \"priority function\" then scores these potential additions, considering factors like how many weakly connected components are present and the overall \"graph density\" (Claim 1). The highest-scoring new entities and links are added to the seed graph, making it a more complete \"customized knowledge graph.\" Finally, this expanded graph is used to understand what a user means when they ask a question or give a command, and then provide a suitable answer (Claim 1). For example, if a user dataset is about a specific company's products, the system could expand this with general product knowledge from a large reference graph to better answer customer service questions.",
  "what_it_does_not_cover": [
    "Does not cover building a knowledge graph without first creating a \"seed graph\" from a specific \"user dataset\" (Claim 1).",
    "Does not cover expanding a knowledge graph without using a separate, pre-existing \"reference knowledge graph\" for additional information (Claim 1).",
    "Does not cover traversing the reference knowledge graph without using a \"finite state machine\" to guide the search for new entities (Claim 1).",
    "Does not cover selecting new entities and links without a \"priority function\" that specifically considers the number of \"weakly connected components\" and the \"graph density\" (Claim 1).",
    "Does not cover knowledge graph generation if it is not ultimately used for \"determining a user intent\" and \"providing a response\" to an utterance (Claim 1)."
  ],
  "filed": "2023-03-03",
  "granted": "2025-06-24",
  "expires": "2043-03-03",
  "status": "active",
  "holder": "Oracle International",
  "holder_url": "https://patentbrief.org/company/oracle-international",
  "inventors": [
    {
      "name": "Gautam Singaraju",
      "url": "https://patentbrief.org/inventor/gautam-singaraju"
    },
    {
      "name": "Prithviraj Venkata Ammanabrolu",
      "url": "https://patentbrief.org/inventor/prithviraj-venkata-ammanabrolu"
    }
  ],
  "times_cited": 1,
  "tags": [
    "software",
    "ai_ml",
    "telecommunications",
    "ecommerce",
    "consumer_electronics"
  ],
  "abstract": "Techniques disclosed herein relate generally to constructing a customized knowledge graph. In one embodiment, entities and relations among entities are extracted from a user dataset based on certain rules to generate a seed graph. Large-scale knowledge graphs are then traversed using a finite state machine to identify candidate entities and/or relations to add to the seed graph. A priority function is used to select entities and/or relations from the candidate entities and/or relations. The selected entities and/or relations are then added to the seed graph to generate the customized knowledge graph.",
  "url": "https://patentbrief.org/patent/us/12340316/techniques-for-building-a-knowledge-graph-in-limited-knowledge-domains",
  "markdown_url": "https://patentbrief.org/patent/us/12340316/techniques-for-building-a-knowledge-graph-in-limited-knowledge-domains/md",
  "google_patents_url": "https://patents.google.com/patent/US12340316",
  "relatedPatents": []
}