Options
A framework for session based recommendations
Date Issued
01-01-2005
Author(s)
Modani, Natwar
Sabharwal, Yogish
Karthik, S.
Abstract
In this paper, we introduce a new problem which we call as Online Probabilistic Weighted Bipartite Graph Matching. Consider a weighted bipartite graph with a source node set, a target node set, an edge set and a set of weights for the edges. The source nodes arrive in an online fashion based on a stochastic process. When a source node arrives, it needs to be matched with a target node before the arrival of next source node. Since the arrival process is stochastic, all the source nodes need not arrive and their order of arrival is also not known a priori. The objective is to match the arriving source node with a target node such that the expected sum of weights of the matching over the arrival process is maximized. We present some heuristics that perform well for this problem. We demonstrate the application of our formulation for session based recommendation [5]. Here the source nodes correspond to the web pages, the target nodes correspond to the advertisement that can be shown and the edge weights correspond to the revenue generated by showing the given advertisement on the given web page. The user traversal of web pages corresponds to the arrival process of the source nodes. © Springer-Verlag Berlin Heidelberg 2005.
Volume
3590