Method and system for clustering transactions in a fraud detection system
First Claim
1. A computer-implemented method of determining a clustering metric, the method comprising:
- receiving, by a processor, a first set of transactions;
receiving a second set of transactions; and
for transaction i of the first set of transactions and transaction j of the second set of transactions;
determining an intersection set comprising transactions that are neighbors of transaction i and transaction j;
determining a union set comprising transactions that are neighbors of either transaction i or transaction j;
computing a common linkage between transaction i and transaction j equal to the intersection set divided by the union set;
determining a clustering metric based on the common linkage; and
storing the clustering metric in memory.
3 Assignments
0 Petitions
Accused Products
Abstract
A method of determining a clustering metric includes receiving a first set of transactions and a second set of transactions. For transaction i of the first set and transaction j of the second set, the method includes (a) determining an intersection set, (b) determining a union set; (c) computing a common linkage between transaction i and transaction j equal to the intersection set divided by the union set, and (d) incrementing index j and repeating steps (a)-(c). The method also includes (e) summing the common linkages between transaction i and the transactions of the second set, (f) normalizing the sum of the common linkages by a number of the second set, and (g) incrementing index i and repeating steps (a)-(f). The method further includes (h) summing the normalized common linkages and (i) normalizing the sum of the normalized common linkages by a number of the first set.
-
Citations
20 Claims
-
1. A computer-implemented method of determining a clustering metric, the method comprising:
-
receiving, by a processor, a first set of transactions; receiving a second set of transactions; and for transaction i of the first set of transactions and transaction j of the second set of transactions; determining an intersection set comprising transactions that are neighbors of transaction i and transaction j; determining a union set comprising transactions that are neighbors of either transaction i or transaction j; computing a common linkage between transaction i and transaction j equal to the intersection set divided by the union set; determining a clustering metric based on the common linkage; and storing the clustering metric in memory. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A computer-implemented method of adding a new transaction to a cluster of n transactions, the method comprising:
-
receiving, by a processor, the cluster, wherein each of the n transactions comprises a group of neighboring transactions; receiving the new transaction, wherein the new transaction comprises one or more neighboring transactions; for transaction j of the n transactions; determining an intersection set comprising transactions that are neighbors to the new transaction and transaction j; determining a union set comprising transactions that are neighbors of either the new transaction or transaction j; computing a common linkage between the new transaction and transaction j, wherein the common linkage is equal to the intersection set divided by the union set; determining a clustering metric based on the common linkages; determining that the clustering metric is greater than a clustering threshold; adding the new transaction to the cluster; and storing the cluster with the new transaction in memory. - View Dependent Claims (10, 11, 12, 13, 14, 15)
-
-
16. A system for determining a clustering metric, the system comprising:
-
a data processor; a communications module coupled to the data processor; an input/output interface coupled to the data processor; and a non-transitory computer readable storage medium coupled to the data processor and storing a plurality of instructions for controlling the data processor to determine the clustering metric, the plurality of instructions comprising; instructions that cause the data processor to receive a first set of transactions; instructions that cause the data processor to receive a second set of transactions; instructions that cause the data processor to initialize a counter i for the first set of transactions and a counter j for the second set of transactions; instructions that cause the data processor to determine an intersection set comprising transactions that are neighbors of both transaction i and transaction j; instructions that cause the data processor to determine a union set comprises transactions that are neighbors of either transaction i or transaction j; instructions that cause the data processor to compute a common linkage between transaction i and transaction j equal to the intersection set divided by the union set; and instructions that cause the data processor to determine a selection metric based on the common linkage. - View Dependent Claims (17, 18, 19, 20)
-
Specification