Efficient similarity ranking for bipartite graphs
US10152557B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | May 15, 2014 |
| Grant date | Dec 11, 2018 |
| Priority date | — |
| Expiry date | Sep 14, 2036 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q30/0241
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Systems and methods offer an efficient approach to computing similarity rankings in bipartite graphs. An example system includes at least one processor and memory storing a bipartite graph having a first set and a second set of nodes, with nodes in the first set being connected to nodes in the second set by edges. The memory also stores instructions that, when executed by the at least one processor, cause the system to assign each node in the second set to one of a plurality of categories and, for each of the plurality of categories, generate a subgraph. The subgraph comprises of a subset of nodes in the first set and edges linking the nodes in the subset, where the nodes in the subset are selected based on connection to a node in the second set that is assigned to the category. The system uses the subgraph to respond to queries.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.