US 12,235,848 B2
Method and system for solving subset sum matching problem using search approach
Yufei Wu, London (GB); Parisa Zehtabi, London (GB); Alberto Pozanco, Madrid (ES); Daniel Borrajo, Pozuelo de Alarcon (ES); Daniele Magazzeni, London (GB); Manuela Veloso, New York, NY (US); Michael Cashmore, Stirlingshire (GB); and Jie Deng, London (GB)
Assigned to JPMORGAN CHASE BANK, N.A., New York, NY (US)
Filed by JPMorgan Chase Bank, N.A., New York, NY (US)
Filed on Jun. 12, 2023, as Appl. No. 18/208,603.
Prior Publication US 2024/0411762 A1, Dec. 12, 2024
Int. Cl. G06F 16/2455 (2019.01); G06F 16/22 (2019.01)
CPC G06F 16/24557 (2019.01) [G06F 16/2255 (2019.01)] 18 Claims
OG exemplary drawing
 
1. A method for performing a combinatorial optimization task that relates to finding matching subsets among items that are associated with two parties, the method being implemented by at least one processor, the method comprising:
receiving, by the at least one processor, a first set of data items that relate to respective characteristics of a first situation;
receiving, by the at least one processor, a second set of data items that relate to respective characteristics of a second situation, a number of items included in the second set of data items being at least as great as a number of items included in the first set of data items;
dividing, by the at least one processor, the second set of data items into a first subset and a second subset;
generating, by the at least one processor based on the first subset, a first set of subset sums, and storing the first set of subset sums as a list;
generating, by the at least one processor based on the second subset, a second set of subset sums, and storing the second set of subset sums as a hash-map in conjunction with a corresponding hash function; and
detecting, by the at least one processor based on the first set of data items, the list, and the hash-map, at least one match between a subset sum that corresponds to the second set of data items and a subset sum that corresponds to the first set of data items,
wherein the first situation relates to a first set of records that is associated with a first party from among the two parties, and the second situation relates to a second set of records that is associated with a second party from among the two parties, and the detecting of the at least one match comprises performing a reconciliation task as between the first set of records and the second set of records in order to confirm consistency and completeness and to detect at least one from among potential fraudulent activity and potential error.