Large taxonomy categorization
US9697276B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Dec 29, 2014 |
| Grant date | Jul 4, 2017 |
| Priority date | — |
| Expiry date | Dec 29, 2034 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/24578
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method includes associating, in a graph including graph nodes connected via of edges, a respective node weight with each of the graph nodes, and organizing the graph nodes into ancestor nodes, each of the ancestor nodes having one or more descendent nodes so that the ancestor and the descendent nodes include all the graph nodes. For a given descendent node, a respective path to one or more of the ancestor nodes is identified, each of the respective paths including one or more edges, and a given ancestor node having a shortest of the identified paths is determined. A respective edge weight is assigned to each of the one or more edges in the shortest path, and, for the given descendent node, a node loss value is calculated based on the node weight and the respective edge weight of the each of the one or more edges.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.