Clustering based on a directed graph
US10642867B2 · kind B2 · utility
Assignee
Inventor
Key dates
| Filing date | Sep 15, 2017 |
| Grant date | May 5, 2020 |
| Priority date | — |
| Expiry date | Jul 11, 2038 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06Q30/0269
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
Various embodiments describe clustering of nodes of a directed graph based on the oriented edges of the directed graph and on a set of rules. In an example, each node represents a device identifier associated with a computing device. The device identifier facilitates an online activity provided by a computing service. A computing system accesses the directed graph and generates clusters that contain subsets of the nodes by at least iteratively updating the directed graph based on the set of rules. The set of rules specifies (i) removal of leaf nodes from the directed graph, (ii) reconnection of nodes that form a chain in the directed graph, and (iii) reconnection of nodes that form a split in the directed graph. The computing system also associates a client profile with a subset of the nodes contained in a cluster from the clusters.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.