IDEAS home Printed from https://ideas.repec.org/h/spr/prbchp/978-981-13-1208-3_5.html
   My bibliography  Save this book chapter

Click-Through Rate Estimation Using CHAID Classification Tree Model

In: Advances in Analytics and Applications

Author

Listed:
  • Rajan Gupta

    (University of Delhi)

  • Saibal K. Pal

    (SAG Lab, Metcalfe House)

Abstract

Click-Through Rate (CTR) is referred to as the number of clicks on a particular advertisement as compared to the number of impressions on it. It is an important measure to find the effectiveness of any online advertising campaign. The effectiveness of online advertisements through calculations of ROI can be done through the measurement of CTR. There are multiple ways of detecting CTR in past; however, this study focuses on machine learning based classification model. Important parameters are judged on the basis of user behavior toward online ads and CHAID tree model is used to classify the pattern for successful and unsuccessful clicks. The model is implemented using SPSS version 21.0. The dataset used for the testing has been taken from Kaggle website as the data is from anonymous company’s ad campaign given to Kaggle for research purpose. A total of 83.8% accuracy is reported for the classification model used. This implies that CHAID can be used for less critical problems where very high stakes are not involved. This study is useful for online marketers and analytics professionals for assessing the CHAID model’s performance in online advertising world.

Suggested Citation

  • Rajan Gupta & Saibal K. Pal, 2019. "Click-Through Rate Estimation Using CHAID Classification Tree Model," Springer Proceedings in Business and Economics, in: Arnab Kumar Laha (ed.), Advances in Analytics and Applications, pages 45-58, Springer.
  • Handle: RePEc:spr:prbchp:978-981-13-1208-3_5
    DOI: 10.1007/978-981-13-1208-3_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:prbchp:978-981-13-1208-3_5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.