Temporal directed cycle detection and pruning in transaction graphs
US12093245B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Apr 17, 2020 |
| Grant date | Sep 17, 2024 |
| Priority date | — |
| Expiry date | Oct 16, 2040 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q20/4016
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A method for improving computing efficiency of a computing device for temporal directed cycle detection in a transaction graph includes preparing the transaction graph based on a plurality of transactions, the transaction graph including nodes indicating transaction origination points and transaction destination points, and edges indicating interactions between the nodes. Irrelevant nodes in the transaction graph are identified and pruned to provide a pruned, preprocessed transaction graph which can be partitioning into sections, where each section includes selected nodes that are linked to other linked nodes therein. Each of the sections having non-cyclic nodes can be trimmed prior to performing cycle detection on the resulting pruned transaction graph. Postprocessing pruning can be performed to further reduce the number of detected cycles that may be of interest to a particular application, such as in anti-money laundering.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.