Distributed multi-hop neighborhood extraction for graph machine-learning via push-lazy-push-traversal
US12361068B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Mar 1, 2024 |
| Grant date | Jul 15, 2025 |
| Priority date | — |
| Expiry date | Mar 1, 2044 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F16/278
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A sampling procedure is performed for paths on a multi-hop distributed graph that includes vertices partitioned on a plurality of machines; a sampled path includes first and second vertices hosted on first and second machines respectively. The sampling procedure includes communicating, by the first machine to the second machine, first path information comprising an identifier for the second vertex and an identifier for a target vertex of the sampled path; the target vertex is hosted on a target host machine. The procedure further includes communicating edge information by the first machine to the target host machine, and communicating feature information by the second machine to the target host machine. Communication of the edge information and communication of the feature information are deferred relative to communication of the first path information.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.