Related Entity Search
First Claim
Patent Images
1. A method comprising:
- obtaining, using one or more computers, a plurality of search results identifying entities from a knowledge graph, wherein at least one search result of the plurality of search results is associated with an entity in the knowledge graph;
identifying, using one or more computers, one or more related entities from the knowledge graph, wherein each related entity is related to at least one of the entities associated with the plurality of search results;
determining, using one or more computers, one or more graph edges of the knowledge graph that link nodes corresponding to the one or more entities with nodes corresponding to the one or more related entities;
generating a triple for each of the one or more determined graph edges, the triple comprising a grouping of one of the one or more graph edges, a first node corresponding to one of the one or more entities, and a second node corresponding to one of the one or more related entities;
analyzing each generated triple to identify additional entities in the knowledge graph and a related plurality of results; and
providing, using one or more computers, access to the related plurality of results.
2 Assignments
0 Petitions
Accused Products
Abstract
Methods, systems, and computer-readable media are provided for related entity search. In some implementations, a search system identifies a collection of entities associated with a search query. The search system identifies entities related to those entities, and determines the relationships between them. The search system provides access to one or more collections of related results identifying entities based on the determined relationships.
56 Citations
33 Claims
-
1. A method comprising:
-
obtaining, using one or more computers, a plurality of search results identifying entities from a knowledge graph, wherein at least one search result of the plurality of search results is associated with an entity in the knowledge graph; identifying, using one or more computers, one or more related entities from the knowledge graph, wherein each related entity is related to at least one of the entities associated with the plurality of search results; determining, using one or more computers, one or more graph edges of the knowledge graph that link nodes corresponding to the one or more entities with nodes corresponding to the one or more related entities; generating a triple for each of the one or more determined graph edges, the triple comprising a grouping of one of the one or more graph edges, a first node corresponding to one of the one or more entities, and a second node corresponding to one of the one or more related entities; analyzing each generated triple to identify additional entities in the knowledge graph and a related plurality of results; and providing, using one or more computers, access to the related plurality of results. - View Dependent Claims (2, 3, 5, 6, 7, 8, 9, 10, 31)
-
-
4. The method of claim herein providing access to the related plurality of results comprises identifying results identifying entities having nodes that form a triple corresponding to a relationship matching at least one of a plurality of relationships.
-
11. A system comprising:
-
a database comprising a knowledge graph; and one or more computers configured to perform operations including; obtaining a plurality of search results identifying entities from the knowledge graph, wherein at least one search result of the plurality of search results identifying entities is associated with an entity in the knowledge graph, identifying one or more related entities from the knowledge graph, wherein each related entity is related to at least one of the entities associated with the plurality of search results identifying entities, determining one or more graph edges of the knowledge graph that link nodes corresponding to the one or more entities with nodes corresponding to the one or more related entities, generating a triple for each of the one or more determined graph edges, the triple comprising a grouping of one of the one or more graph edges, a first node corresponding to one of the one or more entities, and a second node corresponding to one of the one or more related entities, analyzing each generated triple to identify additional entities in the knowledge graph and a related plurality of results, and providing access to the related plurality of results. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 32)
-
-
21. A non-transitory computer-readable medium having instructions recorded thereon that, when executed by at least one processor, cause the processor to perform a method comprising:
-
obtaining, using one or more computers, a plurality of search results identifying entities from a knowledge graph, wherein at least one search result of the plurality of search results identifying entities is associated with an entity in the knowledge graph; identifying, using one or more computers, one or more related entities from the knowledge graph, wherein each related entity is related to at least one of the entities associated with the plurality of search results identifying entities; determining, using one or more computers, one or more graph edges of the knowledge graph linking nodes corresponding to the one or more entities with nodes corresponding to the one or more related entities; generating a triple for each of the one or more determined graph edges, the triple comprising a grouping of one of the one or more graph edges, a first node corresponding to one of the one or more entities, and a second node corresponding to one of the one or more related entities; analyzing each generated triple to identify additional entities in the knowledge graph and a related plurality of results; and providing, using one or more computers, access to the related plurality of results identifying entities. - View Dependent Claims (22, 23, 24, 25, 26, 27, 28, 29, 30, 33)
-
Specification