skip to main content
10.1145/2983323.2983904acmconferencesArticle/Chapter ViewAbstractPublication PagescikmConference Proceedingsconference-collections
short-paper

A Preference Approach to Reputation in Sponsored Search

Published:24 October 2016Publication History

ABSTRACT

Determining reputation of an advertiser in sponsored search is a recent important problem with direct impact on revenue for web publishers and relevance of ads. Individual performance of advertisers is usually expressed through observed click through rate, which depends on advertiser reputation, ad relevance and position. However, advertiser reputation has not been explicitly modeled in click prediction literature. Using traditional approaches in web page popularity for organic search in this context is not reasonable as the notion of link-structure in web is not directly applicable to sponsored search. In this study, we motivate and propose a pairwise preference relation model to study the advertiser reputation problem. Pairwise comparisons of advertisers give information over and above the information available in their individual historical performances. We relate the notion of preference among the advertisers to the spectral properties of the preference graph. We provide empirical evidence of the existence of reputation bias in click behavior. Consequently, we experiment with this signal to improve click prediction.

References

  1. C. H. Ding, H. Zha, X. He, P. Husbands, and H. D. Simon. Link analysis: hubs and authorities on the world wide web. SIAM review, pages 256--268, 2004.Google ScholarGoogle Scholar
  2. C. Dwork, R. Kumar, M. Naor, and D. Sivakumar. Rank aggregation methods for the web. In Proc. WWW, pages 613--622. ACM, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. T. Graepel, J. Q. Candela, T. Borchert, and R. Herbrich. Web-scale bayesian click-through rate prediction for sponsored search advertising in Microsoft's bing search engine. In Proc. ICML, 2010.Google ScholarGoogle Scholar
  4. T. H. Haveliwala. Topic-sensitive pagerank. In Proc. WWW, pages 517--526. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Joachims. Optimizing search engines using clickthrough data. In Proc. SIGKDD. ACM, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Kempe and M. Mahdian. A cascade model for externalities in sponsored search. In Internet and Network Economics, pages 585--596. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. S. Negahban, S. Oh, and D. Shah. Iterative ranking from pair-wise comparisons. In Proc. NIPS, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. L. Page, S. Brin, R. Motwani, and T. Winograd. The pagerank citation ranking: bringing order to the web. 1999.Google ScholarGoogle Scholar
  9. M. Richardson, E. Dominowska, and R. Ragno. Predicting clicks: estimating the click-through rate for new ads. In Proc. WWW, pages 521--530. ACM, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. C. Xiong, T. Wang, W. Ding, Y. Shen, and T.-Y. Liu. Relational click prediction for sponsored search. In Proc. WSDM, pages 493--502. ACM, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. D. Yin, B. Cao, J.-T. Sun, and B. D. Davison. Estimating ad group performance in sponsored search. In Proc. WSDM, pages 143--152. ACM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Yin, S. Mei, B. Cao, J.-T. Sun, and B. D. Davison. Exploiting contextual factors for click modeling in sponsored search. In Proc. WSDM. ACM, 2014. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Preference Approach to Reputation in Sponsored Search

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        CIKM '16: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management
        October 2016
        2566 pages
        ISBN:9781450340731
        DOI:10.1145/2983323

        Copyright © 2016 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 24 October 2016

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • short-paper

        Acceptance Rates

        CIKM '16 Paper Acceptance Rate160of701submissions,23%Overall Acceptance Rate1,861of8,427submissions,22%

        Upcoming Conference

      • Article Metrics

        • Downloads (Last 12 months)6
        • Downloads (Last 6 weeks)0

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader