Graph-based inference of confidential data insights
US10078760B1 · kind B1 · utility
Assignee
Inventors
Key dates
| Filing date | Jan 5, 2017 |
| Grant date | Sep 18, 2018 |
| Priority date | — |
| Expiry date | Mar 16, 2037 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/9024
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In an example, a weighted directed graph data structure is constructed from position information and position transition information, the weighted directed graph data structure comprising a plurality of nodes, with each node corresponding to a position in the position information, and a plurality of directed edges between the plurality of nodes, with each directed edge corresponding to a transition occurring from a position corresponding to a node at a beginning of the directed edge to a position corresponding to a node at an end of the directed edge. A value is assigned to each node based on one or more confidential data values associated with a position corresponding to the node. A weight is assigned to each directed edge based on a number of members that transitioned positions on either side of the edge. The values in each node are then updated repeatedly based on neighbor node values until convergence occurs.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.