基于多算法融合的点击欺诈预测研究

Ganglong Duan, Jianjun Liu, Weiwei Kong, B. Cui, Jiahao Li
{"title":"基于多算法融合的点击欺诈预测研究","authors":"Ganglong Duan, Jianjun Liu, Weiwei Kong, B. Cui, Jiahao Li","doi":"10.1117/12.2680157","DOIUrl":null,"url":null,"abstract":"The detection of click fraud in online advertisements on the Internet for the purpose of extracting advertising fees is one of the important aspects of machine learning applications. In this paper, using the data information of 400000 ad click cheating cases, we use recursive feature elimination method to determine the predictors and use five algorithms of gradient boosted decision tree (GBDT), random forest (RF), Adaboost, KNN and LGbmclassifier to train a single classifier, compare the prediction performance of each type of classifier, and the first three with better prediction performance The top three with better prediction performance were fused with multiple algorithms for prediction. The experimental results show that the random forest, Lgbmclassifier and Adaboost algorithms have the highest prediction accuracy, 87%, 83% and 79%, respectively, with AUC values of 0.90, 0.87 and 0.81. The prediction accuracy of the multi-algorithm fusion model taken in this paper can improve by 3% compared to the single algorithm with the best prediction performance, reaching 90%.","PeriodicalId":201466,"journal":{"name":"Symposium on Advances in Electrical, Electronics and Computer Engineering","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on click fraud prediction based on multi-algorithm fusion\",\"authors\":\"Ganglong Duan, Jianjun Liu, Weiwei Kong, B. Cui, Jiahao Li\",\"doi\":\"10.1117/12.2680157\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The detection of click fraud in online advertisements on the Internet for the purpose of extracting advertising fees is one of the important aspects of machine learning applications. In this paper, using the data information of 400000 ad click cheating cases, we use recursive feature elimination method to determine the predictors and use five algorithms of gradient boosted decision tree (GBDT), random forest (RF), Adaboost, KNN and LGbmclassifier to train a single classifier, compare the prediction performance of each type of classifier, and the first three with better prediction performance The top three with better prediction performance were fused with multiple algorithms for prediction. The experimental results show that the random forest, Lgbmclassifier and Adaboost algorithms have the highest prediction accuracy, 87%, 83% and 79%, respectively, with AUC values of 0.90, 0.87 and 0.81. The prediction accuracy of the multi-algorithm fusion model taken in this paper can improve by 3% compared to the single algorithm with the best prediction performance, reaching 90%.\",\"PeriodicalId\":201466,\"journal\":{\"name\":\"Symposium on Advances in Electrical, Electronics and Computer Engineering\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-05-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Symposium on Advances in Electrical, Electronics and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2680157\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Symposium on Advances in Electrical, Electronics and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2680157","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

检测互联网在线广告中的点击欺诈,以提取广告费是机器学习应用的重要方面之一。本文利用40万次广告点击作弊案例的数据信息,采用递归特征消去法确定预测器,并使用梯度增强决策树(GBDT)、随机森林(RF)、Adaboost、KNN和LGbmclassifier五种算法训练单个分类器,比较各分类器的预测性能。预测性能较好的前3个算法与多种算法融合进行预测。实验结果表明,随机森林、Lgbmclassifier和Adaboost算法的预测准确率最高,分别为87%、83%和79%,AUC值分别为0.90、0.87和0.81。本文采用的多算法融合模型的预测精度比预测性能最好的单一算法提高了3%,达到90%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on click fraud prediction based on multi-algorithm fusion
The detection of click fraud in online advertisements on the Internet for the purpose of extracting advertising fees is one of the important aspects of machine learning applications. In this paper, using the data information of 400000 ad click cheating cases, we use recursive feature elimination method to determine the predictors and use five algorithms of gradient boosted decision tree (GBDT), random forest (RF), Adaboost, KNN and LGbmclassifier to train a single classifier, compare the prediction performance of each type of classifier, and the first three with better prediction performance The top three with better prediction performance were fused with multiple algorithms for prediction. The experimental results show that the random forest, Lgbmclassifier and Adaboost algorithms have the highest prediction accuracy, 87%, 83% and 79%, respectively, with AUC values of 0.90, 0.87 and 0.81. The prediction accuracy of the multi-algorithm fusion model taken in this paper can improve by 3% compared to the single algorithm with the best prediction performance, reaching 90%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信