{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:38:39Z","timestamp":1743154719107,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030762278"},{"type":"electronic","value":"9783030762285"}],"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-76228-5_29","type":"book-chapter","created":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T12:09:47Z","timestamp":1620734987000},"page":"403-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Calibrated Viewability Prediction for\u00a0Premium Inventory Expansion"],"prefix":"10.1007","author":[{"given":"Jonathan","family":"Schler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Allon","family":"Hammer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,12]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","unstructured":"Callejo, P., Pastor, A., Cuevas, R., Cuevas, \u00c1.: Q-tag: a transparent solution to measure ads viewability rate in online advertising campaigns, pp. 151\u2013157 (2019). https:\/\/doi.org\/10.1145\/3359989.3365434","DOI":"10.1145\/3359989.3365434"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1080\/07350015.1995.10524599","volume":"20","author":"F Diebold","year":"2002","unstructured":"Diebold, F., Mariano, R.: Comparing predictive accuracy. J. Bus. Econ. Stat. 20, 134\u201344 (2002). https:\/\/doi.org\/10.1080\/07350015.1995.10524599","journal-title":"J. Bus. Econ. Stat."},{"key":"29_CR3","unstructured":"Fisher: https:\/\/www.emarketer.com\/content\/us-programmatic-digital-display-ad-spending"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"1189","DOI":"10.2307\/2699986","volume":"29","author":"J Friedman","year":"2001","unstructured":"Friedman, J.: Greedy function approximation: a gradient boosting machine. Ann. Stat. 29, 1189\u20131232 (2001). https:\/\/doi.org\/10.2307\/2699986","journal-title":"Ann. Stat."},{"key":"29_CR5","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1214\/aos\/1016218223","volume":"28","author":"J Friedman","year":"2000","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Additive logistic regression: a statistical view of boosting. Ann. Stat. 28, 337\u2013407 (2000). https:\/\/doi.org\/10.1214\/aos\/1016218223","journal-title":"Ann. Stat."},{"key":"29_CR6","unstructured":"GmbH, M.: https:\/\/www.meetrics.com\/wp-content\/uploads\/sites\/2\/2020\/01\/Meetrics-Benchmark-Report_Q4_2019_1.pdf"},{"key":"29_CR7","unstructured":"IAB: Internet advertising bureau-viewability guidelines (2014). http:\/\/www.iab.net\/viewability"},{"key":"29_CR8","unstructured":"Ke, G., et al.: Lightgbm: a highly efficient gradient boosting decision tree. In: Guyon, I., et al. (eds.) Advances in Neural Information Processing Systems 30. pp. 3146\u20133154. Curran Associates, Inc. (2017). http:\/\/papers.nips.cc\/paper\/6907-lightgbm-a-highly-efficient-gradient-boosting-decision-tree.pdf"},{"key":"29_CR9","unstructured":"Niculescu-Mizil, A., Caruana, R.: Obtaining calibrated probabilities from boosting. CoRR ArXiv:abs\/1207.1403 (2012). http:\/\/arxiv.org\/abs\/1207.1403"},{"key":"29_CR10","unstructured":"Nielsen, D.: Tree boosting with XGBoost-why does xgboost win \u201cevery\u201d machine learning competition? Master\u2019s thesis, NTNU (2016)"},{"key":"29_CR11","unstructured":"Platt, J.: Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. Adv. Large Margin Classif. 10 (2000)"},{"key":"29_CR12","doi-asserted-by":"publisher","unstructured":"Schapire, R., Freund, Y., Bartlett, P., Lee, W.: Boosting the margin: a new explanation for the effectiveness of voting methods. Ann. Stat. 26, (2001). https:\/\/doi.org\/10.1214\/aos\/1024691352","DOI":"10.1214\/aos\/1024691352"},{"key":"29_CR13","doi-asserted-by":"publisher","unstructured":"Wang, C., Kalra, A., Borcea, C., Chen, Y.: Webpage depth-level dwell time prediction. In: Proceedings of the 25th ACM International on Conference on Information and Knowledge Management (CIKM\u201916), pp. 1937\u20131940. Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2983323.2983878","DOI":"10.1145\/2983323.2983878"},{"issue":"9","key":"29_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2017.2705688","volume":"29","author":"C Wang","year":"2017","unstructured":"Wang, C., Kalra, A., Zhou, L., Borcea, C., Chen, Y.: Probabilistic models for ad viewability prediction on the web. IEEE Trans. Knowl. Data Eng. 29(9), 1 (2017). https:\/\/doi.org\/10.1109\/TKDE.2017.2705688","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"29_CR15","doi-asserted-by":"publisher","unstructured":"Xia, Y., Liu, C., Li, Y., Liu, N.: A boosted decision tree approach using bayesian hyper-parameter optimization for credit scoring. Expert Syst. Appl. 78 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.02.017","DOI":"10.1016\/j.eswa.2017.02.017"},{"key":"29_CR16","doi-asserted-by":"publisher","unstructured":"Zadrozny, B., Elkan, C.: Transforming classifier scores into accurate multiclass probability estimates. iN: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2002). https:\/\/doi.org\/10.1145\/775047.775151","DOI":"10.1145\/775047.775151"},{"key":"29_CR17","doi-asserted-by":"publisher","unstructured":"Zhang, Y., Haghani, A.: A gradient boosting method to improve travel time prediction. Transp. Res. Part C Emerg. Technol,. 58 (2015). https:\/\/doi.org\/10.1016\/j.trc.2015.02.019","DOI":"10.1016\/j.trc.2015.02.019"}],"container-title":["Communications in Computer and Information Science","Information Management and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-76228-5_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,11]],"date-time":"2021-05-11T12:38:49Z","timestamp":1620736729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-76228-5_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030762278","9783030762285"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-76228-5_29","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":"12 May 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIMBig","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Conference on Information Management and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"simbig2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/simbig.org\/SIMBig2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","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":"32","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":"7","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":"26% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually.","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)"}}]}}