I have a number of graphs with (user, user) relations and (user, item) relations. Let’s say there are N users and I items. My matrix is R^{NxI} where r_{ni} is how many times user n engaged with item i.
What is the best algorithm for learning an embedding of the items? As I understand, things like metapath2vec would be useful would take into account the weights of the (user, item) relations (ie: How many times a user engaged with an item)