Abstract
Whether or not the C2C customers would click the advertisement heavily relies on advertisement content relevance and customers’ searching progress. For example, when starting a purchasing task, customers are more likely to click the advertisements of their target products; while approaching the end, advertisements on accessories of the target products may interest the customers more. Therefore, the understanding of search progress on target products is very important in improving adaptive advertisement strategies. Search progress can be estimated by the time spent on the target product and the total time will be spent on this product. For the purpose of providing important information for product progress estimation, we propose a product duration prediction problem. Due to the similarities between the product duration prediction problem and user preference prediction problem (e.g. Large number of users, a history of past behaviors and ratings), the present work relies on the collaborative filtering method to estimate the searching duration of performing a purchasing task. Comparing neighbor-based, singular vector decomposition(SVD) and biased SVD method, we find biased SVD is superior to the others.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Al halabi, W.S., Kubat, M., Tapia, M.: Time spent on a web page is sufficient to infer a user’s interest. In: IMSA 2007: IASTED European Conference on Proceedings of the IASTED European Conference, pp. 41–46. ACTA Press, Anaheim (2007)
Xiao, G., Gong, Z.: Personalized Delivery of On—Line Search Advertisement Based on User Interests. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, Q.-M. (eds.) APWeb/WAIM 2009. LNCS, vol. 5446, pp. 198–210. Springer, Heidelberg (2009)
Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. In: Adv. in Artif. Intell. 2009, vol. 2 (2009)
Sarwar, B., Karypis, G., Konstan, J., Reidl, J.: Item-based collaborative filtering recommendation algorithms. In: WWW 2001: Proceedings of the 10th International Conference on World Wide Web, pp. 285–295. ACM, New York (2001)
Koren, Y.: Factorization meets the neighborhood: a multifaceted collaborative filtering model. In: KDD 2008: Proceeding of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 426–434. ACM, New York (2008)
Jones, R., Klinkner, K.L.: Beyond the session timeout: automatic hierarchical segmentation of search topics in query logs. In: CIKM 2008: Proceeding of the 17th ACM Conference on Information and Knowledge Management, pp. 699–708. ACM, New York (2008)
Funk, S.: Netflix update: Try this at home, http://sifter.org/~simon/journal/20061211.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, Z., Wang, Y., Xue, Gr., Yu, Y. (2010). Predicting Product Duration for Adaptive Advertisement. In: Cao, L., Zhong, J., Feng, Y. (eds) Advanced Data Mining and Applications. ADMA 2010. Lecture Notes in Computer Science(), vol 6441. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17313-4_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-17313-4_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17312-7
Online ISBN: 978-3-642-17313-4
eBook Packages: Computer ScienceComputer Science (R0)