Smart Recommendation Engine for a Digital Wallet

Active customers are recognized on the platform (around 600k).

Transaction logs for all active customers are acquired.

This data is fed to a collaborative filtering model. We used matrix factorization for this purpose.

The transaction log is converted into count data, where the number of times a user has bought a service is captured.

Historical transaction behavior data is used to improvise the collaborative filtering model.

Matrix Factorization trains a model qualified to predict a score for each possible combination of users and items. The internal coefficients of the model are learned from known scores of users and items. Offers are then based on these scores. The user-item rating matrix is factorized as the product of two lower-dimensional matrices. The first one has a row for each user, while the second has a column for each item. The row or column associated with a specific user or item is referred to as latent factors.

The predicted ratings can be computed as R̃ = HW, where R̃ ∈ ℝusers x items is the user-item rating matrix, H ∈ ℝusers x latent factors contain the user’s latent factors, and W ∈ ℝlatent factors x items the item’s latent factors.

Specifically, the predicted rating user u will give to item i is computed as:

The expressive power of the model is tuned by changing the number of latent factors. Matrix factorization with one latent factor is equivalent to a popular or top popular recommender (e.g., recommends the items with the most interactions without any personalization). Increasing the number of latent factors improves personalization; therefore, recommendation quality until the number of factors becomes too high. At this point, the model starts to overfit, and the recommendation quality will decrease.