Selecting an optimal set of keyword for search engine advertising

Authors

  • Minhoe Hur Seoul National University
  • Songwon Han Seoul National University
  • Hongtae Kim Seoul National University
  • Sungzoon Cho Seoul National University

DOI:

https://doi.org/10.23055/ijietap.2015.22.1.1281

Keywords:

Search Engine Marketing, Ad keywords, Query logs, Knapsack problem, Genetic Algorithm

Abstract

Online advertisers who want their website to be shown in the web search pages need to bid for relevant keywords. Selecting such keywords in advertising is challenging because they need to find relevant keywords of different click volumes and costs. Recent works focused on merely generating a list of words by using semantic or statistical methodologies. However, limited previous studies do not guarantee that those keywords will be used by customers and subsequently provide large traffic volume with lower costs. In this study, we propose a novel approach of generating relevant keywords by combining search log mining and proximity-based approach. Subsequently the optimal set of keywords with a higher volume while minimizing costs was determined. Experiment results show that our method generate an optimal set of keywords that are not only accurate, but also attract more click volume with less cost.

Author Biographies

Minhoe Hur, Seoul National University

Ph.D. Candidate in the Department of Industrial Engineering 

Songwon Han, Seoul National University

M.S. Candidate in the Department of Industrial Engineering 

Hongtae Kim, Seoul National University

M.S. Candidate in the Department of Industrial Engineering 

Sungzoon Cho, Seoul National University

Professor in the Department of Industrial Engineering 

Published

2015-02-27

How to Cite

Hur, M., Han, S., Kim, H., & Cho, S. (2015). Selecting an optimal set of keyword for search engine advertising. International Journal of Industrial Engineering: Theory, Applications and Practice, 22(1). https://doi.org/10.23055/ijietap.2015.22.1.1281

Issue

Section

Special Issue: 2013 IJIE Conference at Busan, Korea