{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:43:05Z","timestamp":1767339785605,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030767754"},{"type":"electronic","value":"9783030767761"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-76776-1_5","type":"book-chapter","created":{"date-parts":[[2021,5,19]],"date-time":"2021-05-19T19:03:16Z","timestamp":1621450996000},"page":"67-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Click Ad Fraud Detection Using XGBoost Gradient Boosting Algorithm"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6832-084X","authenticated-orcid":false,"given":"Nayanaba Pravinsinh","family":"Gohil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5885-6085","authenticated-orcid":false,"given":"Arvind D.","family":"Meniya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,20]]},"reference":[{"key":"5_CR1","unstructured":"Lin, Y. https:\/\/www.oberlo.in\/blog\/internet-statistics. Accessed 25 Nov 2020"},{"key":"5_CR2","unstructured":"Keelery, S. https:\/\/www.statista.com\/statistics\/1040905\/india-opinion-timespent-online-than-tv\/. Accessed 25 Nov 2020"},{"key":"5_CR3","unstructured":"Handley, L. https:\/\/www.cnbc.com\/2017\/12\/04\/global-advertising-spend-2020-online-and-offline-ad-spend-to-be-equal.html. Accessed 25 Nov 2020"},{"key":"5_CR4","unstructured":"Braccialini, C. https:\/\/blog.hubspot.com\/marketing\/online-advertising. Accessed 25 Nov 2020"},{"key":"5_CR5","unstructured":"Globsyn Business School Online, Digital Marketing Course (2020)"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/MC.2018.2887322","volume":"52","author":"N Kshetri","year":"2019","unstructured":"Kshetri, N., Voas, J.: Online advertising fraud. Computer 52(1), 58\u201361 (2019). https:\/\/doi.org\/10.1109\/MC.2018.2887322","journal-title":"Computer"},{"key":"5_CR7","unstructured":"SEJ search engine journal. https:\/\/www.searchenginejournal.com\/clickcease-howmuchppc-fraud-costing-your-business\/357328\/. Accessed 25 Nov 2020"},{"key":"5_CR8","unstructured":"IPQuality score. https:\/\/www.ipqualityscore.com\/articles\/view\/17\/what-is-payper-click-ppc-fraud. Accessed 25 Nov 2020"},{"key":"5_CR9","unstructured":"Serrano, T. https:\/\/thriveagency.com\/news\/what-is-click-fraud-and-how-do-youprevent-it\/. Accessed 25 Nov 2020"},{"key":"5_CR10","unstructured":"Lynch, O. https:\/\/www.cheq.ai\/what-is-click-fraud. Accessed 25 Nov 2020"},{"key":"5_CR11","unstructured":"Digital element. https:\/\/www.digitalelement.com\/identify-proxiesfight-clickfraud-and-wasted-impressions\/. Accessed 25 Nov 2020"},{"key":"5_CR12","unstructured":"Whats new publishing. https:\/\/whatsnewinpublishing.com\/publishers-shadowtraffic-problem-why-your-traffic-numbers-are-off-by-20\/. Accessed 25 Nov 2020"},{"key":"5_CR13","doi-asserted-by":"publisher","unstructured":"Thejas, G.S.: Deep learning-based model to fight against ad click fraud, pp. 176\u2013181 (2019). https:\/\/doi.org\/10.1145\/3299815.3314453","DOI":"10.1145\/3299815.3314453"},{"key":"5_CR14","doi-asserted-by":"publisher","unstructured":"Nagaraja, S., Shah, R.: Clicktok: click fraud detection using traffic analysis, pp. 105\u2013116 (2019). https:\/\/doi.org\/10.1145\/3317549.3323407","DOI":"10.1145\/3317549.3323407"},{"key":"5_CR15","doi-asserted-by":"publisher","unstructured":"Mouawi, R., Elhajj, I.H., Chehab, A., et al.: Crowdsourcing for click fraud detection. EURASIP J. Info. Secur. 2019, 11 (2019). https:\/\/doi.org\/10.1186\/s13635-019-0095-1","DOI":"10.1186\/s13635-019-0095-1"},{"key":"5_CR16","doi-asserted-by":"publisher","unstructured":"Zhang, X., Liu, X., Guo, H.: A click fraud detection scheme based on cost sensitive BPNN and ABC in mobile advertising, pp. 1360\u20131365 (2018). https:\/\/doi.org\/10.1109\/CompComm.2018.8780941","DOI":"10.1109\/CompComm.2018.8780941"},{"key":"5_CR17","doi-asserted-by":"publisher","unstructured":"Almahmoud, S., Hammo, B., Al-Shboul, B.: Exploring non-human traffic in online digital advertisements: analysis and prediction (2019). https:\/\/doi.org\/10.1007\/978-3-030-28374-257","DOI":"10.1007\/978-3-030-28374-257"},{"key":"5_CR18","doi-asserted-by":"publisher","unstructured":"Gabryel, M.: Data analysis algorithm for click fraud recognition (2018). https:\/\/doi.org\/10.1007\/978-3-319-99972-236","DOI":"10.1007\/978-3-319-99972-236"},{"key":"5_CR19","doi-asserted-by":"publisher","unstructured":"Minastireanu, E., Mesnita, G.: Light GBM machine learning algorithm to online click fraud detection. J. Inf. Assur. Cybersecur. (2019). https:\/\/doi.org\/10.5171\/2019.263928","DOI":"10.5171\/2019.263928"},{"key":"5_CR20","unstructured":"Fallah, I.M., Zarifzadeh, S.: Practical detection of click spams using efficient classification-based algorithms. Int. J. Inf. Commun. Technol. Res. 10, 63\u201371 (2018)"},{"key":"5_CR21","unstructured":"Kaggle.com, TalkingData AdTracking fraud detection challenge (2018). https:\/\/www.kaggle.com\/c\/talkingdata-adtracking-fraud-detection. Accessed 25 Nov 2020"},{"key":"5_CR22","unstructured":"Great learning academy, data visualization in python course (2019)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system, CoRR, abs\/1603.02754 (2016)","DOI":"10.1145\/2939672.2939785"},{"key":"5_CR24","unstructured":"Kaggle.com, Jose, Advertising dataset by Jose Portilla and Pierian Data (2018). https:\/\/www.kaggle.com\/fayomi\/advertising. Accessed 25 Nov 2020"}],"container-title":["Communications in Computer and Information Science","Computing Science, Communication and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76776-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,15]],"date-time":"2021-06-15T14:05:39Z","timestamp":1623765939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76776-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030767754","9783030767761"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76776-1_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COMS2","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computing Science, Communication and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mehsana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 February 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"coms22021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/coms2.gnu.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"105","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}