AI summary · arXiv: 2111.00926v1 · cs.IR

Heterogeneous Graph Neural Networks for Large-Scale Bid Keyword Matching

Zongtao Liu, Bin Ma, Quan Liu, Jian Xu, Bo Zheng

Original paper · DOI Submitted to arXiv on 01 Nov. 2021 10 pages License: NONEXCLUSIVE-DISTRIB 1.0

The essentials

  • E-commerce relies heavily on digital advertising
  • Taobao and Amazon use digital advertising as a critical component
  • Advertiser-side services are becoming increasingly important
  • Sponsored search is a fundamental service that provides marketing tools to advertisers
  • Existing methods for keyword recommendation neglect rich heterogeneous interactions
  • Researchers face challenges in learning enriched and robust embeddings from complex interactions among various types of objects, and conducting high-quality matching for new ads that usually lack sufficient data.
  • HetMatch is a heterogeneous-graph-neural-network-based model for keyword matching developed by the authors to address these challenges.
  • HetMatch extracts enriched and robust embeddings among rich relations by designing a hierarchical structure that fuses and enhances relevant neighborhood patterns both on the micro-and macro-levels.
  • HetMatch involves more positive samples for cold-start ads through its multi-view framework.
  • Experimental results on a large-scale industrial dataset as well as online AB tests exhibit the effectiveness of HetMatch.

Key points written by AI: they may contain errors, check them against the paper.

AI-generated keywords: HetMatch Keyword Matching Digital Advertising Sponsored Search Graph Neural Networks

Read further

  • Comprehensive Summary
  • Layman's Summary
  • Blog article
  • Original abstract
The world of e-commerce relies heavily on digital advertising, with platforms like Taobao and Amazon using it as a critical component. While consumer-focused issues such as click-through rate (CTR) and conversion rate (CVR) prediction have garnered attention in recent years, the advertiser side is becoming increasingly important. Sponsored search is a fundamental service that provides marketing tools to advertisers. The primary step in keyword recommendation for sponsored search is keyword matching which has been addressed by existing methods that model relevance based on a single type of relation among ads and keywords, such as query clicks or text similarity. However, these approaches neglect the rich heterogeneous interactions hidden behind them. To address this gap in knowledge, researchers face several challenges when it comes to keyword matching: how to learn enriched and robust embeddings from complex interactions among various types of objects; and how to conduct high-quality matching for new ads that usually lack sufficient data. To overcome these challenges, the authors developed HetMatch - a heterogeneous-graph-neural-network-based model for keyword matching - which has been deployed both online and offline at the core sponsored search platform of Alibaba Group. HetMatch extracts enriched and robust embeddings among rich relations by designing a hierarchical structure that fuses and enhances relevant neighborhood patterns both on the micro- and macro-levels. Additionally, by proposing a multi-view framework, HetMatch can involve more positive samples for cold-start ads. Experimental results on a large-scale industrial dataset as well as online AB tests exhibit the effectiveness of HetMatch. Overall, this paper highlights the importance of advertiser-side services in digital advertising platforms like Taobao and Amazon. It also sheds light on the challenges associated with keyword matching while introducing HetMatch - an effective solution that leverages heterogeneous graph neural networks to extract enriched embeddings from complex interactions among various types of objects.

Was this synthesis useful?

Score: 0

Why do we need votes?

Votes are used to determine whether we need to re-run our summarizing tools. If the count reaches -10, our tools can be restarted.

Ask questions about this paper to our AI assistant

You can also chat with multiple papers at once here.

⚠The license of the paper does not allow us to build upon its content and the AI assistant only knows about the paper metadata rather than the full article.

Figures and plots

Ask about a figure by number or use its question button to request visual analysis. Up to two figures and four image panels per question. Values read from plots are approximate; check the original data.

AI assistant instructions?

Tools for this paper

Explain it differently 3 free rewrites left today
Save to a collection Group papers in collections to compare them, chat with them and export them. Create a free account Log in

Advanced tools Premium

For researchers who follow a field closely: citation alerts, journal-club slides, version comparison and Zotero export. Discover Premium

Zotero
Citation alerts
Journal club Slides to present it
For journalists Press kit and hype check

Similar papers summarized with our AI tools

Navigate through even more similar papers through a

tree representation

The previous summary was created more than a year ago and can be re-run (if necessary) by clicking on the Run button below.

⚠The license of this specific paper does not allow us to build upon its content and the summarizing tools will be run using the paper metadata rather than the full article. However, it still does a good job, and you can also try our tools on papers with more open licenses.

Disclaimer: The AI-based summarization tool and virtual assistant provided on this website may not always provide accurate and complete summaries or responses. We encourage you to carefully review and evaluate the generated content to ensure its quality and relevance to your needs.