Keyword Optimization in Sponsored Search Advertising: A Multi-Level Computational Framework

• URL: http://arxiv.org/abs/2202.13506v1
• Date: Mon, 28 Feb 2022 02:03:14 GMT
• Title: Keyword Optimization in Sponsored Search Advertising: A Multi-Level Computational Framework
• Authors: Yanwu Yang, Bernard J. Jansen, Yinghui Yang, Xunhua Guo, Daniel Zeng
• Abstract summary: Keywords serve as an essential bridge linking advertisers, search users and search engines. This paper proposes a multi-level and closed-form computational framework for keyword optimization.
• Score: 20.22050119811848
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: In sponsored search advertising, keywords serve as an essential bridge linking advertisers, search users and search engines. Advertisers have to deal with a series of keyword decisions throughout the entire lifecycle of search advertising campaigns. This paper proposes a multi-level and closed-form computational framework for keyword optimization (MKOF) to support various keyword decisions. Based on this framework, we develop corresponding optimization strategies for keyword targeting, keyword assignment and keyword grouping at different levels (e.g., market, campaign and adgroup). With two real-world datasets obtained from past search advertising campaigns, we conduct computational experiments to evaluate our keyword optimization framework and instantiated strategies. Experimental results show that our method can approach the optimal solution in a steady way, and it outperforms two baseline keyword strategies commonly used in practice. The proposed MKOF framework also provides a valid experimental environment to implement and assess various keyword strategies in sponsored search advertising.

Related papers

• Towards a Unified View of Preference Learning for Large Language Models: A Survey [88.66719962576005]
  Large Language Models (LLMs) exhibit remarkably powerful capabilities. One of the crucial factors to achieve success is aligning the LLM's output with human preferences. We decompose all the strategies in preference learning into four components: model, data, feedback, and algorithm.
  arXiv  Detail & Related papers  (2024-09-04T15:11:55Z)
• Visual Prompt Selection for In-Context Learning Segmentation [77.15684360470152]
  In this paper, we focus on rethinking and improving the example selection strategy. We first demonstrate that ICL-based segmentation models are sensitive to different contexts. Furthermore, empirical evidence indicates that the diversity of contextual prompts plays a crucial role in guiding segmentation.
  arXiv  Detail & Related papers  (2024-07-14T15:02:54Z)
• Efficient Image-Text Retrieval via Keyword-Guided Pre-Screening [53.1711708318581]
  Current image-text retrieval methods suffer from $N$-related time complexity. This paper presents a simple and effective keyword-guided pre-screening framework for the image-text retrieval.
  arXiv  Detail & Related papers  (2023-03-14T09:36:42Z)
• Keyword Decisions in Sponsored Search Advertising: A Literature Review and Research Agenda [0.0]
  Keywords serve as the basic unit of business model, linking three stakeholders: consumers, advertisers and search engines. This paper presents an overarching framework for keyword decisions that highlights the touchpoints in search advertising management. Using this framework, we review the state-of-the-art research literature on keyword decisions with respect to techniques, input features and evaluation metrics.
  arXiv  Detail & Related papers  (2023-02-24T00:24:17Z)
• Keyword Targeting Optimization in Sponsored Search Advertising: Combining Selection and Matching [0.0]
  An optimal keyword targeting strategy guarantees reaching the right population effectively. This paper aims to address the keyword targeting problem, which is a challenging task because of the incomplete information of historical advertising performance indices. Experimental results show that, (a) BB-KSM outperforms seven baselines in terms of profit; (b) BB-KSM shows its superiority as the budget increases.
  arXiv  Detail & Related papers  (2022-10-19T03:37:32Z)
• Domain Representative Keywords Selection: A Probabilistic Approach [39.24258854355122]
  We propose a probabilistic approach to select a subset of a textittarget domain representative keywords from a candidate set, contrasting with a context domain. We introduce an textitoptimization algorithm for selecting the subset from the generated candidate distribution. Experiments on multiple domains demonstrate the superiority of our approach over other baselines for the tasks of keyword summary generation and trending keywords selection.
  arXiv  Detail & Related papers  (2022-03-19T18:04:12Z)
• Aggregate effects of advertising decisions: a complex systems look at search engine advertising via an experimental study [26.218512292529635]
  We develop and validate a simulation framework that supports assessments of various advertising strategies and estimations of the impact of mechanisms on the search market. We conduct three experiments on the aggregate impact of electronic word-of-mouth, the competition level, and strategic bidding behaviors.
  arXiv  Detail & Related papers  (2022-03-04T09:16:15Z)
• Optimal Keywords Grouping in Sponsored Search Advertising under Uncertain Environments [0.0]
  This paper proposes a programming model for keywords grouping. It takes click-through rate and conversion rate as random variables. A branch-and-bound algorithm is developed to solve our model.
  arXiv  Detail & Related papers  (2022-03-04T08:54:50Z)
• Semantic Search for Large Scale Clinical Ontologies [63.71950996116403]
  We present a deep learning approach to build a search system for large clinical vocabularies. We propose a Triplet-BERT model and a method that generates training data based on semantic training data. The model is evaluated using five real benchmark data sets and the results show that our approach achieves high results on both free text to concept and concept to searching concept vocabularies.
  arXiv  Detail & Related papers  (2022-01-01T05:15:42Z)
• Portfolio Search and Optimization for General Strategy Game-Playing [58.896302717975445]
  We propose a new algorithm for optimization and action-selection based on the Rolling Horizon Evolutionary Algorithm. For the optimization of the agents' parameters and portfolio sets we study the use of the N-tuple Bandit Evolutionary Algorithm. An analysis of the agents' performance shows that the proposed algorithm generalizes well to all game-modes and is able to outperform other portfolio methods.
  arXiv  Detail & Related papers  (2021-04-21T09:28:28Z)
• Keyphrase Extraction with Dynamic Graph Convolutional Networks and Diversified Inference [50.768682650658384]
  Keyphrase extraction (KE) aims to summarize a set of phrases that accurately express a concept or a topic covered in a given document. Recent Sequence-to-Sequence (Seq2Seq) based generative framework is widely used in KE task, and it has obtained competitive performance on various benchmarks. In this paper, we propose to adopt the Dynamic Graph Convolutional Networks (DGCN) to solve the above two problems simultaneously.
  arXiv  Detail & Related papers  (2020-10-24T08:11:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.