Abstract: A method is disclosed, comprising: aggregating a plurality of sets of transactions, each set of transactions comprising transactions related to an account-merchant pairing; determining variables characterizing a recurrence period based on transaction dates of the transactions in the each set; predicting the recurrence period for a transaction related to the account-merchant pairing for each customer of the plurality of customers; aggregating another set of transactions between the plurality of customers and the merchant; evaluating a distribution of the recurrence period for each customer within range of a distant point; and based on the evaluation of the distribution of the recurrence period for each customer, generating a probability of the merchant having a recurrent transaction with the customer. The account-merchant pairing may comprise a customer account and a merchant of a plurality of customers and merchants.

Abstract: A method is disclosed, comprising: aggregating a plurality of sets of transactions, each set of transactions comprising transactions related to an account-merchant pairing; determining variables characterizing a recurrence period based on transaction dates of the transactions in the each set; predicting the recurrence period for a transaction related to the account-merchant pairing for each customer of the plurality of customers; aggregating another set of transactions between the plurality of customers and the merchant; evaluating a distribution of the recurrence period for each customer within range of a distant point; and based on the evaluation of the distribution of the recurrence period for each customer, generating a probability of the merchant having a recurrent transaction with the customer. The account-merchant pairing may comprise a customer account and a merchant of a plurality of customers and merchants.

Abstract: A method is disclosed, comprising: aggregating a plurality of sets of transactions, each set of transactions comprising transactions related to an account-merchant pairing; determining variables characterizing a recurrence period based on transaction dates of the transactions in the each set; predicting the recurrence period for a transaction related to the account-merchant pairing for each customer of the plurality of customers; aggregating another set of transactions between the plurality of customers and the merchant; evaluating a distribution of the recurrence period for each customer within range of a distant point; and based on the evaluation of the distribution of the recurrence period for each customer, generating a probability of the merchant having a recurrent transaction with the customer. The account-merchant pairing may comprise a customer account and a merchant of a plurality of customers and merchants.

Abstract: Provided herein are a method, a system, and a computer program product embodiments, and/or combinations and sub-combinations thereof, for dynamically detecting recurring transactions using tunable labels to train different transaction models that provide separate analysis of transaction sets. The recurrence detection of transactional data is based on labels that can be tuned to define different definitions of recurrence. Each definition of recurrence may be used to train a model which results in different trained models to suit the different tuned labels.