IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/818203.html
   My bibliography  Save this article

Predicting Click-Through Rates of New Advertisements Based on the Bayesian Network

Author

Listed:
  • Zhipeng Fang
  • Kun Yue
  • Jixian Zhang
  • Dehai Zhang
  • Weiyi Liu

Abstract

Most classical search engines choose and rank advertisements (ads) based on their click-through rates (CTRs). To predict an ad’s CTR, historical click information is frequently concerned. To accurately predict the CTR of the new ads is challenging and critical for real world applications, since we do not have plentiful historical data about these ads. Adopting Bayesian network (BN) as the effective framework for representing and inferring dependencies and uncertainties among variables, in this paper, we establish a BN-based model to predict the CTRs of new ads. First, we built a Bayesian network of the keywords that are used to describe the ads in a certain domain, called keyword BN and abbreviated as KBN. Second, we proposed an algorithm for approximate inferences of the KBN to find similar keywords with those that describe the new ads. Finally based on the similar keywords, we obtain the similar ads and then calculate the CTR of the new ad by using the CTRs of the ads that are similar with the new ad. Experimental results show the efficiency and accuracy of our method.

Suggested Citation

  • Zhipeng Fang & Kun Yue & Jixian Zhang & Dehai Zhang & Weiyi Liu, 2014. "Predicting Click-Through Rates of New Advertisements Based on the Bayesian Network," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-9, July.
    • Handle: RePEc:hin:jnlmpe:818203
    DOI: 10.1155/2014/818203
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2014/818203.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2014/818203.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2014/818203?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:818203. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.