Back to results
US 2017/0364808 A1Published application
Selecting an entity from a knowledge graph when a level of connectivity between its neighbors is above a certain level
AssigneeLongsand Limited
InventorsSimon Fothergill, Rachel M. Tocknell, Christopher Ogden
Life of this patent
Estimating the term…
Abstract
A method may include selecting a particular entity from a knowledge graph when a level of connectivity between entities in the knowledge graph that are neighbors to the particular entity is above a certain level and determining whether the particular entity is in a character string.
Claims16
-15. (canceled)
A method, comprising:
- selecting a particular entity from a knowledge graph when a level of connectivity between entities in the knowledge graph that are neighbors to the particular entity is above a certain level;
- and
- determining whether the particular entity is in a character string.
A non-transitory machine-readable storage medium encoded with instructions executable by a processor, the machine-readable storage medium comprising:
- instructions to rank entities in a knowledge graph according to a ranking measure of the entities in the knowledge graph, wherein a ranking measure of an entity in the knowledge graph is proportional to a level of interconnectivity between entities that are neighbors to that entity;
- and
- instructions to compare ranked entities that have a ranking measure above a certain value to text.
A computer, comprising:
- a processor;
- memory coupled to the processor and encoded with instructions to allow the processor to:
- determine clustering coefficients for respective ones of a plurality of entities in a knowledge graph;
- rank the respective ones of the plurality of entities based on their determined clustering coefficients;
- and
- determine which of the ranked respective ones of the plurality of entities are in a string of text.
3 more elements
Dependencies are inferred from the claim text.