{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:08:51Z","timestamp":1758816531717,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319387901"},{"type":"electronic","value":"9783319387918"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-38791-8_9","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T22:07:33Z","timestamp":1464127653000},"page":"152-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Coverage Patterns-Based Approach to Allocate Advertisement Slots for Display Advertising"],"prefix":"10.1007","author":[{"given":"Vaddadi Naga Sai","family":"Kavya","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,25]]},"reference":[{"key":"9_CR1","unstructured":"Frequent itemset mining implementations repository. http:\/\/fimi.cs.helsinki.fi\/"},{"key":"9_CR2","unstructured":"Double click (2015). http:\/\/www.doubleclick.net"},{"key":"9_CR3","unstructured":"Interactive advertising bureau (2015). http:\/\/www.iab.net"},{"key":"9_CR4","unstructured":"Recsys challenge 2015 (2015). http:\/\/2015.recsyschallenge.com\/challenge.html\/"},{"key":"9_CR5","unstructured":"Right media (2015). https:\/\/en.wikipedia.org\/wiki\/Right_Media"},{"issue":"2","key":"9_CR6","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1002\/jos.74","volume":"5","author":"M Adler","year":"2002","unstructured":"Adler, M., Gibbons, P.B., Matias, Y.: Scheduling space-sharing for internet advertising. J. Sched. 5(2), 103\u2013119 (2002)","journal-title":"J. Sched."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Bharadwaj, V., Chen, P., Ma, W., Nagarajan, C., Tomlin, J., Vassilvitskii, S., Vee, E., Yang, J.: Shale: an efficient algorithm for allocation of guaranteed display advertising. In: The 18th International Conference on Knowledge Discovery and Data mining. pp. 1195\u20131203. ACM (2012)","DOI":"10.1145\/2339530.2339718"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Budhiraja, A., Reddy, P.K.: An approach to cover more advertisers in adwords. In: The 2nd International Conference on Data Science and Advanced Analytics. pp. 1\u201310. IEEE (2015)","DOI":"10.1109\/DSAA.2015.7344802"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11081-014-9248-8","volume":"16","author":"F Caruso","year":"2015","unstructured":"Caruso, F., Giuffrida, G., Zarba, C.: Heuristic Bayesian targeting of banner advertising. J. Optim. Eng. 16(1), 247\u2013257 (2015)","journal-title":"J. Optim. Eng."},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V Chvatal","year":"1979","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Math. Oper. Res. 4(3), 233\u2013235 (1979)","journal-title":"Math. Oper. Res."},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Feige, U., Immorlica, N., Mirrokni, V., Nazerzadeh, H.: A combinatorial allocation mechanism with penalties for banner advertising. In: The 17th International Conference on World Wide Web. pp. 169\u2013178. ACM (2008)","DOI":"10.1145\/1367497.1367521"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-15775-2_16","volume-title":"Algorithms \u2013 ESA 2010","author":"J Feldman","year":"2010","unstructured":"Feldman, J., Henzinger, M., Korula, N., Mirrokni, V.S., Stein, C.: Online stochastic packing applied to display ad allocation. In: Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 182\u2013194. Springer, Heidelberg (2010)"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: beating 1\u20131\/e. In: The 50th Annual Symposium on Foundations of Computer Science. pp. 117\u2013126. IEEE (2009)","DOI":"10.1109\/FOCS.2009.72"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete problems. In: The 6th Annual ACM Symposium on Theory of Computing. pp. 47\u201363. ACM (1974)","DOI":"10.1145\/800119.803884"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-10841-9_20","volume-title":"Internet and Network Economics","author":"A Ghosh","year":"2009","unstructured":"Ghosh, A., McAfee, P., Papineni, K., Vassilvitskii, S.: Bidding for representative allocations for display advertising. In: Leonardi, S. (ed.) Internet and Network Economics. LNCS, vol. 5929, pp. 208\u2013219. Springer, Heidelberg (2009)"},{"issue":"11","key":"9_CR16","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1109\/MC.2002.1046977","volume":"35","author":"J Han","year":"2002","unstructured":"Han, J., Chang, C.C.: Data mining for web intelligence. Computer 35(11), 64\u201370 (2002)","journal-title":"Computer"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Hojjat, A., Turner, J., Cetintas, S., Yang, J.: Delivering guaranteed display ads under reach and frequency requirements. In: The 28th AAAI Conference on Artificial Intelligence. pp. 2278\u20132284. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9030"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Huang, e., Cercone, N., An, A.: Comparison of interestingness functions for learning web usage patterns. In: The 11th International Conference on Information and Knowledge Management. pp. 617\u2013620. ACM (2002)","DOI":"10.1145\/584792.584896"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Mirrokni, V.S., Gharan, S.O., Zadimoghaddam, M.: Simultaneous approximations for adversarial and stochastic online budgeted allocation. In: The 23rd Annual Symposium on Discrete Algorithms. pp. 1690\u20131701. ACM-SIAM (2012)","DOI":"10.1137\/1.9781611973099.134"},{"issue":"1","key":"9_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/B:ELEC.0000045974.88926.88","volume":"5","author":"A Nakamura","year":"2005","unstructured":"Nakamura, A., Abe, N.: Improvements to the linear programming based scheduling of web advertisements. J. Electron. Commer. Res. 5(1), 75\u201398 (2005)","journal-title":"J. Electron. Commer. Res."},{"key":"9_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-30220-6_12","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"PG Srinivas","year":"2012","unstructured":"Srinivas, P.G., Reddy, P.K., Sripada, B., Kiran, R.U., Kumar, D.S.: Discovering coverage patterns for banner advertisement placement. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012, Part II. LNCS, vol. 7302, pp. 133\u2013144. Springer, Heidelberg (2012)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10844-014-0318-3","volume":"45","author":"PG Srinivas","year":"2015","unstructured":"Srinivas, P.G., Reddy, P.K., Trinath, A.V., Sripada, B., Kiran, R.U.: Mining coverage patterns from transactional databases. J. Intell. Inf. Syst. 45(3), 423\u2013439 (2015)","journal-title":"J. Intell. Inf. Syst."},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-40319-4_28","volume-title":"Trends and Applications in Knowledge Discovery and Data Mining","author":"PG Srinivas","year":"2013","unstructured":"Srinivas, P.G., Reddy, P.K., Trinath, A.V.: CPPG: efficient mining of coverage patterns using projected pattern growth technique. In: Li, J., Cao, L., Wang, C., Tan, K.C., Liu, B., Pei, J., Tseng, V.S. (eds.) PAKDD 2013 Workshops. LNCS, vol. 7867, pp. 319\u2013329. Springer, Heidelberg (2013)"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1145\/846183.846188","volume":"1","author":"J Srivastava","year":"2000","unstructured":"Srivastava, J., Cooley, R., Deshpande, M., Tan, P.N.: Web usage mining: discovery and applications of usage patterns from web data. SIGKDD Explor. News Lett. 1(2), 12\u201323 (2000)","journal-title":"SIGKDD Explor. News Lett."},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Trinath, A., Gowtham Srinivas, P., Krishna Reddy, P.: Content specific coverage patterns for banner advertisement placement. In: The 1st International Conference on Data Science and Advanced Analytics. pp. 263\u2013269. IEEE (2014)","DOI":"10.1109\/DSAA.2014.7058083"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Vee, E., Vassilvitskii, S., Shanmugasundaram, J.: Optimal online assignment with forecasts. In: The 11th Conference on Electronic Commerce. pp. 109\u2013118. ACM (2010)","DOI":"10.1145\/1807342.1807360"},{"key":"9_CR27","unstructured":"Yang, J., Vee, E., Vassilvitskii, S., Tomlin, J., Shanmugasundaram, J., Anastasakos, T., Kennedy, O.: Inventory allocation for online graphical display advertising. Computing Research Repository, CoRR (2010)"}],"container-title":["Lecture Notes in Computer Science","Web Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38791-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,30]],"date-time":"2022-06-30T08:35:44Z","timestamp":1656578144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-38791-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319387901","9783319387918"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38791-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"25 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}