METHOD AND SYSTEM FOR CLUSTERING TRANSACTIONS IN A FRAUD DETECTION SYSTEM
First Claim
1. A method of determining a clustering metric, the method comprising:
- receiving 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;
(a) determining an intersection set consisting of transactions that are neighbors of both transaction i and transaction j;
(b) determining a union set consisting of transactions that are neighbors of either transaction i or transaction j;
(c) computing a common linkage between transaction i and transaction j equal to the intersection set divided by the union set;
(d) incrementing index j and repeating steps (a)-(c);
(e) summing the common linkages between transaction i and the transactions of the second set of transactions;
(f) normalizing the sum of the common linkages by a number of the second set of transactions;
(g) incrementing index i and repeating steps (a)-(f);
(h) summing the normalized common linkages between the first set of transactions and the second set of transactions; and
(i) normalizing the sum of the normalized common linkages by a number of the first set of transactions to determine the clustering metric.
5 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
30 Claims
-
1. A method of determining a clustering metric, the method comprising:
-
receiving 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; (a) determining an intersection set consisting of transactions that are neighbors of both transaction i and transaction j; (b) determining a union set consisting of transactions that are neighbors of either transaction i or transaction j; (c) computing a common linkage between transaction i and transaction j equal to the intersection set divided by the union set; (d) incrementing index j and repeating steps (a)-(c); (e) summing the common linkages between transaction i and the transactions of the second set of transactions; (f) normalizing the sum of the common linkages by a number of the second set of transactions; (g) incrementing index i and repeating steps (a)-(f); (h) summing the normalized common linkages between the first set of transactions and the second set of transactions; and (i) normalizing the sum of the normalized common linkages by a number of the first set of transactions to determine the clustering metric. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method of adding a new transaction to a cluster of n transactions, the method comprising:
-
receiving the cluster, each of the n transactions having a group of neighboring transactions; receiving the new transaction, wherein the new transaction has one or more neighboring transactions; for transaction j of the n transactions; (a) determining an intersection set comprising transactions that are neighbors to both the new transaction and transaction j; (b) determining a union set comprising transactions that are neighbors of either the new transaction or transaction j; (c) 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; (d) forming a sum including the common linkage between the new transaction and the jth transaction of the cluster; and (e) incrementing j and repeating steps (a)-(d); dividing the sum of the common linkages by n to provide a clustering metric; determining that the clustering metric is greater than a clustering threshold; and adding the new transaction to the cluster. - 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 computer readable 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 (a) determine an intersection set consisting of transactions that are neighbors of both transaction i and transaction j; instructions that cause the data processor to (b) determine a union set consisting of transactions that are neighbors of either transaction i or transaction j; instructions that cause the data processor to (c) compute a common linkage between transaction i and transaction j equal to the intersection set divided by the union set; instructions that cause the data processor to (d) increment index j and repeat steps (a)-(c); instructions that cause the data processor to (e) sum the common linkages between transaction i and the transactions of the second set of transactions; instructions that cause the data processor to (f) normalize the sum of the common linkages by a number of the second set of transactions; instructions that cause the data processor to (g) increment index i and repeat steps (a)-(f); instructions that cause the data processor to (h) sum the normalized common linkages between the first set of transactions and the second set of transactions; and instructions that cause the data processor to (i) normalize the sum of the normalized common linkages by a number of the first set of transactions to determine the selection metric. - View Dependent Claims (17, 18, 19, 20, 21, 22, 23)
-
-
24. A system for adding a new transaction to a cluster of n transactions, 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 computer readable medium coupled to the data processor and storing a plurality of instructions for controlling the data processor to add the new transaction to the cluster, the plurality of instructions comprising; instructions that cause the data processor to receive the cluster, each of the n transactions having a group of neighboring transactions; instructions that cause the data processor to receive the new transaction, wherein the new transaction has one or more neighboring transactions; instructions that cause the data processor to initialize a counter j for the n transactions; instructions that cause the data processor to (a) determine an intersection set comprising transactions that are neighbors to both the new transaction and transaction j; instructions that cause the data processor to (b) determine a union set comprising transactions that are neighbors of either the new transaction or transaction j; instructions that cause the data processor to (c) compute 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; instructions that cause the data processor to (d) form a sum including the common linkage between the new transaction and the jth transaction of the cluster; and instructions that cause the data processor to (e) increment j and repeat steps (a)-(d); instructions that cause the data processor to divide the sum of the common linkages by n to provide a metric; instructions that cause the data processor to determine that the metric is greater than a clustering threshold; and instructions that cause the data processor to add the new transaction to the cluster. - View Dependent Claims (25, 26, 27, 28, 29, 30)
-
Specification