[Premium]{class="badge positive" title="See what's included in Target Premium."}
Random Forest algorithm
The main personalization algorithm used in both (AP) and Auto-Target activities is Random Forest. Ensemble methods, such as Random Forest, use multiple learning algorithms to obtain better predictive performance than could be obtained from any of the constituent learning algorithms. The Random Forest algorithm in Automated Personalization and Auto-Target is a classification or regression method that operates by constructing a multitude of decision trees when it is being trained.
When you think of statistics, a single regression model used to predict an outcome might come to mind. The latest data science research suggests that 鈥渆nsemble methods,鈥 where multiple models are created from the same data set and then intelligently combined, produce better results than would predicting based on a single model alone.
The Random Forest algorithm is the key underlying personalization algorithm used in Automated Personalization and Auto-Target activities. Random Forest combines hundreds of decisions trees together to arrive at a better prediction than a single tree could make by itself.
What is a decision tree? section_7F5865D8064447F4856FED426243FDAC
The goal of a decision tree is to break down all available visit data a system can learn from and then group that data, in which visits within each group are as similar as possible to each other with regard to the goal metric. Across groups, however, the visits are as different as possible, regarding the goal metric (for example, conversion rate). The decision tree looks at the different variables that it has in the training set to determine how to split the data in a Mutually Exclusive Collectively Exhaustive (MECE) way into these groups (or 鈥渓eaves鈥) to maximize this goal.
In a simple example, let鈥檚 assume two input variables:
- Gender (with two potential values, Male or Female)
- Zip Code (with five potential values in the small data set: 11111, 22222, 33333, 44444, or 55555)
If the goal metric is conversion, then the tree would first determine which of the two variables explains the largest amount of variation in the visit data鈥檚 conversion rate.
Let鈥檚 say zip code is most predictive. This variable would then form the first 鈥渂ranch鈥 of the tree. The decision tree would then determine how to split the visit data, such as the conversion rate of the records within each split was as similar as possible, and the conversion rate between the splits was as different as possible. In this example, assume 11111, 22222, 33333 are one split and 44444 and 55555 are a second split.
This action results in the first layer of the decision tree:
The decision tree poses the question, 鈥淲hat is the most predictive variable?鈥 In this example, there are only two variables, so the answer here is clearly gender. The tree now looks to complete a similar exercise to split the data within each branch. First, let鈥檚 consider the 11111, 22222, and 33333 branch. In these zip codes, if there is a difference in conversion between men and women, then there would be two leaves (men and women), and this branch would be complete. In the other branches, 44444 and 55555, let鈥檚 assume there is no statistical difference between how women and men convert. In this case, the first branch becomes the final split.
The example would result in the below tree:
How are decision trees used by Random Forest? section_536C105EF9F540C096D60450CAC6F627
Decision trees can be a powerful statistical tool. However, they have some disadvantages. Most critically, they can 鈥渙ver-fit鈥 the data so that an individual tree poorly predicts future data that wasn鈥檛 used to build the initial tree. This challenge is known as the in statistical learning. Random forests help overcome this over-fitting challenge. At the highest level, a random forest is a collection of decision trees that are built slightly differently on the same data set that 鈥渧ote鈥 together to yield a better model than an individual tree. The trees are built by randomly selecting a subset of visit records with replacement (known as bagging), and randomly selecting a subset of the attributes, so that the forest consists of slightly different decision trees. This method introduces small variations into the trees that are created in the Random Forest. Adding in this controlled amount of variance helps improve the predictive accuracy of the algorithm.
How do the Target personalization algorithms use Random Forest? section_32FB53CAD8DF40FB9C0F1217FBDBB691
How models are built
The following diagram summarizes how models are built for Auto-Target and Automated Personalization activities:
- Target collects data on visitors while randomly serving experiences or offers
- After Target hits a critical mass of data, Target performs feature engineering
- Target builds Random Forest models for each experience or offer
- Target checks if the model meets a threshold quality score
- Target pushes the model to production to personalize future traffic
Target uses data that it collects automatically, and custom data provided by you, to build its personalization algorithms. These models predict the best experience or offer to show to visitors. Generally, one model is built per experience (if an Auto-Target activity) or per offer (if an Automated Personalization activity). Target then displays the experience or offer that yields the highest predicted success metric (for example, conversion rate). These models must be trained on randomly served visits before they can be used for prediction. As a result, when an activity first starts, even those visitors who are in the personalized group are randomly shown different experiences or offers until the personalization algorithms are ready.
Each model must be validated to ensure that it is good at predicting the behavior of visitors before it is used in your activity. Models are validated based on their Area Under the Curve (AUC). Because of the need for validation, the exact time when a model starts serving personalized experiences depends on the details of the data. In practice, and for traffic planning purposes, it usually takes more than the minimum number of conversions before each model is valid.
When a model becomes valid for an experience or offer, the clock icon to the left of experience/offer name changes to a green checkbox. When there are valid models for at least two experiences or offers, some visits start to become personalized.
Feature transformation
Before the data goes through the personalization algorithm, it undergoes a feature transformation, which can be thought of as prepping the data collected in the training records for use by the personalization models.
The feature transformations depend on the type of attribute. Mainly, there are two types of attributes (or 鈥渇eatures鈥 as they are sometimes described by data scientists):
- Categorical: Categorical features cannot be counted but can be sorted into different groups. They could be features like country, gender, or zip code.
- Numeric: Numeric features can be measured or counted, such as age, income, and so on.
For categorical features, a set of all possible features is maintained and the likelihood transformation is used to reduce the data size. For numeric features, rescaling ensures that the features are comparable across the board.
Balancing learning versus personalizing with the multi-armed bandit
After Target has personalization models built to personalize your traffic, there is a clear tradeoff you face for future visitors to your activity. Should you personalize all the traffic based on the current model or should you continue to learn from new visitors by randomly serving them random offers? You want to make sure the personalization algorithm is always learning about new trends in your visitors, while personalizing most of the traffic.
The multi-arm bandit is how Target helps you meet this goal. The multi-arm bandit ensures that the model is always 鈥渟pending鈥 a small fraction traffic to continue to learn throughout the life of the activity learning and to prevent over-exploitation of previously learned trends.
In the data-science world, the multi-armed bandit problem is a classic example of the exploration versus exploitation dilemma in which a collection of one-armed bandits, each with unknown reward probability, is given. The key idea is to develop a strategy, which results in the arm with the highest success probability to be played so the total reward obtained is maximized. Multi-armed bandit is used in the system for online scoring after the online models are built. This process helps with online learning during exploration. The current multi-armed algorithm is an epsilon (蔚) greedy algorithm. In this algorithm, with probability 1- 蔚, the best arm is chosen. And, with probability 蔚, any other arm is randomly chosen.