Identifying redundant nodes in a knowledge graph data structure
US10884865B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 26, 2018 |
| Grant date | Jan 5, 2021 |
| Priority date | — |
| Expiry date | Oct 13, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/951
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method, computer system, and computer program product for eliminating a redundant node from a knowledge graph is provided. A structural analysis of a knowledge graph is performed by determining that two nodes have a similar structure. An empirical analysis is performed by determining a search result correlation of potentially redundant nodes, said search result correlation comprising a correlation of search result nodes generated from different search queries to said knowledge graph or a correlation of search results due to selected search result nodes in subtrees of said potentially redundant nodes. Results of said structural analysis and said empirical analysis are combined to generate a redundancy confidence level value for two said nodes. One of said two nodes is determined as redundant. One of said two redundant nodes is removed from the knowledge graph.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.