# US 2022/0044244 A1 · Incremental addition to an augmented graph model

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0044244 A1
- Document ID: US20220044244A1
- Status: Published application
- Kind: A1
- Application number: 17/386,058
- Filed: 2021-07-27
- Published: 2022-02-10
- Earliest claimed: 2020-08-06
- Assignees: Paypal, Inc.
- Applicants: PayPal, Inc.
- Inventors: Zhe Chen
- Web page: https://patentgrep.com/patent/US20220044244A1

## CPC

- G06Q 20/405: {Establishing or using transaction specific rules}
- G06F 16/28: Databases characterised by their database models, e.g. relational or object models
- G06F 16/285: {Clustering or classification}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06N 5/022: Knowledge engineering; Knowledge acquisition
- G06N 20/00: Machine learning
- G06N 20/10: using kernel methods, e.g. support vector machines [SVM]
- G06Q 20/389: {Keeping log of transactions for guaranteeing non-repudiation of a transaction}
- G06Q 20/4016: {involving fraud or risk level assessment in transaction processing}
- G06Q 40/02: Banking, e.g. interest calculation or account maintenance (credit or loans G06Q40/03)
- G06Q 30/0204: Market segmentation
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A computer system accesses an augmented graph model of (a) a set of transactions previously performed between respective pairs of initiator user accounts of a service and recipient user accounts of the service and (b) attribute values for a subset of the recipient user accounts. The computer system receives additional information indicative of an additional transaction involving an additional recipient user account that is not represented in the augmented graph model with a node. The computer system modifies the augmented graph model using the additional information and groups the user accounts represented in the modified augmented graph model into a plurality of groups.

## Claims

### Claim 1

A method comprising:
accessing, at a computer system, an augmented graph model of (a) a set of transactions previously performed between respective pairs of initiator user accounts of a service and recipient user accounts of the service and (b) attribute values for a subset of the recipient user accounts,
wherein the augmented graph model includes cluster nodes that:
(a) have been inserted into attribute clusters identified within the augmented graph model and
(b) are connected by weighted attribute edges to attributed nodes of the augmented graph model, wherein the attributed nodes are nodes that correspond to recipient user accounts having attribute values;
receiving, at the computer system, additional information indicative of an additional transaction involving an additional recipient user account that is not represented in the augmented graph model with a node;
modifying, by the computer system using the additional information, the augmented graph model by:
representing the additional recipient user account as an additional node in the augmented graph model,
determining whether to cluster the additional node with one of the attribute clusters, and
based on the determining, connecting the additional node to a particular cluster node of a particular attribute cluster with an additional attribute edge; and
grouping, with the computer system by applying one or more modularity algorithms to the modified augmented graph model, the user accounts represented in the modified augmented graph model into a plurality of groups.

### Claim 2 (depends on 1)

The method of claim 1, wherein the grouping results in a first set of user accounts being grouped into a first group and a second set of user accounts being grouped into a second group, the method further comprising:
processing, by the computer system, subsequent transactions involving the first set of user accounts according to a first policy; and
processing, by the computer system, subsequent transactions involving the second set of user accounts according to a second policy, wherein the second policy has one or more higher risk thresholds than the first policy.

### Claim 3 (depends on 1)

The method of claim 1,
wherein determining whether to cluster the additional node with one of the attribute clusters includes:
determining respective distances between the additional node and one or more existing cluster nodes,
determining that the particular cluster node is closest to the additional node, and
determining that a distance between the particular cluster node and the additional node is below a threshold.

### Claim 4 (depends on 3)

The method of claim 3,
wherein, prior to receiving the additional information, each weighted attribute edge connecting the particular cluster node to nodes in the particular attribute cluster has a same weight; and
wherein the additional attribute edge is initialized using the same weight.

### Claim 5 (depends on 1)

The method of claim 1,
wherein determining whether to cluster the additional node with one of the attribute clusters includes:
determining respective distances between the additional node and one or more existing cluster nodes, and
based on determining that none of the respective distances are below a threshold, generating the particular attribute cluster for the additional node, wherein the particular cluster node is inserted into the particular attribute cluster.

### Claim 6 (depends on 5)

The method of claim 5, wherein the additional attribute edge is initialized using a weighted degree of the additional node within the graph model.

### Claim 7 (depends on 1)

The method of claim 1,
wherein, prior to receiving the additional information, the weighted attribute edges were trained by applying a modularity maximization algorithm to the augmented graph model, and
wherein grouping the user accounts represented in the modified augmented graph model includes adjusting weights of one or more of the weighted attribute edges.

### Claim 8 (depends on 1)

The method of claim 1, further comprising:
accessing, by the computer system, groupings of the recipient user accounts generated by applying one or more modularity algorithms to the augmented graph model;
wherein grouping the user accounts represented in the modified augmented graph model includes, determining a grouping for the additional recipient user account by:
evaluating, with the computer system, a local modularity resulting from grouping the additional node into a particular group of user accounts into which a neighboring node of the additional node has been grouped; and
based on the evaluating, grouping, with the computer system, the additional node into the particular group.

### Claim 9 (depends on 8)

The method of claim 8 further comprising:
subsequent to grouping the additional node into the particular group, updating, with the computer system, weights of one or more weighted attribute edges in the augmented graph model.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
subsequent to the updating, reevaluating the grouping of the user account using modularity refinement.

### Claim 11

A non-transitory, computer-readable medium storing instructions that when executed by a computer system cause the computer system to perform operations comprising:
accessing, at a computer system, an augmented graph model of (a) a set of transactions previously performed between respective pairs of initiator user accounts of a service and recipient user accounts of the service and (b) attribute values for a subset of the recipient user accounts,
wherein the augmented graph model includes cluster nodes that:
(a) have been inserted into attribute clusters identified within the augmented graph model and
(b) are connected by weighted attribute edges to attributed nodes of the augmented graph model, wherein the attributed nodes are nodes that correspond to recipient user accounts having attribute values;
receiving, at the computer system, additional information indicative of an additional transaction involving an additional recipient user account that is not represented in the augmented graph model with a node;
modifying, by the computer system using the additional information, the augmented graph model by:
representing the additional recipient user account as an additional node in the augmented graph model,
if the additional node is within a threshold distance of one or more cluster nodes, connecting the additional node to a nearest cluster node with an additional weighted attribute edge; and
if the additional node is outside of a threshold distance from any cluster nodes, inserting an additional cluster node into the augmented graph model and connecting the additional node to the additional cluster node with an additional weighted attribute edge; and
grouping, with the computer system by applying one or more modularity algorithms to the modified augmented graph model, the user accounts represented in the modified augmented graph model into a plurality of groups.

### Claim 12 (depends on 11)

The non-transitory, computer-readable medium of claim 11, wherein the grouping results in a first set of user accounts being grouped into a first group and a second set of user accounts being grouped into a second group, wherein the operations further comprise:
processing, by the computer system, subsequent transactions involving the first set of user accounts according to a first policy; and
processing, by the computer system, subsequent transactions involving the second set of user accounts according to a second policy, wherein the second policy has one or more higher risk thresholds than the first policy.

### Claim 13 (depends on 11)

The non-transitory, computer-readable medium of claim 11,
wherein, prior to receiving the additional information, the weighted attribute edges were trained by applying a modularity maximization algorithm to the augmented graph model, and
wherein grouping the user accounts represented in the modified augmented graph model includes adjusting weights of one or more of the weighted attribute edges.

### Claim 14 (depends on 11)

The non-transitory, computer-readable medium of claim 11, wherein the operations further include:
accessing, by the computer system, groupings of the recipient user accounts generated by applying one or more modularity algorithms to the augmented graph model;
wherein grouping the user accounts represented in the modified augmented graph model includes, determining a grouping for the additional recipient user account by:
evaluating, with the computer system, a local modularity resulting from grouping the additional node into a particular group of user accounts into which a neighboring node of the additional node has been grouped; and
based on the evaluating, grouping, with the computer system, the additional node into the particular group.

### Claim 15 (depends on 11)

The non-transitory, computer-readable medium of claim 11,
wherein the threshold is the greatest distance, prior to receiving the additional information, between any particular attribute node and a respective cluster node to which the particular attributed node is connected by a respective weighted attribute edge.

### Claim 16

A non-transitory, computer-readable medium storing instructions that when executed by a computer system cause the computer system to perform operations comprising:
generating an augmented graph model of (a) a set of transactions previously performed between respective pairs of user accounts of a service and (b) attribute values for a subset of the user accounts, wherein the augmented graph model includes
cluster nodes that have been inserted into attribute clusters identified within the augmented graph model; and
indications of groupings of user accounts generated by applying one or more modularity algorithms to the augmented graph model, wherein weighted attribute edges of the augmented graph model are trained based on the groupings of user accounts;
receiving, at the computer system, additional information indicative of an additional transaction involving an additional user account that is not represented in the augmented graph model with a node;
modifying, by the computer system using the additional information, the augmented graph model by:
representing the additional user account as an additional node in the augmented graph model,
if the additional node is within a threshold distance of one or more cluster nodes, connecting the additional node to a nearest cluster node with an additional weighted attribute edge; and
if the additional node is outside of a threshold distance from any cluster nodes, inserting an additional cluster node into the augmented graph model and connecting the additional node to the additional cluster node with an additional weighted attribute edge; and
grouping, with the computer system by applying one or more modularity algorithms to the modified augmented graph model, the user accounts represented in the modified augmented graph model.

### Claim 17 (depends on 16)

The non-transitory, computer-readable medium of claim 16, wherein applying one or more modularity algorithms to the modified augmented graph model includes (a) applying a local modularity maximization algorithm to determine a group for the additional node, (b) adjusting one or more weighted attribute edges, and (c) applying a modularity refinement algorithm using the adjusted one or more weighted attribute edges.

### Claim 18 (depends on 16)

The non-transitory, computer-readable medium of claim 16, wherein grouping the user accounts represented in the modified augmented graph model includes
determining that global modularity would increase if one or more particular user accounts were grouped in a second group, wherein the particular user accounts were grouped in a first group prior to receiving the additional information; and
in response to the determining, regrouping the particular user accounts from the first group the second group.

### Claim 19 (depends on 16)

The non-transitory, computer-readable medium of claim 16, wherein grouping the user accounts represented in the modified augmented graph model includes
determining that global modularity would increase if first user accounts grouped in a first group and second user account grouped in a second group prior to receiving the additional information were regrouped together into the first group
in response to the determining, regrouping a set of the second user accounts into the first group.

### Claim 20 (depends on 16)

The non-transitory, computer-readable medium of claim 16,
wherein, prior to receiving the additional information, the weighted attribute edges were trained by applying a modularity maximization algorithm to the augmented graph model, and
wherein grouping the user accounts represented in the modified augmented graph model into a plurality of groups includes adjusting weights of one or more of the weighted attribute edges.
