# US 2022/0036239 A1 · Systems and methods to define the card member value from an issuer perspective

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2022/0036239 A1
- Document ID: US20220036239A1
- Status: Published application
- Kind: A1
- Application number: 17/386,452
- Filed: 2021-07-27
- Published: 2022-02-03
- Earliest claimed: 2020-07-29
- Assignees: Mastercard International Incorporated
- Applicants: Mastercard International Incorporated
- Inventors: Deepak BHATT; Tanmoy BHOWMIK; Harsimran BHASIN; Jessica PERETTA; Ganesh PRASAD
- Web page: https://patentgrep.com/patent/US20220036239A1

## CPC

- G06N 20/00: Machine learning
- G06Q 30/0201: Market modelling; Market analysis; Collecting market data
- G06F 18/10: Pre-processing; Data cleansing
- G06F 18/2132: based on discrimination criteria, e.g. discriminant analysis
- G06F 18/2137: based on criteria of topology preservation, e.g. multidimensional scaling or self-organising maps
- G06F 18/2148: {characterised by the process organisation or structure, e.g. boosting cascade}
- G06F 18/217: {Validation; Performance evaluation; Active pattern learning techniques}
- G06N 3/0442: characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
- G06N 3/045: Combinations of networks
- G06N 3/088: Non-supervised learning, e.g. competitive learning
- G06N 3/09: Supervised learning
- G06N 3/094: Adversarial learning
- G06N 3/096: Transfer learning
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/047: Probabilistic or stochastic networks
- G06N 3/048: Activation functions
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Systems and computer-implemented methods of modeling card member data to classify a card member into one of a plurality of classifications based on interchange fees derived from the use of a card issued to the card member. The modeling may handle data distribution from one time period to another time period to address unavailability and/or variability of historical data, implement a neural network architecture based on transformers and discriminators for accurate data scaling, perform data filling for missing data, and fine-tuning for card types that have less card member data, which may result in enhanced performance and faster convergence resulting in reduced computational time. Such fine-tuning may leverage uniform standardization in the neural network to handle multiple card types, which is facilitated through the use of the transformers and discriminators for data scaling.

## Claims

### Claim 1

A system of training a machine-learning classifier that accounts for variability in data distributions over time, comprising:
a processor programmed to:
access features from a first dataset of available data, the first dataset relating to a first time period ending on a first date;
train a transformer to scale the features;
access a plurality of labels derived from a second dataset of the available data, the second dataset relating to a second time period starting after the first date; and
generate a classifier that classifies input data based on the plurality of labels and the trained transformer.

### Claim 2 (depends on 1)

The system of claim 1, wherein to train the transformer, the processor is further programmed to implement a discriminator that operates in an adversary manner with the transformer to adjust feature weights of the transformer.

### Claim 3 (depends on 2)

The system of claim 2, wherein the transformer is to:
generate a scaled representation of the features based on the feature weights; and
wherein the discriminator is to:
compare the scaled representation of the features with reference scaled features corresponding to the first dataset;
generate discrimination scores based on the comparison, each discrimination score indicating a level of difference between a scaled representation of a feature from among the scaled representation of the features and a corresponding reference scaled feature among the reference scaled features; and
provide the discrimination scores to the transformer, wherein the transformer is to adjust the feature weights based on the discrimination scores to adjust generation of the scaled representation of the features.

### Claim 4 (depends on 3)

The system of claim 3, wherein the transformer is to adjust feature weights until one or more of the discrimination scores are each within a threshold level of error.

### Claim 5 (depends on 3)

The system of claim 3, wherein to train the transformer, the processor is further programmed to:
train the transformer and the discriminator to generate the scaled representation of the features; and
train the classifier after the transformer and the discriminator are trained.

### Claim 6 (depends on 3)

The system of claim 3, wherein to train the transformer, the processor is further programmed to:
train the transformer, the discriminator, and the classifier simultaneously.

### Claim 7 (depends on 2)

The system of claim 2, wherein the processor is further programmed to fine-tune classifier weights derived from the available data based on a second set of available data that is less in quantity than the available data, and wherein to fine-tune, the processor is programmed to:
access the classifier weights; and
adjust the classifier weights based on the second set of available data.

### Claim 8 (depends on 7)

The system of claim 7, wherein the available data relates to a first card type of respective card members and the second set of available data relates to a second card type of respective card members.

### Claim 9 (depends on 1)

The system of claim 1, wherein the first dataset comprises univariate data relating to a plurality of card members, and wherein the features comprise a time series of data relating to an amount of spending of each of the plurality of card members.

### Claim 10 (depends on 1)

The system of claim 1, wherein the first dataset comprises multivariate data relating to a plurality of card members, and wherein the features comprise at least a time series of data relating to an amount of spending of each of the plurality of card members and at least one other characteristic of each of the plurality of card members.

### Claim 11 (depends on 1)

The system of claim 1, wherein each label of the plurality of labels comprises a card member category that is based on a level of spend of a card member.

### Claim 12 (depends on 11)

The system of claim 11, wherein the classifier generates a respective probability that the card member belongs to a given card member category.

### Claim 13 (depends on 12)

The system of claim 12, wherein the processor is further programmed to:
rank, within each card member category, each card member based on the respective probability that each card member CM belongs to the card member category.

### Claim 14

A method of training a machine-learning classifier that accounts for variability in data distributions over time, comprising:
accessing, by a processor, features from a first dataset of available data, the first dataset relating to a first time period ending on a first date;
training, by the processor, a transformer to scale the features;
accessing, by the processor, a plurality of labels derived from a second dataset of the available data, the second dataset relating to a second time period starting after the first date; and
generating, by the processor, a classifier that classifies input data based on the plurality of labels and the trained transformer.

### Claim 15 (depends on 14)

The method of claim 14, wherein training the transformer comprises:
implementing a discriminator that operates in an adversary manner with the transformer to adjust feature weights of the transformer.

### Claim 16 (depends on 15)

The method of claim 15, further comprising:
generating, by the transformer, a scaled representation of the features based on the feature weights; and
comparing, by the discriminator, the scaled representation of the features with reference scaled features corresponding to the first dataset;
generating, by the discriminator, discrimination scores based on the comparison, each discrimination score indicating a level of difference between a scaled representation of a feature from among the scaled representation of the features and a corresponding reference scaled feature among the reference scaled features;
providing, by the discriminator, the discrimination scores to the transformer; and
adjusting, by the transformer, the feature weights based on the discrimination scores to adjust generation of the scaled representation of the features.

### Claim 17 (depends on 16)

The method of claim 16, wherein further comprising:
adjusting, by the transformer, feature weights until one or more of the discrimination scores are each within a threshold level of error.

### Claim 18 (depends on 16)

The method of claim 16, wherein training the transformer comprises:
training the transformer and the discriminator to generate the scaled representation of the features; and
training the classifier after the transformer and the discriminator are trained.

### Claim 19 (depends on 16)

The method of claim 16, wherein training the transformer comprises:
training the transformer, the discriminator, and the classifier simultaneously.

### Claim 20 (depends on 15)

The method of claim 15, further comprising:
fine-tuning classifier weights derived from the available data based on a second set of available data that is less in quantity than the available data, and wherein fine-tuning comprises:
accessing the classifier weights; and
adjusting the classifier weights based on the second set of available data.
