US 12,292,892 B2
System and method for generating searchable social graph
Patnaik Siddharth, Lyndhurst, NJ (US)
Assigned to JPMORGAN CHASE BANK, N.A., New York, NY (US)
Filed by JPMorgan Chase Bank, N.A., New York, NY (US)
Filed on Oct. 24, 2023, as Appl. No. 18/383,175.
Claims priority of provisional application 63/418,785, filed on Oct. 24, 2022.
Prior Publication US 2024/0134866 A1, Apr. 25, 2024
Prior Publication US 2024/0232208 A9, Jul. 11, 2024
Int. Cl. G06F 16/2457 (2019.01); G06F 16/22 (2019.01)
CPC G06F 16/24575 (2019.01) [G06F 16/2264 (2019.01)] 20 Claims
OG exemplary drawing
 
1. A method for generating a searchable social graph based on payment data, the method comprising:
extracting, from a carbon customer profile database, customer-based information for a plurality of entities;
extracting, from a payment database, previous transaction information conducted by the plurality of entities;
generating a plurality of data nodes for the plurality of entities with respect to a target user;
determining a score for each of the plurality of data nodes with respect to the target user based on the extracted customer-based information and the previous transaction information, wherein the score indicating a proximity level with the target user, and wherein the score is based on a number of intervening data nodes between a respective node and a data node corresponding to the target user;
generating a searchable relationship model for the plurality of data nodes with respect to the target user based on the determined score, wherein the searchable relationship model arranges the plurality of data nodes in a descending order in accordance with degrees of connection with the target user that correspond to the proximity level, the degrees of connection includes a first degree connection that is a direct connection with the data node corresponding to the target user, a second degree connection that is an indirect connection with the data node corresponding to the target user via one intervening data node, and a third degree connection that is an indirect connection with the data node corresponding to the target user via two intervening data nodes;
receiving, on a user interface, an input provided by the target user;
performing a search, using the searchable relationship model based on the input provided by the target user;
identifying, based on the search performed via the searchable relationship model, one or more data nodes among the plurality of data nodes as potential recipient candidates for conducting a transaction;
displaying, on the user interface, the potential recipient candidates for the provided input based on the proximity level with respect to the target user, wherein the potential recipient candidates are displayed in a descending order in accordance with the proximity level with respect to the target user; and
receiving, via the user interface, a selection among the potential recipient candidates as a target recipient.