{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T13:25:16Z","timestamp":1772025916728,"version":"3.50.1"},"reference-count":43,"publisher":"Emerald","issue":"2","license":[{"start":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T00:00:00Z","timestamp":1605571200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["DTA"],"published-print":{"date-parts":[[2021,4,12]]},"abstract":"<jats:sec><jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title><jats:p>Analysis of the publisher's behavior plays a vital role in identifying fraudulent publishers in the pay-per-click model of online advertising. However, the vast amount of raw user click data with missing values pose a challenge in analyzing the conduct of publishers. The presence of high cardinality in categorical attributes with multiple possible values has further aggrieved the issue.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title><jats:p>In this paper, gradient tree boosting (GTB) learning is used to address the challenges encountered in learning the publishers' behavior from raw user click data and effectively classifying fraudulent publishers.<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Findings<\/jats:title><jats:p>The results demonstrate that the GTB effectively classified fraudulent publishers and exhibited significantly improved performance as compared to other learning methods in terms of average precision (60.5 %), recall (57.8 %) and f-measure (59.1%).<\/jats:p><\/jats:sec><jats:sec><jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title><jats:p>The experiments were conducted using publicly available multiclass raw user click dataset and eight other imbalanced datasets to test the GTB's generalizing behavior, while training and testing were done using 10-fold cross-validation. The performance of GTB was evaluated using average precision, recall and f-measure. The performance of GTB learning was also compared with eleven other state-of-the-art individual and ensemble classification models.<\/jats:p><\/jats:sec>","DOI":"10.1108\/dta-04-2020-0093","type":"journal-article","created":{"date-parts":[[2020,11,13]],"date-time":"2020-11-13T07:15:52Z","timestamp":1605251752000},"page":"216-232","source":"Crossref","is-referenced-by-count":21,"title":["Gradient boosting learning for fraudulent publisher detection in online advertising"],"prefix":"10.1108","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0338-1270","authenticated-orcid":false,"given":"Deepti","family":"Sisodia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9845-290X","authenticated-orcid":false,"given":"Dilip Singh","family":"Sisodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","published-online":{"date-parts":[[2020,11,17]]},"reference":[{"issue":"1","key":"key2021043009423904300_ref001","first-page":"1","article-title":"A novel, gradient boosting framework for sentiment analysis in languages where NLP Resources are not plentiful: a case study for modern Greek \u2020","volume":"10","year":"2017","journal-title":"Algorithms"},{"key":"key2021043009423904300_ref002","first-page":"1","article-title":"Random forests for the detection of click fraud in online mobile advertising","volume":"1","year":"2012","journal-title":"International Workshop on Fraud Detection in Mobile Advertising (FDMA)"},{"issue":"2","key":"key2021043009423904300_ref003","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1007\/s10115-015-0827-6","article-title":"Learning from automatically labeled data: case study on click fraud prediction","volume":"46","year":"2016","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"key2021043009423904300_ref004","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1214\/ss\/1009213725","article-title":"Statistical modeling: the two cultures","volume":"16","year":"2001","journal-title":"Statistical Science"},{"issue":"1","key":"key2021043009423904300_ref005","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","year":"2001","journal-title":"Machine Learning"},{"issue":"3","key":"key2021043009423904300_ref006","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF00994018","article-title":"Support-vector networks","volume":"20","year":"1995","journal-title":"Machine Learning"},{"key":"key2021043009423904300_ref007","first-page":"175","article-title":"Measuring and fingerprinting click-spam in ad networks","year":"2012"},{"key":"key2021043009423904300_ref008","first-page":"590","article-title":"Fast gradient boosting decision trees with bit-level data structures","year":"2019","journal-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases"},{"issue":"6","key":"key2021043009423904300_ref009","first-page":"913","article-title":"Genetics-Based machine learning for rule induction: taxonomy , experimental study and state of the art","volume":"4","year":"2010","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"3","key":"key2021043009423904300_ref010","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/j.ijar.2008.11.004","article-title":"International Journal of Approximate Reasoning Hierarchical fuzzy rule based classification systems with genetic rule selection for imbalanced data-sets q","volume":"50","year":"2009","journal-title":"International Journal of Approximate Reasoning"},{"issue":"8","key":"key2021043009423904300_ref011","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1016\/j.ins.2009.12.014","article-title":"On the 2-tuples based genetic tuning performance for fuzzy rule based classification systems in imbalanced data-sets","volume":"180","year":"2010","journal-title":"Information Sciences"},{"key":"key2021043009423904300_ref012","first-page":"20","article-title":"Efficient top rank optimization with gradient boosting for supervised anomaly detection","year":"2017"},{"issue":"5","key":"key2021043009423904300_ref013","first-page":"771","article-title":"A short introduction to boosting","volume":"14","year":"1999","journal-title":"Journal of Japanese Society for Artificial Intelligence"},{"key":"key2021043009423904300_ref014","first-page":"1277","article-title":"Building classifiers using bayesian networks","year":"1996","journal-title":"AAAI-96 Preceedings"},{"key":"key2021043009423904300_ref015","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1023\/A:1007465528199","article-title":"Bayesian network classifiers","volume":"29","year":"1997","journal-title":"Machine Learning"},{"issue":"405","key":"key2021043009423904300_ref016","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1080\/01621459.1989.10478752","article-title":"Regularized discriminant analysis","volume":"84","year":"1989","journal-title":"Journal of the American Statistical Association"},{"issue":"5","key":"key2021043009423904300_ref017","first-page":"1189","article-title":"Greedy function approximation: a gradient boosting machine","volume":"29","year":"2018","journal-title":"Annals of Statistics"},{"issue":"2","key":"key2021043009423904300_ref018","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/1764873.1764877","article-title":"Fighting online click-fraud using bluff ads","volume":"40","year":"2010","journal-title":"ACM SIGCOMM - Computer Communication Review"},{"issue":"February","key":"key2021043009423904300_ref019","first-page":"126","article-title":"An ensemble learning based approach for impression fraud detection in mobile advertising","volume":"112","year":"2018","journal-title":"Journal of Network and Computer Applications"},{"key":"key2021043009423904300_ref020","volume-title":"Applied Logistic Regression","year":"2013"},{"issue":"3","key":"key2021043009423904300_ref021","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1016\/j.ijar.2007.12.002","article-title":"Decision trees as possibilistic classifiers","volume":"48","year":"2008","journal-title":"International Journal of Approximate Reasoning"},{"key":"key2021043009423904300_ref022","first-page":"69","article-title":"Improving click fraud detection by real time data fusion","year":"2008"},{"issue":"1","key":"key2021043009423904300_ref023","first-page":"180","article-title":"The effect of using pay per click advertisement on online advertisement effectiveness and attracting customers in E-marketing companies in Jordan","volume":"7","year":"2015","journal-title":"International Journal of Marketing Studies"},{"key":"key2021043009423904300_ref024","volume-title":"Logistic Regression","year":"2002"},{"issue":"April","key":"key2021043009423904300_ref025","first-page":"1","article-title":"Light GBM machine learning algorithm to online click fraud detection light GBM machine learning algorithm to online click fraud detection","volume":"3","year":"2019","journal-title":"Journal of Information Assurance and Cybersecurity"},{"key":"key2021043009423904300_ref026","first-page":"88","article-title":"Towards a machine learning approach for detecting click fraud in mobile advertizing","year":"2019"},{"issue":"December","key":"key2021043009423904300_ref027","first-page":"1","article-title":"Gradient boosting machines, a tutorial","volume":"7","year":"2013","journal-title":"Frontiers in Neurorobotics"},{"issue":"1","key":"key2021043009423904300_ref028","first-page":"99","article-title":"Detecting click fraud in online advertising: a data mining approach","volume":"15","year":"2014","journal-title":"Journal of Machine Learning Research"},{"key":"key2021043009423904300_ref029","first-page":"370","article-title":"A novel ensemble learning-based approach for click fraud detection in mobile advertising","year":"2013","journal-title":"Mining Intelligence and Knowledge Exploration"},{"issue":"8","key":"key2021043009423904300_ref030","first-page":"1","article-title":"A review of classification problems and algorithms","volume":"9","year":"2016","journal-title":"Energies"},{"issue":"1","key":"key2021043009423904300_ref031","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF00116251","article-title":"Induction of decision trees","volume":"1","year":"1986","journal-title":"Machine Learning"},{"issue":"1","key":"key2021043009423904300_ref032","first-page":"1","article-title":"Effectiveness analysis of machine learning classification models for predicting personalized context - aware smartphone usage","volume":"6","year":"2019","journal-title":"Journal of Big Data"},{"issue":"5","key":"key2021043009423904300_ref033","first-page":"1686","article-title":"Boosting the margin: a new explanation for the effectiveness of voting methods","volume":"26","year":"1998","journal-title":"The Annals of Statistics"},{"key":"key2021043009423904300_ref034","first-page":"1016","article-title":"Evaluation of machine learning models for employee churn prediction","year":"2017"},{"key":"key2021043009423904300_ref035","doi-asserted-by":"crossref","first-page":"31","DOI":"10.28945\/4279","article-title":"Ensemble learning approach for clickbait detection using article headline features","volume":"22","year":"2019","journal-title":"Informing Science: The International Journal of an Emerging Transdiscipline"},{"issue":"4","key":"key2021043009423904300_ref036","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ipm.2009.03.002","article-title":"A systematic analysis of performance measures for classification tasks","volume":"45","year":"2009","journal-title":"Information Processing and Management"},{"key":"key2021043009423904300_ref037","first-page":"162","article-title":"Prediction of click frauds in mobile advertising","year":"2015"},{"issue":"3","key":"key2021043009423904300_ref038","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0169-7439(89)80086-3","article-title":"k-nearest neighbour method: the influence of data transformations and metrics","volume":"6","year":"1989","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"issue":"2","key":"key2021043009423904300_ref039","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1022699900025","article-title":"Incremental induction of decision trees","volume":"4","year":"1989","journal-title":"Machine Learning"},{"key":"key2021043009423904300_ref040","first-page":"90","article-title":"Data mining approach to filter click-spam in mobile ad networks","year":"2015"},{"key":"key2021043009423904300_ref041","first-page":"419","article-title":"Click fraud detection on the advertiser side","year":"2014"},{"key":"key2021043009423904300_ref042","first-page":"77","article-title":"Detecting click fraud in pay-per-click streams of online advertising networks","year":"2008"},{"issue":"1","key":"key2021043009423904300_ref043","first-page":"24","article-title":"KNN-CF approach: incorporating certainty factor to kNN classification","volume":"11","year":"2010","journal-title":"IEEE Intelligent Informatics Bulletin"}],"container-title":["Data Technologies and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-04-2020-0093\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/DTA-04-2020-0093\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T23:15:05Z","timestamp":1753398905000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/dta\/article\/55\/2\/216-232\/510004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,17]]},"references-count":43,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2020,11,17]]},"published-print":{"date-parts":[[2021,4,12]]}},"alternative-id":["10.1108\/DTA-04-2020-0093"],"URL":"https:\/\/doi.org\/10.1108\/dta-04-2020-0093","relation":{},"ISSN":["2514-9288"],"issn-type":[{"value":"2514-9288","type":"print"}],"subject":[],"published":{"date-parts":[[2020,11,17]]}}}