Click-Through Rate Prediction Using Decision Tree
- 17 Downloads
Advertising click-through prediction is a cardinal machine learning problem in online advertising. Click-through prediction anticipates the prospect of an ad to be viewed by the user. It necessitates binary classification to stratify the ad into either categorical or numerical. The forecast is constructed on ensuing attributes: publisher, user and ad content statistics. The machine learning algorithms when furnished by pertinent data sets about users, advertisers and display platforms can be employed to foretell the tendency of a visitant on an online platform, to click on the ad presented . The quantification of such proficiency is the click-through rate (CTR), which is the ratio of clicks on a specific ad to its total number of views . A higher CTR indicates the pronounced proclivity of an ad and its triumph in the advertising industry. The prediction is rooted to the elementary questionnaire like, how does the mélange of ages influence a client’s choice towards a certain ad? What is the impact of people’s financial status and net worth in regulating the selections of ads? How does the plethora of people’s métiers and limited time factors govern the prediction? and so others. Decision tree classifier is the foundation of our paper, a tree-based algorithm which is a highly espoused algorithm in machine learning . A recursive algorithm, which splits the nodes persistently into subsets by hinging on the antecedent observations. Decision tree classifier is a sequential diagram portraying all the expedient decisions and analogous outcomes. The implementation, coding and development of the algorithm are carried out in Python. The results witness improvement in the prediction by using decision tree algorithm.
KeywordsClick-through rate Prediction Decision tree Algorithm Machine learning
- 2.Effendi, Muhammad Junaid, and Syed Abbas Ali. 2007. Click Through Rate Prediction for Contextual Advertisment Using Linear Regression. Cornell University Library, 1701.08744. https://arxiv.org/ftp/arxiv/papers/1701/1701.08744.pdf.
- 3.Bhatnagar, V., R. Majhi, and P.R. Jena. 2017. Comparative Performance Evaluation of Clustering Algorithms for Grouping Manufacturing Firms. Arabian Journal for Science and Engineering.Google Scholar
- 5.Chen, Jie-Hao, Zi-Qian Zhao, Ji-Yun Shi, and Chong Zhao. 2017. A New Approach for Mobile Advertising Click-Through Rate Estimation Based on Deep Belief Nets. In Computational Intelligence Neuroscience, vol. 2017, PMC.Google Scholar
- 6.Ramakrishna Murty, M., J.V.R. Murthy, and P.V.G.D. Prasad Reddy. 2011. Text Document Classification Based on a Least Square Support Vector Machines with Singular Value Decomposition. International Journal of Computer Application (IJCA) 27 (7): 21–26 (Impact factor 0.821).Google Scholar
- 8.Lannani, Xuemin Zhang. 2010. Study of Data Mining Algorithm Based on Decision Tree. In Browse International Conference, IEEE explorer.Google Scholar
- 9.Navya Sri, M., M. Ramakrishna Murty, et al. 2017. Robust Features for Emotion Recognition from Speech by using Gaussian Mixture Model Classification. In International Conference and Published Proceeding in SIST Series, vol. 2, 437–444. Berlin: Springer (August-2017).Google Scholar