Turning Clicks into Purchases: Revenue Optimization for Product Search in E-Commerce

被引:71
作者
Wu, Liang [1 ]
Hu, Diane [2 ]
Hong, Liangjie [2 ]
Liu, Huan [1 ]
机构
[1] Arizona State Univ, Tempe, AZ 85281 USA
[2] Etsy Inc, Brooklyn, NY USA
来源
ACM/SIGIR PROCEEDINGS 2018 | 2018年
基金
美国国家科学基金会;
关键词
E-Commerce; Search logs; Revenue; INFORMATION;
D O I
10.1145/3209978.3209993
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In recent years, product search engines have emerged as a key factor for online businesses. According to a recent survey, over 55% of online customers begin their online shopping journey by searching on an E-Commerce (EC) website like Amazon as opposed to a generic web search engine like Google(1). Information retrieval research to date has been focused on optimizing search ranking algorithms for web documents while little attention has been paid to product search. There are several intrinsic differences between web search and product search that make the direct application of traditional search ranking algorithms to EC search platforms difficult. First, the success of web and product search is measured differently; one seeks to optimize for relevance while the other must optimize for both relevance and revenue. Second, when using real-world EC transaction data, there is no access to manually annotated labels. In this paper, we address these differences with a novel learning framework for EC product search called LETORIF (LEarning TO Rank with Implicit Feedback). In this framework, we utilize implicit user feedback signals (such as user clicks and purchases) and jointly model the different stages of the shopping journey to optimize for EC sales revenue. We conduct experiments on real-world EC transaction data and introduce a a new evaluation metric to estimate expected revenue after re-ranking. Experimental results show that LETORIF outperforms top competitors in improving purchase rates and total revenue earned.
引用
收藏
页码:365 / 374
页数:10
相关论文
共 44 条
[1]  
[Anonymous], 2003, Journal of machine learning research
[2]  
Aryafar Kamelia, 2017, P ADKDD 17, V10
[3]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32
[4]  
Burges C., 2005, P 22 INT C MACH LEAR, P89
[5]  
Burges C. J., 2010, Learning, V11, DOI DOI 10.1111/J.1467-8535
[6]  
Cao Z., 2007, P 24 INT C MACH LEAR, P129, DOI [DOI 10.1145/1273496.1273513, 10.1145/1273496.1273513]
[7]   LIBSVM: A Library for Support Vector Machines [J].
Chang, Chih-Chung ;
Lin, Chih-Jen .
ACM TRANSACTIONS ON INTELLIGENT SYSTEMS AND TECHNOLOGY, 2011, 2 (03)
[8]   Measuring and Predicting Search Engine Users' Satisfaction [J].
Dan, Ovidiu ;
Davison, Brian D. .
ACM COMPUTING SURVEYS, 2016, 49 (01)
[9]   Supporting Keyword Search in Product Database: A Probabilistic Approach [J].
Duan, Huizhong ;
Zhai, ChengXiang ;
Cheng, Jinxing ;
Gattani, Abhishek .
PROCEEDINGS OF THE VLDB ENDOWMENT, 2013, 6 (14) :1786-1797
[10]   A decision-theoretic generalization of on-line learning and an application to boosting [J].
Freund, Y ;
Schapire, RE .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1997, 55 (01) :119-139