Connection sub-graphs in entity relationship graphs
US7685141B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jul 23, 2007 |
| Grant date | Mar 23, 2010 |
| Priority date | — |
| Expiry date | May 25, 2028 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q10/10
- WIPO fieldIT methods for management
- WIPO sectorElectrical engineering
Abstract
Techniques are described herein for a connection sub-graph generator that identifies important relationships between entities in entity relationship graphs. The generator first identifies two entities in an entity relationship graphs. A plurality of candidate path relationships between the two entities may be determined. For each such candidate path relationship, the generator determines a path type based on types of edge relationships that make up the candidate path relationship and generates a score value for the candidate path. This score value is based in part on the path type of the candidate path relationship. One or more candidate path relationships that have score values that indicate a high likelihood of interest to a user is selected to be included in a connection sub-graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.