Compressing profiles with a large number of dimensions
This seems similar to the collaborative filtering problem of assigning ratings to movies based on similar users and past reviews: https://en.wikipedia.org/wiki/Collaborative_filtering. The essence of this approach is to find a low-rank factorization of the matrix of ratings, where each user has one rating for each movie/product, and some of the ratings are unseen.