ACM Home Page
Please provide us with feedback. Feedback
Keyword generation for search engine advertising using semantic similarity between terms
Full text PdfPdf (213 KB)
Source
ACM International Conference Proceeding Series; Vol. 258 archive
Proceedings of the ninth international conference on Electronic commerce table of contents
Minneapolis, MN, USA
SESSION: Session M4: sponsored search on the internet I table of contents
Pages: 89 - 94  
Year of Publication: 2007
ISBN:978-1-59593-700-1
Authors
Vibhanshu Abhishek  The Wharton School, Philadelphia, PA
Kartik Hosanagar  The Wharton School, Philadelphia, PA
Sponsors
SIGART: ACM Special Interest Group on Artificial Intelligence
ACM: Association for Computing Machinery
SIGEcom: ACM Special Interest Group on Electronic Commerce
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 274,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1282100.1282119
What is a DOI?

ABSTRACT

An important problem in search engine advertising is key-word1 generation. In the past, advertisers have preferred to bid for keywords that tend to have high search volumes and hence are more expensive. An alternate strategy involves bidding for several related but low volume, inexpensive terms that generate the same amount of traffic cumulatively but are much cheaper. This paper seeks to establish a mathematical formulation of this problem and suggests a method for generation of several terms from a seed keyword. This approach uses a web based kernel function to establish semantic similarity between terms. The similarity graph is then traversed to generate keywords that are related but cheaper.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Google adword https://adwords.google.com/.
 
2
Natpal http://www.natpal.com/.
 
3
Wordtracker http://www.wordtracker.com/.
 
4
Iab internet advertising revenue report. Technical report, Price Waterhouse Coopers, April 2005.
 
5
K. Bartz, V. Murthi, and S. Sebastian. Logistic regression and collaborative filtering for sponsored search term recommendation. In Second Workshop on Sponsored Search Auctions, 2006.
 
6
C. Buckley, G. Salton, J. Allan, and A. Singhal. Automatic query expansion using smart: Trec 3. Information Processing and Management, 1994.
 
7
K. Hosanagar and P. E. Stavrinides. Optimal bidding in search auctions. In International Symposium of Information Systems, ISB, Hyderabad, India, 2006.
 
8
 
9
J. S. Kandola, J. Shawe-Taylor, and N. Cristianini. Learning semantic similarity. In NIPS, 2002.
 
10
B. Kitts and B. Leblanc. Optimal bidding on keyword auctions. Electronic Markets, 2004.
 
11
M. Porter. An algorithm for suffix stripping. Program, 1980.
 
12
M. Sahami and T. Heilman. A web-based kernel function for matching short text snippets. In International Conference on Machine Learning, 2005.
 
13
B. K. Szymanski and J. -S. Lee. Impact of roi on bidding and revenue in sponsored search advertisement auctions. In Second Workshop on Sponsored Search Auctions, 2006.


Collaborative Colleagues:
Vibhanshu Abhishek: colleagues
Kartik Hosanagar: colleagues