Clustering based on a directed graph
First Claim
1. A computer-implemented method for large-scale graph clustering, the computer-implemented method performed on a computing system and comprising:
- accessing, by a clustering module hosted on the computing system, a directed graph generated based on data associated with online activities of computing devices, the directed graph comprising nodes and oriented edges connecting the nodes, each node representing a device identifier associated with one of the computing devices;
generating, by the clustering module, clusters that contain subsets of the nodes by at least iteratively updating the directed graph based on a set of rules, the set of rules specifying (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;
associating, by a profile module hosted on the computing system, a client profile with a subset of the nodes contained in a cluster from the clusters; and
customizing, by a client service module hosted on the computing system, an online activity of a computing device associated with a device identifier, the online activity customized according to the client profile based on a determination that the device identifier corresponds to a node from the subset of nodes associated with the client profile.
2 Assignments
0 Petitions
Accused Products
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.
42 Citations
19 Claims
-
1. A computer-implemented method for large-scale graph clustering, the computer-implemented method performed on a computing system and comprising:
-
accessing, by a clustering module hosted on the computing system, a directed graph generated based on data associated with online activities of computing devices, the directed graph comprising nodes and oriented edges connecting the nodes, each node representing a device identifier associated with one of the computing devices; generating, by the clustering module, clusters that contain subsets of the nodes by at least iteratively updating the directed graph based on a set of rules, the set of rules specifying (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; associating, by a profile module hosted on the computing system, a client profile with a subset of the nodes contained in a cluster from the clusters; and customizing, by a client service module hosted on the computing system, an online activity of a computing device associated with a device identifier, the online activity customized according to the client profile based on a determination that the device identifier corresponds to a node from the subset of nodes associated with the client profile. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13)
-
-
14. A computing system comprising:
-
means for accessing a directed graph generated based on data associated with online activities of computing devices, the directed graph comprising nodes and oriented edges connecting the nodes, each node representing a device identifier associated with one of the computing devices; means for generating clusters that contain subsets of the nodes by at least iteratively updating the directed graph based on a set of rules, the set of rules specifying (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; means for associating a client profile with a subset of the nodes contained in a cluster from the clusters; and means for customizing an online activity of a computing device associated with a device identifier, the online activity customized according to the client profile based on a determination that the device identifier corresponds to a node from the subset of nodes associated with the client profile. - View Dependent Claims (15)
-
-
16. A non-transitory computer-readable storage medium comprising instructions that, upon execution on a computing system, configure the computing system to perform operations comprising:
-
accessing a directed graph generated based on data associated with online activities of computing devices, the directed graph comprising nodes and oriented edges connecting the nodes, each node representing a device identifier associated with one of the computing devices; generating clusters that contain subsets of the nodes by at least iteratively updating the directed graph based on a set of rules, the set of rules specifying (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; associating a client profile with a subset of the nodes contained in a cluster from the clusters; and customizing an online activity of a computing device associated with a device identifier, the online activity customized according to the client profile based on a determination that the device identifier corresponds to a node from the subset of nodes associated with the client profile. - View Dependent Claims (17, 18, 19)
-
Specification