Please use this identifier to cite or link to this item:
|Title:||Increasing temporal diversity with purchase intervals|
|Source:||Zhao, G.,Lee, M.L.,Hsu, W.,Chen, W. (2012). Increasing temporal diversity with purchase intervals. SIGIR'12 - Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval : 165-174. ScholarBank@NUS Repository. https://doi.org/10.1145/2348283.2348309|
|Abstract:||The development of Web 2.0 technology has led to huge economic benefits and challenges for both e-commerce websites and online shoppers. One core technology to increase sales and consumers' satisfaction is the use of recommender systems. Existing product recommender systems consider the order of items purchased by users to obtain a list of recommended items. However, they do not consider the time interval between the products purchased. For example, there is often an interval of 2-3 months between the purchase of printer ink cartridges or refills. Thus, recommending appropriate ink cartridges one week before the user needs to replace the depleted ink cartridges would increase the likelihood of a purchase decision. In this paper, we propose to utilize the purchase interval information to improve the performance of the recommender systems for e-commerce. We design an efficient algorithm to compute the purchase intervals between product pairs from users' purchase history and integrate this information into the marginal utility model. We evaluate our approach on a real world ecommerce dataset. Experimental results demonstrate that our approach significantly improves the conversion rate and temporal diversity compared to state-of-the-art algorithms. © 2012 ACM.|
|Source Title:||SIGIR'12 - Proceedings of the International ACM SIGIR Conference on Research and Development in Information Retrieval|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 13, 2017
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.