ACM Home Page
Please provide us with feedback. Feedback
Competitive analysis from click-through log
Full text PdfPdf (666 KB)
Source
International World Wide Web Conference archive
Proceedings of the 18th international conference on World wide web table of contents
Madrid, Spain
POSTER SESSION: Wednesday, April 22, 2009 table of contents
Pages 1051-1052  
Year of Publication: 2009
ISBN:978-1-60558-487-4
Authors
Gang Wang  Microsoft Research Asia, Beijing, China
Jian Hu  Microsoft Research Asia, Beijing, China
Yunzhang Zhu  Department of Fundamental Science, Tsinghua University, Beijing, China
Hua Li  Microsoft, Redmond, WA, USA
Zheng Chen  Microsoft Research Asia, Beijing, China
Sponsor
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 25,   Downloads (12 Months): 101,   Citation Count: 0
Additional Information:

abstract   references   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/1526709.1526851
What is a DOI?

ABSTRACT

Existing keyword suggestion tools from various search engine companies could automatically suggest keywords related to the advertisers' products or services, counting in simple statistics of the keywords, such as search volume, cost per click (CPC), etc. However, the nature of the generalized Second Price Auction suggests that better understanding the competitors' keyword selection and bidding strategies better helps to win the auction, other than only relying on general search statistics. In this paper, we propose a novel keyword suggestion strategy, called Competitive Analysis, to explore the keyword based competition relationships among advertisers and eventually help advertisers to build campaigns with better performance. The experimental results demonstrate that the proposed Competitive Analysis can both help advertisers to promote their product selling and generate more revenue to the search engine companies.


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
V. Krishna. Auction Theory. Academic Press, 2002.
 
2
J. Norris. Markov Chains. Cambridge University Press, 1998.
3
 
4
S. C. Deerwester, S. T. Dumais, T. K. Landauer, G. W. Furnas, and R. A. Harshman. Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41(6):391--407, 1990.
5
 
6
Turney, P.D., Coherent Keyphrase extraction via web mining. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI-03), 2003.
 
7
Kelleher, D. and Luz, S., Automatic hypertext keyphrase detection. In Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-05), 2005.
8

Collaborative Colleagues:
Gang Wang: colleagues
Jian Hu: colleagues
Yunzhang Zhu: colleagues
Hua Li: colleagues
Zheng Chen: colleagues