Recommendations are the main drive for consumer purchase in online retailers and the most effective factor in user engagement in online services. However, delivering the right item at the right time to the right person is a challenging task due to many reasons. Firstly, the user preference is not directly observable and must be learnt from implicit feedback. Moreover, users may have different behavioral patterns; Some tend to explore and test new products while others use a limited number of products frequently. In addition to this heterogeneity, their interest and preference change over time and may exhibit seasonality. On the other hand, the ubiquity and increasing presence of social networks in everyday lives transforms the purchasing process or service adoption from a simple matching of user preference and item specification to a more complex one affected by the peer influence.
Poisson Factorization (PF) is the gold standard framework for recommendation systems with implicit feedback (Gopalan et al., 2015; Chaney et al., 2015; Charlin et al., 2015; Gopalan et al., 2014, 2014). The PF based methods utilize the user interactions with items in terms of the count of item usages, where this implicit feedback signal helps infer the latent user preference and item specification. There is a wealth of research to adapt the PF framework to tackle the aforementioned problems. Importantly, diversity and heterogeneity of users and products is taken care of by an innovative hierarchical probabilistic model (Gopalan et al., 2015)
called HPF hereafter. Dynamic Poisson Factorization (DPF) captures the time evolving latent factors with a Kalman filter(Charlin et al., 2015). Moreover, to incorporate social network information into a traditional factorization method, Social Poisson Factorization (SPF) enriched the preference-based recommendations (Chaney et al., 2015).
However, the existing variants of PF based recommendation do not explicitly take into account the temporal behavior and the recurrent activities of users. The time-sensitive product adoption data carries a great deal of information on usage dynamics which is otherwise neglected when the user-item interaction is only reported by the aggregated number of times they happen (Koren, 2010; Du et al., 2015). Furthermore, it allows successful predictions of the returning time which not only allows a web company to keep track of the evolving user preferences, but also results in more clever marketing strategies and time-sensitive recommendation. After all, online retailers need not blindly advertise all the times and make the users indifferent. Traditionally, in PF based recommendation the state of each user is often assumed to be binary – either adopting a product or not, or an aggregated count/rating variable. However, such assumption does not capture the recurrent nature of product usage, where the frequency and time of the usage matters. It’s noteworthy that the classical time-window or instance-decay approaches and manually discretization do not work, as they lose too much information when discarding data instances or coarse-grained discretizing of the time. Alternatively, one can improve the accuracy by more granular approximation at the cost of increased computational complexity.
In this paper, we introduce Recurrent Poisson Factorization (RPF) for recommendation systems. RPF is a mathematical framework based on Poisson processes (Kingman, 1993), which generalizes the classical PF methods by modeling the product adoption as a non-homogeneous Poisson process over time rather than a Poisson distribution on the aggregated count values. RPF jointly models the time and the type of items with which the user interacts and hence is able not only to predict the item but the time that she will adopt a service. A distinctive feature of RPF is its interpretability and intuitive parameterization; In addition to following the classic PF methods on learning a latent representation for each user and item it provides a sound and rigorous framework to model the effect of previous actions of the user and her friends on future service usages and preferences. RPF framework not only extends the basic PF method (Gopalan et al., 2015), but is applicable to the many of its variants. Basically, we establish the foundation for replacing Poisson distribution with the Poisson process whenever there is a call for temporal and recurrent service adoption. Notably, we extend the well-known HPF, DPF, and SPF methods to their recurrent counterparts, HRPF, DRPF, and SRPF, respectively. These downstream variants of RPF accompanied with its well-founded mathematical essence makes it a compelling replacement for classic PF when the temporal granularity and frequency of actions matter. In summary, we have the following main contributions:
We establish a previously unexplored connection between Poisson factorization framework and Poisson processes, which allows to recommend the right item to the right user at the right time by inferring the dynamic user interests over time and predicting the time that users need each item.
We show that RPF framework is applicable to many variants of basic PF. It can handle dynamic user preference and item specification (DRPF), It can capture the heterogeneity and diversity among users and items (HRPF), and It is able to incorporate the peer influence and the network of users (SRPF).
We propose a scalable variational inference algorithm based on mean-field approximation for RPF that scales up to millions of user-item interactions.
We conduct several experiments on synthetic and two real datasets to demonstrate the performance of our model. To this end, we curated a dataset consisting of the listening history of more than 1000 users over 6 months including more than 450K user-song pairs.111The codes and data are available at https://github.com/AHosseini/RPF
Related Work. The works most closely related to ours are roughly divided into two parts: Poisson factorization methods and Poisson point processes. These two lines of research for recommendation systems are progressing independently, and, to the best of our knowledge, we are the very first to systematically combine these two and propose a unified framework for Poisson process factorization.
Matrix factorization algorithms are widely used for recommendation in order to infer the user preferences based on similar consumption patterns among users (Salakhutdinov and Mnih, 2007)
. Traditional Factorization methods used user ratings to products in order to estimate their preferences. Since users rarely provide such explicit feedbacks, more recent methods such as Poisson factorization infer such preferences from user implicit feedback. Different variants of PF are able to consider the heterogeneity among users, dynamic user interests over time and peer influence among users(Gopalan et al., 2015; Charlin et al., 2015; Chaney et al., 2015). Moreover, the nonparametric version of PF is able to effectively estimate the dimension of latent feature space (Gopalan et al., 2014). Collaborative Topic Poisson Factorization (CTPF) is another variant of PF which is customized for article recommendation and is able to consider the content of articles to infer the user preferences more effectively (Gopalan et al., 2014). Although PF provides a general framework for recommendation with many desirable features, but looses a great deal of information due to ignoring the temporal patterns of user actions.
More recently, point process methods have attracted a lot of interest in user behavior modeling (Khodadadi et al., 2017) and recommendation systems (Du et al., 2015; Jing and Smola, 2017; Du et al., 2016; Wang et al., 2016). The paper (Valera and Gomez-Rodriguez, 2015) presents a first Hawkes process approach to model the adoption of products, however, their model does not capture dynamic preferences and suffer from inconsistent and negative rate functions. The method proposed in (Zarezade et al., 2016b) models the adoption of competing products by a multidimensional point process. However, it doesn’t provide a method for recommending appropriate items to users. The authors in (Du et al., 2015) propose a compelling point process model for recommendation systems, however, the model lacks the peer influence within the network and suffers from non-dynamic user preference and item specifications. Moreover, to model the heterogeneity between users they impose a low-rank regularizer which blindly set most latent dimensions of preferences to zero while keeping a few non-zero elements. In contrast, our approach captures the diversity between users by hierarchal Bayesian modeling. (Wang et al., 2016) proposed a coevolutionary model of user and item latent features without incorporating network influence or considering the heterogeneity among users. Last but not least, all these work lack a systematic treatment of Poisson factorization methods and Poisson processes and their close connections.
2.1. Poisson Factorization
Poisson factorization is a general framework for recommendations based on users implicit feedbacks, such as clicks, purchases or watches. PF methods use the number of times a user consumed the product to infer the interest of user to all products including non-consumed ones. HPF is the most basic model in this framework, which assumes the number of times that user purchased or clicked an item
is a Poisson random variablewith rate . HPF models the interest of user and properties of product as
dimensional latent vectorsand , respectively, and use their inner product as the latent rate of , that is:
In order to model the heterogeneous interests of users and the variety of items, HPF uses a hierarchical prior over latent feature vectors (Gopalan et al., 2015). Although this model has rigorous statistical properties such as sparse representation and ability to capture the long-tailed user activities, unfortunately, it is not able to utilize the social relation among users that is inherent to many recommendation scenarios.
Social Poisson Factorization (SPF) is another development in PF framework that solves the above issue (Chaney et al., 2015). SPF models the number of times user is engaged with an item is a Poisson random variable. However SPF assumes that the rate of is the sum of and a weighted sum of the number of times user ’s friends have consumed this item. That is:
where is the latent impact of user on user . In this way, SPF incorporates the social relations among users with the user-item history in an effective way. Therefore, it’s able to infer the influence of users on each other. However, since this model is not able to consider time of users’ actions, the rate of adopting item by user will be increased by any time after her friend adopts this item. This is not true in real-world scenarios as the effect of users’ actions on their friends usually decays after some time.
The PF factorization framework has advanced continuously to handle more real-world and applied situations. The evolving user preferences and item specification (over time) was one of the serious challenges of recommender systems. In appeal to this call, Dynamic Poisson Factorization (DPF) is introduced as a recommendation method based on Poisson factorization. It basically solves this issue by considering time dependent feature vectors for users and items. DPF is a discrete-time approach which models the evolution of users and items latent features over time by a Kalman filter. In order to do so, DPF models latent features by a Gaussian state space model and exponentiates the state space model to make it nonnegative. Therefore, the rate of user for adopting item becomes:
One of the most limiting properties of the PF methods is that they summarize the history of user-item interactions in terms of a single count and hence discard a great deal of information. Furthermore, their are not usually well-suited to model the situations where the consumption is a recurrent process. Failing to answer time-sensitive questions is another drawback of the classic PF models. In the next section, we make a brief introduction to Poisson processes which are able to capture the temporal dynamics of user-item interactions more effectively.
2.2. Poisson Process
Poisson process is a stochastic process which is suitable for modeling timestamped events. This process assumes that the number of events in a time window , , is a random variable distributed as:
where is the rate of occurring events. The main advantage of Poisson process over Poisson distribution in modeling timestamped events is the fact that it considers the interval in which the events occur and hence can estimate the rate of occurring events more accurately. To elaborate, consider two scenarios: in the first one, three events occur during one month e.g. at days 1, 10, 25. Now assume in the second scenario all the three events occur in a single day, say day 20. The PF based models consider both scenarios the same because Poisson distribution can only work with the aggregated counts. In contrast poisson processes can differentiate between the two scenarios: The first process has higher rate of occurrence in the beginning of the months, while the second process has high activity rates towards the end of the month.
In real-world applications events and times series data are not usually distributed uniformly over the time. For example, the distribution of inter-event durations in many applications such as posting emails, listening to music, twitting and checking into social networks have been shown to be bursty, heavy-tailed and periodic (Zarezade et al., 2016a). Hence they can’t be effectively modeled using poisson distribution and even homogeneous Poisson processes. Non-homogeneous Poisson process is a process with dynamic rate of event occurrence that can capture the complex longitudinal dependencies among events. This process can be uniquely defined using the so-called conditional intensity function, . It encodes the expected rate of occurring event at time given the history of past events, , i.e.,
Using the definition of in eq. (5), the likelihood a list of events () observed during a time window , can be written as
Roughly speaking, the first term denotes the likelihood of occurring event at times , and the second term denotes the likelihood of not occurring events elsewhere. Therefore, if the temporal pattern of occurring events is not uniform the likelihood is maximized by an intensity function that describes the temporal dynamics the best.
One of the most important properties of Poisson processes which makes them an appropriate candidate for modeling temporal events is the fact that the superposition of independent Poisson processes is itself a Poisson process with intensity equal to the summation of other intensities (Kingman, 1993). We use this property to propose a computationally appealing framework for modeling user preferences over time, predicting their future actions, and timely recommending them the appropriate services and products.
3. Recurrent Poisson Factorization
Intuitively, engagement of users with different items is driven by two main factors. Intrinsic user preferences and previous pleasant experiences of her friends or her own. For example, a user in last.fm may listen to an album due to her interest to the genre of the album or she may see her friends listening to the album and hence play it. Figure 1 shows such behavioral pattern. The left matrix shows that user and have listened to music and respectively because of their own initiative. The social network among the users is plotted in the bottom right. The upper right plot shows the events that are triggered by previous events and the arrows show the triggering relation among them. Since user follows user and user listens to music , after some time, user also listens to that music. Furthermore, interest in this song may become viral and also plays it under influence from her followee, user .
Recurrent Poisson Factorization (RPF) is a mathematical framework which models such behavioral patterns and is able to recommend the right item to the right user at the right time by utilizing the recurring temporal patterns in user-item engagement. In the followings, we first specify some notations and then discuss the generative model of RPF.
3.1. Notations and Conventions
Let denotes the set of user-item interactions until time where is the number of interactions up to time . The interaction is a triple which indicates that at time , user interacted with product . In addition to user-item interaction data, we may have the users social relations. In that case, a user may follow a set of users which is denoted by . For clarity, we use the following notation for the remainder of this paper. denotes the set of interactions of user with item until time . We use dot notation to represent union over the dotted variable, e.g., represents the events of user , before time , with any product, and denotes the interactions of all users except , before time , with item .
3.2. Proposed Generative Model
The main idea of RPF is modeling the time of engagement of users with different products as a set of dependent Poisson processes where the intensity of each process consists of two main parts. The intrinsic intensity which denotes the matching between user preferences and items attributes, and the extrinsic intensity which represents the tendency of user to engage with an item triggered by previous user-item interactions. RPF assumes a hierarchical matrix factorization model for intrinsic users interests on items and models the triggering effect of engagement of a user with an item on future user-item interactions using a set of cascade Poisson processes(Simma and Jordan, 2012). In other words, it is assumed that the times of interacting user with item is generated by a Poisson process with the following intensity:
where and are the dimensional latent vectors which denote the interests of user and attributes of item , respectively. The dot product between user interests and the item attributes essentially shows the similarity between them and serves as the user intrinsic intensity to engage with this item. In order to model the effect of previous user-item interactions on the tendency of user to adopt item at time , it is assumed that each of the previous user-item interactions , triggers a Poisson process which increases the tendency of user to engage with item at time by . Since the effect of this interaction usually decreases over time, the exponential function is widely used. That is, in the simplest form, the kernel can be defined as:
where, is the indicator function which shows that the tendency of user to adopt item only depends on her own experiences with that item. can be any integrable function of time and can take a variety of functional forms to capture the complex temporal properties of preference propagation among users and items.
As it was mentioned before, RPF is a general framework for recommendation which can be customized to effectively include different types of information and priors and beliefs. We will introduce three variants of this model in the following.
Hierarchical Recurrent Poisson Factorization (HRPF) assumes a hierarchical prior over the set of and
in order to promote and model the diversity of users and items. Since the gamma distribution is conjugate with the likelihood in eq. (6) and also constrains the latent vectors to be nonnegative and sparse, we use the same idea as in (Gopalan et al., 2015) and consider a gamma prior over these variables with a latent rate parameter, i.e.
where, and are gamma distributed random variables equip RPF with a heterogeneous users and items latent features.
Social Recurrent Poisson Factorization is a variant of RPF that is able to model the impact of social network on users’ actions. In this model, we assume the actions of user are either triggered by her intrinsic interests or by previous actions of her friends. To this end, we propose the following intensity function for user ’s interaction with item :
where, is the latent influence of user on user and is the temporal kernel with parameter capturing the complex longitudinal dependencies among events. This kernel can be any integrable function that represents the impact of an event at time on another event at time . In order to make the influence matrix nonnegative and sparse, we assume a gamma prior over these variables which is also conjugate with likelihood in eq. (6).
Dynamic Recurrent Poisson Factorization (DRPF) is another variant of RPF which models the dynamic interests of users and popularity of items over time. DRPF proposes the following intensity for engaging user with product :
where, and are two processes which denote the preferences of user and attributes of item at time , respectively. is a latent parameter which shows the amount of influence of user by her own previous interactions with items. In order to parametrize and , we assume that these are nonnegative linear combination of simpler processes:
where and are known functions over time and are nonnegative latent variables that should be learnt from data. For example, since the users have similar activity patterns in similar days of week or similar hours of the day, we can use 24-dimensions function , which is only in the th hour of the day. Furthermore, an extra 7 dimensions for weekdays is also added:
and hence we can learn the preference of users in different hours of the day and different days of the week.
Dynamic Social Recurrent Poisson Factorization (DSRPF) is a variant of RPF which combines the features of SRPF and DRPF to jointly models the dynamic interests of users and popularity of items over time and peer influence among users in social network. DSRPF use the following intensity function for the user-item interaction:
3.3. Prediction and Recommendation using RPF
RPF models the tendency of users to engage with different items over time using the proposed intensity function and hence is able to recommend the most appropriate item to the users at any time. In order to do so, we should infer the posterior of the latent variables of the model and compute the expected intensity of user to engage with different items and recommend the items to the user sorted based on the following expected intensity:
Moreover, RPF models are able to predict the returning time of the users to products. To this end we adopt the approach introduced in (Du et al., 2015), i.e. we sample the time of next event from the Poisson process with intensity using Ogata’s thinning algorithm (Ogata, 1981) and report the sample mean as the expected returning time of user to the item.
As it was mentioned in section 3.3, the performance of the model to recommend the right item to the users and predicting the returning time of the users accurately, heavily depends on inferring the posterior of the latent variables efficiently. Since DSRPF model contains all features of other variants of RPF, in this section we propose a scalable inference algorithm for DS-RPF-based on mean-field variational inference (Jordan, 1998).
In order to make the model conditionally conjugate and obtain simple updates, we introduce an auxiliary variable for each user-item interaction , which denotes the factor that triggered . Since the triggering factor of a user-item interaction is either one of its previous events or matching between one of the user ’s feature vector component and product ’s features, therefore, we can define the conditional intensity of an event and its triggering factor as:
Since it’s not possible to find the exact posterior of the latent variables, we consider a factorized distribution over all latent variables and find the distribution that is most similar to the posterior using Bayesian mean field approximation. Namely,
where, is a multinomial distribution and all other factors are gamma distributed. Using mean field theorem, we know that the optimal approximate functions are as follows:
We evaluate the performance of RPF on large-scale synthetic and real world datasets. We show that RPF not only model the recurrent user behaviors over time, but also effectively captures the changes in trends and user interests where other temporal models are incapable of.
The performance of proposed inference algorithm over synthetic data. (a) Mean Absolute Error (MAE) vs. the number of iterations, (b) MAE vs the number of events. (c) Quantile plot of intensity integrals, (d) Run-time vs. the number of events.
5.1. Competitor baselines
To show the performance of RPF in capturing the dynamic preferences and the recurrent consumption behavior we compare it with the recent state-of-the-art PF-based methods. Notably, we compared with DPF (Charlin et al., 2015), which captures the dynamic user preferences, SPF (Chaney et al., 2015), that accounts for the social aspects of product adoption, and HPF (Gopalan et al., 2015), which utilizes a hierarchical structure to better model diverse user preferences. We also selected the Time sensitive recommendation system TSRS (Du et al., 2015), which is a low rank method based on Hawkes process and models user-item interactions when the users are independent.
Also, in order to understand RPF better we evaluated different variants of our proposed framework. They include SRPF, which is a variant of the RPF, which considers the influence-based preference among users; DRPF, that captures the dynamically changing latent preference in the RPF; and DSRPF, which is a version of RPF that enables the peer influence on the social network affects dynamic user preferences.
5.2. Synthetic Data
We first study the effectiveness of the proposed inference algorithm on synthetic data to make sure the model is learnable given a reasonable amount of observations.
Experimental Setup. Our synthetic recommendation task consists of 1000 users and 1000 items. We generated a random network between users with an average degree 50. The parameters of RPF are sampled from the associated distributions introduced in the section 3. Finally, we generated about 1M events using the Ogata’s thinning algorithm (Ogata, 1981). We repeated each experiment 10 times and the results are reported by taking the average over these runs. It is worth mentioning that the events are generated using the proposed DSRPF model.
Results. Figure 2 presents the performance of proposed RPF framework over synthetic data. We reported the Mean Absolute Error (MAE) between the true parameters of the model and the estimated ones. Figure 2a and 2b shows the performance of the proposed inference procedure. Furthermore, the increased number of iterations results in a better fit. More especially, Figure (a)a shows that the proposed method only requires around 300 iterations to converge which shows the fast convergence of the inference algorithm. Figure (b)b presents the MAE over different number of events. As it is expected, with the increase in the number of events the performance of proposed method improves as well. Furthermore, it verifies that the proposed inference algorithm only requires a modest number of events to achieve a good performance. Additionally, we investigate how well the temporal patterns in data is captured by the proposed algorithm. According to the time-change theorem (Daley and Vere-Jones, 2007), given all successive event times of a particular point process with intensity function , the set of intensity integrals
should conform to the unit-rate exponential distribution, if the samples are truly generated from the process. Figure (c)c demonstrates the quantiles of intensity integrals computed using the learned intensities. The conformity of the empirical quintiles and the true ones suggests that the model captures the temporal dynamics very well. Last but not least, we investigate the scalability of algorithm. Figure (d)d shows that with the increase in the number of events the inference algorithm scales almost linearly.
5.3. Real Data
We also evaluate the performance of RPF on two real datasets from different domains; Last.fm and Alibaba Mobile Commerce. Both datasets contain timestamped actions which makes them appropriate benchmark for comparing the proposed method to the other state-of-the-art methods.
Last.fm. This dataset contains the music listening events between 1200 users and 1000 artists. There are around 480000 events in total which spans a period of six months (Celma, 2010).
Tianchi Mobile Data. It contains the user interactions with items in Alibaba’s mobile M-Commerce platform (Yi et al., 2015). The dataset includes four behavior types: click, collect, add-to-cart, and payment. We only considered the click events and used the item categories as the recommendation targets. Our data contains roughly 1000 users , 2100 items, and the total 1200000 events.
Qualitative Analysis. We first explored the fitted model to confirm that the model can capture different patterns in data. Figure 4 represents the summation of the learned intensity of users listening to the Britney Spears thorough time in the Last.fm dataset. We see a sudden increase in the learned intensity at 26th august 2016, which is the time her new album, Glory, was released. It is interesting that there are two other jumps in the learned intensity before this sudden increase at August 11th and August 21st , which are when the track Clumsy and Deluxe version of the album was released. This is how RPF framework can capture different temporal dynamics in item consumptions.
Next, we investigated how much the proposed method can capture the similarity between users’ preferences. To this end, we created the similarity matrix using the learned user preferences . Each entry of the defined similarity matrix is equal to which indicates that how much the latent preferences of users and are close. This is roughly proportional to their shared items of interest. We also created an empirical similarity matrix, using the Jaccard similarity between all pair of users based on the size of shared consumed items. Figures 5a and 5b presents the learned similarity matrix and the empirical one for the Last.fm dataset. Interestingly, these two matrices conform by a reasonable amount. We also highlighted the two blocks of highly similar users in the matrices with squares. As it can be seen, there is a strong correlation between the two matrices, and the blocks match each other. It basically shows the proposed model can efficiently learn user preferences and can capture their similarities.
Item Prediction. Our first quantitative task is predicting the test items that each user will interact with. We generate top
recommendations for each user, using items with the highest probability under each method. The methods are evaluated based onNDCG@k and Recall@k metrics:
where is the number of test data and is the indicator function. Recall@K shows the percentage of items that are ranked in the first . NDCG@k is a weighted version of Recall@K which The interested reader is referred to (Charlin et al., 2015) for their detailed properties.
Figures (a)a,(b)b,(e)e, and (f)f demonstrate the NDCG@k and Recall@k of different methods over Last.fm and Tianchi datasets, respectively. It is noteworthy that since there is no social network in Tianchi data, the result of social based methods (SPF, SRPF, and DSRPF) are not reported on it. For item prediction, RPF-based methods perform significantly better than competitors. We believe this is mostly due to the fact that it can handle temporal nature of the data inherently. Furthermore, TSRS performs marginally better than PF-based methods which is also as expected. It treats time in a proper way. Interestingly, TSRS margin with respect to PF-based methods is higher in Last.fm dataset compared to Tianchi. To explain this observation note that Last.fm’s items are the artists, and users play the songs of an artist sequentially in the sessions. Hence, the history of previous interactions play an important role in determining the next action. TSRS itself has a more emphasis on previous user interactions than the intrinsic user preferences. On the other hand, the Tianchi dataset contains the clicks of users over different items. Therefore, capturing the preferences of users is more central than paying attention to the timings. Therefore, the margin of TSRS and PF-based methods is smaller in this dataset.
We also evaluated the impact of size of recommendation list () and the size of test data on the performance of different methods. Figure (c)c and (g)g show the NDCG@20 for different methods over different sizes of test data. As it can be seen, with the increase in the number of test events the performance of different methods degrades, however, RPF-based methods perform marginally better than competitors in both data sets and the relative order of different methods are preserved with the increase in data.
Figures (d)d and (h)h show the NDCG@k for different methods over different values of . All methods exhibit an early increase in NDCG@k with increase of . Moreover, RPF-based methods consistently being the best ones.
In a nutshell, TSRS pays more attention to the impact of previous events of the user, and less attention is paid to the exact modeling of intrinsic user preferences. It uses constraint optimizations to implicitly consider the impact of different items on each other, while in the RPF-based methods the user preferences are modeled using explicit random variables and are inferred through matrix factorization. Hence the RPF-based methods can better capture both the intrinsic user preferences and the impact of previous events. Among the RPF-based methods, DRPF has many parameters and needs more data to be trained. Over the Last.fm data the number of events per user are significantly fewer than the Tianchi data. Therefore, the DRPF performs better over Tianchi data.
Returning Time Prediction. Finally, we evaluated the performance of different methods in predicting the time when a user will return to the system. To this end, we predict the next time a user will do an action and compute the MAE between the estimated time and the ground-truth time. We report the average results over all users in Figure 6. Figures 6a and 6c show that all the RPF-based methods perform better than the TSRS. This is due to the fact that the proposed RPF-based methods model the dynamics of user interests and consider the peer influence of the neighboring users consuming a product. Hence, they are more expressive than the TSRS which assumes that the user-item interactions are independent.
We also plotted the Quantile plot for different methods. To this end, we compare the theoretical quantiles from the exponential distribution with the ones that each model has learnt from real-world data. The closer the slope is to one, the better a model matches the event patterns. Figures 6b and 6d show that the RPF-based models fit the observed event sequence better than the TSRS. Over the Last.fm dataset, DSRPF that utilizes both the peer influence and the dynamic user preferences, better fits the real data. On the Tianchi recommendation task, the DRPF better fits the real data. This is due to the large number of events per user-item on this dataset, which helps the DRPF to capture the true dynamics of real data.
We present a novel framework, Recurrent Poison Factorization (RPF), for building recommendation systems from implicit feedback data. RPF extends the Poisson factorization (PF) methods by modeling the aggregated count data with a Poisson process, therefore, enabling the model to account for recurrent activities and answering time-sensitive queries. Moreover, The proposed variational inference is able to scale to large datasets using implicit information. RPF can handle the change of users and items specification through time (DRPF), can consider socially-influenced user preferences (SRPF), and is able to capture the heterogeneity amongst users and items (HRPF). Experiments on synthetic data and two real world datasets demonstrate superiority of the proposed framework over several state-of-the-art methods on item prediction and returning time prediction – thanks to its temporal capabilities. Furthermore, in terms of interpretability, our model is able to discover interesting patterns such as peer influence between users, trending products, and their temporal properties.
For future work, we would like to incorporate nonparametric models into RPF in order to add more flexibility on capturing dynamic preferences and peer influences. Another interesting venue for future work is utilizing generative deep neural networks to model the intensity functions.
- Celma (2010) O. Celma. 2010. Music Recommendation and Discovery in the Long Tail. Springer.
- Chaney et al. (2015) Allison JB Chaney, David M Blei, and Tina Eliassi-Rad. 2015. A probabilistic model for using social networks in personalized item recommendation. In Proceedings of the 9th ACM Conference on Recommender Systems. ACM, 43–50.
- Charlin et al. (2015) Laurent Charlin, Rajesh Ranganath, James McInerney, and David M Blei. 2015. Dynamic poisson factorization. In Proceedings of the 9th ACM Conference on Recommender Systems. ACM, 155–162.
- Daley and Vere-Jones (2007) Daryl J Daley and David Vere-Jones. 2007. An introduction to the theory of point processes: volume II: general theory and structure. Springer Science & Business Media.
- Du et al. (2016) Nan Du, Hanjun Dai, Rakshit Trivedi, Utkarsh Upadhyay, Manuel Gomez-Rodriguez, and Le Song. 2016. Recurrent marked temporal point processes: Embedding event history to vector. In Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 1555–1564.
- Du et al. (2015) Nan Du, Yichen Wang, Niao He, Jimeng Sun, and Le Song. 2015. Time-sensitive recommendation from recurrent user activities. In Advances in Neural Information Processing Systems. 3492–3500.
- Gopalan et al. (2015) Prem Gopalan, Jake M Hofman, and David M Blei. 2015. Scalable Recommendation with Hierarchical Poisson Factorization.. In UAI. 326–335.
- Gopalan et al. (2014) Prem Gopalan, Francisco J Ruiz, Rajesh Ranganath, and David M Blei. 2014. Bayesian Nonparametric Poisson Factorization for Recommendation Systems.. In AISTATS. 275–283.
- Gopalan et al. (2014) Prem K Gopalan, Laurent Charlin, and David Blei. 2014. Content-based recommendations with poisson factorization. In Advances in Neural Information Processing Systems. 3176–3184.
- Jing and Smola (2017) How Jing and Alexander J Smola. 2017. Neural Survival Recommender. In Proceedings of the Tenth ACM International Conference on Web Search and Data Mining. ACM, 515–524.
- Jordan (1998) Michael Irwin Jordan. 1998. Learning in graphical models. Vol. 89. Springer Science & Business Media.
- Khodadadi et al. (2017) Ali Khodadadi, Seyed Abbas Hosseini, Erfan Tavakoli, and Hamid R Rabiee. 2017. Continuous-Time User Modeling in the Presence of Badges: A Probabilistic Approach. arXiv preprint arXiv:1702.01948 (2017).
- Kingman (1993) John Frank Charles Kingman. 1993. Poisson processes. Wiley Online Library.
- Koren (2010) Yehuda Koren. 2010. Collaborative filtering with temporal dynamics. Commun. ACM 53, 4 (2010), 89–97.
- Ogata (1981) Yosihiko Ogata. 1981. On Lewis’ simulation method for point processes. IEEE Transactions on Information Theory 27, 1 (1981), 23–31.
- Salakhutdinov and Mnih (2007) Ruslan Salakhutdinov and Andriy Mnih. 2007. Probabilistic Matrix Factorization. In Proceedings of the 20th International Conference on Neural Information Processing Systems. Curran Associates Inc., 1257–1264.
- Simma and Jordan (2012) Aleksandr Simma and Michael I Jordan. 2012. Modeling events with cascades of Poisson processes. arXiv preprint arXiv:1203.3516 (2012).
- Valera and Gomez-Rodriguez (2015) Isabel Valera and Manuel Gomez-Rodriguez. 2015. Modeling adoption and usage of competing products. In Data Mining (ICDM), 2015 IEEE International Conference on. IEEE, 409–418.
- Wang et al. (2016) Yichen Wang, Nan Du, Rakshit Trivedi, and Le Song. 2016. Coevolutionary latent feature processes for continuous-time user-item interactions. In Advances in Neural Information Processing Systems. 4547–4555.
- Yi et al. (2015) Z. Yi, D. Wang, K. Hu, and Q. Li. 2015. Purchase Behavior Prediction in M-Commerce with an Optimized Sampling Methods. In 2015 IEEE International Conference on Data Mining Workshop (ICDMW). 1085–1092. DOI:http://dx.doi.org/10.1109/ICDMW.2015.69
- Zarezade et al. (2016a) Ali Zarezade, Sina Jafarzadeh, and Hamid R Rabiee. 2016a. Spatio-Temporal Modeling of Check-ins in Location-Based Social Networks. arXiv preprint arXiv:1611.07710 (2016).
Zarezade et al. (2016b)
Ali Zarezade, Ali
Khodadadi, Mehrdad Farajtabar, Hamid R
Rabiee, and Hongyuan Zha.
Correlated Cascades: Compete or Cooperate. In
Proceedings of the 31st AAAI Conference on Artificial Intelligence.