{"title":"Prediction of click frauds in mobile advertising","authors":"Mayank Taneja, Kavyanshi Garg, Archana Purwar, Samarth Sharma","doi":"10.1109/IC3.2015.7346672","DOIUrl":null,"url":null,"abstract":"Click fraud represents a serious drain on advertising budgets and can seriously harm the viability of the internet advertising market. This paper proposes a novel framework for prediction of click fraud in mobile advertising which consists of feature selection using Recursive Feature Elimination (RFE) and classification through Hellinger Distance Decision Tree (HDDT).RFE is chosen for the feature selection as it has given better results as compared to wrapper approach when evaluated using different classifiers. HDDT is also selected as classifier to deal with class imbalance issue present in the data set. The efficiency of proposed framework is investigated on the data set provided by Buzzcity and compared with J48, Rep Tree, logitboost, and random forest. Results show that accuracy achieved by proposed framework is 64.07 % which is best as compared to existing methods under study.","PeriodicalId":217950,"journal":{"name":"2015 Eighth International Conference on Contemporary Computing (IC3)","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"28","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Eighth International Conference on Contemporary Computing (IC3)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IC3.2015.7346672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 28
Abstract
Click fraud represents a serious drain on advertising budgets and can seriously harm the viability of the internet advertising market. This paper proposes a novel framework for prediction of click fraud in mobile advertising which consists of feature selection using Recursive Feature Elimination (RFE) and classification through Hellinger Distance Decision Tree (HDDT).RFE is chosen for the feature selection as it has given better results as compared to wrapper approach when evaluated using different classifiers. HDDT is also selected as classifier to deal with class imbalance issue present in the data set. The efficiency of proposed framework is investigated on the data set provided by Buzzcity and compared with J48, Rep Tree, logitboost, and random forest. Results show that accuracy achieved by proposed framework is 64.07 % which is best as compared to existing methods under study.