Dimensional reduction of categorized directed graphs
US12339904B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Sep 8, 2020 |
| Grant date | Jun 24, 2025 |
| Priority date | — |
| Expiry date | Aug 15, 2042 |
Classification
- Technology area (CPC H)Electricity
- CPC primaryH04L67/55
- WIPO fieldDigital communication
- WIPO sectorElectrical engineering
Abstract
A method includes determining a set of features associated with a set of vertices of a directed graph, obtaining a set of feature values associated with the set of vertices, where each respective vertex of set of vertices is associated with a respective subset of feature values. The method includes determining updatable features based on the set of features, selecting a first subset of features based on the set of updatable features. Selecting the first subset of features includes determining candidate subsets of features, determining feature subset scores associated with the candidate subsets of features based on a category label, and selecting the first subset of features based on the feature subset scores. The method includes performing a first operation to determine extracted feature values by determining feature extraction input values.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.