EGM: Enhanced Graph-based Model for Large-scale Video Advertisement Search

被引:2
作者
Yu, Tan [1 ]
Liu, Jie [2 ]
Yang, Yi [2 ]
Li, Yi [2 ]
Fei, Hongliang [1 ]
Li, Ping [1 ]
机构
[1] Baidu Res, Cognit Comp Lab, Bellevue, WA 96521 USA
[2] Baidu Inc, Baidu Search Ads Phoenix Nest, Beijing, Peoples R China
来源
PROCEEDINGS OF THE 28TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, KDD 2022 | 2022年
关键词
cross-modal matching; text-image retrieval; advertising; NEAREST-NEIGHBOR SEARCH; PRODUCT QUANTIZATION; RETRIEVAL;
D O I
10.1145/3534678.3539061
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Video advertisements may grasp customers' attention instantly and are often adored by advertisers. Since the corpus is vast, achieving an efficient query-to-video search can be challenging. Because traditional approximate nearest neighborhood (ANN) search methods are based simple similarities (e.g., cosine or inner products) on embedding vectors. They are often not sufficient for bridging the modal gap between a text query and video advertisements and typically can only achieve sub-optimal performance in query-to-video search. Tree-based deep model (TDM) overcomes the limited matching capability of embedding-based methods but suffers from the data sparsity problem. Deep retrieval model adopts a graph-based model which overcomes the data sparsity problem in TDM by sharing the nodes. But the shared nodes entangle features of different items, making it difficult to distinguish similar items. In this work, we enhance the graph-based model through sub-path embedding to differentiate similar videos. The added sub-path embedding provides personalized characteristics, beneficial for modeling fine-grain details to discriminate similar items. After launching enhanced graph model (EGM), the click-through rate (CTR) relatively increases by 1.33%, and the conversion rate (CVR) relatively by 1.07%.
引用
收藏
页码:4443 / 4451
页数:9
相关论文
共 52 条
[1]  
André F, 2015, PROC VLDB ENDOW, V9, P288
[2]  
[Anonymous], 2018, P EUR C COMP VIS ECC, DOI DOI 10.1007/978-3-030-01246-512
[3]  
Berchtold S, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P28
[4]   Hashing with Mutual Information [J].
Cakir, Fatih ;
He, Kun ;
Bargal, Sarah Adel ;
Sclaroff, Stan .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2019, 41 (10) :2424-2437
[5]   Hashing with Binary Matrix Pursuit [J].
Cakir, Fatih ;
He, Kun ;
Sclaroff, Stan .
COMPUTER VISION - ECCV 2018, PT V, 2018, 11209 :344-361
[6]  
Cao Y, 2017, AAAI CONF ARTIF INTE, P3974
[7]   Deep Visual-Semantic Quantization for Efficient Image Retrieval [J].
Cao, Yue ;
Long, Mingsheng ;
Wang, Jianmin ;
Liu, Shichen .
30TH IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR 2017), 2017, :916-925
[8]  
Cao Y, 2016, AAAI CONF ARTIF INTE, P3457
[9]   Histograms of oriented gradients for human detection [J].
Dalal, N ;
Triggs, B .
2005 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, VOL 1, PROCEEDINGS, 2005, :886-893
[10]   MOBIUS: Towards the Next Generation of Query-Ad Matching in Baidu's Sponsored Search [J].
Fan, Miao ;
Guo, Jiacheng ;
Zhu, Shuai ;
Miao, Shuo ;
Sun, Mingming ;
Li, Ping .
KDD'19: PROCEEDINGS OF THE 25TH ACM SIGKDD INTERNATIONAL CONFERENCCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2019, :2509-2517