{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T21:30:52Z","timestamp":1699133452356},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,31]],"date-time":"2012-03-31T00:00:00Z","timestamp":1333152000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11704-012-2873-5","type":"journal-article","created":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T23:22:49Z","timestamp":1576452169000},"page":"209-229","source":"Crossref","is-referenced-by-count":5,"title":["Managing advertising campaigns \u2014 an approximate planning approach"],"prefix":"10.1007","volume":"6","author":[{"given":"Sertan","family":"Girgin","sequence":"first","affiliation":[]},{"given":"J\u00e9r\u00e9mie","family":"Mary","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Preux","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Nicol","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,31]]},"reference":[{"key":"2873_CR1","doi-asserted-by":"crossref","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"M. L. Puterman","year":"1994","unstructured":"Puterman M L. Markov Decision Processes: Discrete Stochastic Dynamic Programming. New York: John Wiley & Sons, 1994"},{"issue":"2\u20133","key":"2873_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer P, Cesa-Bianchi N, Fischer P. Finite-time analysis of the multiarmed bandit problem. Machine Learning, 2002, 47(2\u20133): 235\u2013256","journal-title":"Machine Learning"},{"key":"2873_CR3","unstructured":"Abe N, Nakamura A. Learning to optimally schedule Internet banner advertisements. In: Proceedings of the 16th International Conference on Machine Learning. 1999, 12\u201321"},{"key":"2873_CR4","doi-asserted-by":"crossref","unstructured":"Granmo O C. A Bayesian learning automaton for solving two-armed Bernoulli bandit problems. In: Proceedings of the 7th International Conference on Machine Learning and Applications. 2008, 23\u201330","DOI":"10.1109\/ICMLA.2008.67"},{"issue":"11-16","key":"2873_CR5","doi-asserted-by":"publisher","first-page":"1259","DOI":"10.1016\/S1389-1286(99)00033-X","volume":"31","author":"M. Langheinrich","year":"1999","unstructured":"Langheinrich M, Nakamura A, Abe N, Kamba T, Koseki Y. Unintrusive customization techniques for web advertising. Computer Networks, 1999, 31(11-16): 1259\u20131272","journal-title":"Computer Networks"},{"issue":"1","key":"2873_CR6","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. Electronic Commerce Research, 2005, 5(1): 75\u201398","journal-title":"Electronic Commerce Research"},{"key":"2873_CR7","doi-asserted-by":"crossref","unstructured":"Pandey S, Agarwal D, Chakrabarti D, Josifovski V. Bandits for taxonomies: a model-based approach. In: Proceedings of the 7th SIAM International Conference on Data Mining. 2007","DOI":"10.1137\/1.9781611972771.20"},{"key":"2873_CR8","unstructured":"Langford J, Zhang T. The epoch-greedy algorithm for multi-armed bandits with side information. In: Proceedings of 20th Advances in Neural Information Processing Systems. 2008, 817\u2013824"},{"issue":"3","key":"2873_CR9","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1109\/TAC.2005.844079","volume":"50","author":"C. C. Wang","year":"2005","unstructured":"Wang C C, Kulkarni S R, Poor H V. Bandit problems with side observations. IEEE Transactions on Automatic Control, 2005, 50(3): 338\u2013355","journal-title":"IEEE Transactions on Automatic Control"},{"key":"2873_CR10","doi-asserted-by":"crossref","unstructured":"Kakade S M, Shalev-Shwartz S, Tewari A. Efficient bandit algorithms for online multiclass prediction. In: Proceedings of the 25th International Conference on Machine Learning. 2008, 440\u2013447","DOI":"10.1145\/1390156.1390212"},{"key":"2873_CR11","doi-asserted-by":"crossref","unstructured":"Li W, Wang X, Zhang R, Cui Y, Mao J, Jin R. Exploitation and exploration in a performance based contextual advertising system. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2010, 27\u201336","DOI":"10.1145\/1835804.1835811"},{"key":"2873_CR12","doi-asserted-by":"crossref","unstructured":"Pandey S, Olston C. Handling advertisements of unknown quality in search advertising. In: Proceedings of 18th Advances in Neural Information Processing Systems. 2006, 1065\u20131072","DOI":"10.7551\/mitpress\/7503.003.0138"},{"key":"2873_CR13","doi-asserted-by":"crossref","unstructured":"Agarwal D, Chen B, Elango P. Explore\/exploit schemes for web content optimization. In: Proceedings of the 9th IEEE International Conference on Data Mining. 2009, 1\u201310","DOI":"10.1109\/ICDM.2009.52"},{"key":"2873_CR14","doi-asserted-by":"crossref","unstructured":"Li L, Chu W, Langford J, Schapire R E. A contextual-bandit approach to personalized article recommendation. In: Proceedings of the 19th International Conference on World Wide Web. 2010, 661\u2013670","DOI":"10.1145\/1772690.1772758"},{"key":"2873_CR15","doi-asserted-by":"crossref","unstructured":"Richardson M, Dominowska E, Ragno R. Predicting clicks: estimating the click-through rate for new ads. In: Proceedings of the 16th International Conference on World Wide Web. 2007, 521\u2013530","DOI":"10.1145\/1242572.1242643"},{"key":"2873_CR16","doi-asserted-by":"crossref","unstructured":"Agarwal D, Chen B C, Elango P. Spatio-temporal models for estimating click-through rate. In: Proceedings of the 18th International Conference on World Wide Web. 2009, 21\u201330","DOI":"10.1145\/1526709.1526713"},{"key":"2873_CR17","doi-asserted-by":"crossref","unstructured":"Agarwal D, Broder A, Chakrabarti D, Diklic D, Josifovski V, Sayyadian M. Estimating rates of rare events at multiple resolutions. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2007, 16\u201325","DOI":"10.1145\/1281192.1281198"},{"key":"2873_CR18","volume-title":"Online Multimedia Advertising: Techniques and Technologies","author":"X. Wang","year":"2010","unstructured":"Wang X, Li W, Cui Y, Zhang B, Mao J. Clickthrough rate estimation for rare events in online advertising. In: Hua X S, Mei T, Hanjalic A, eds. Online Multimedia Advertising: Techniques and Technologies. Hershey: IGI Global, 2010"},{"issue":"3","key":"2873_CR19","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10115-009-0222-2","volume":"23","author":"T. K. Fan","year":"2010","unstructured":"Fan T K, Chang C H. Sentiment-oriented contextual advertising. Knowledge and Information Systems, 2010, 23(3): 321\u2013344","journal-title":"Knowledge and Information Systems"},{"key":"2873_CR20","unstructured":"Mehta A, Saberi A, Vazirani U, Vazirani V. Adwords and generalized on-line matching. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science. 2005, 264\u2013273"},{"key":"2873_CR21","doi-asserted-by":"crossref","unstructured":"Mahdian M, Nazerzadeh H. Allocating online advertisement space with unreliable estimates. In: Proceedings of the 8th ACM Conference on Electronic Commerce. 2007, 288\u2013294","DOI":"10.1145\/1250910.1250952"},{"key":"2873_CR22","doi-asserted-by":"crossref","unstructured":"Langford J, Strehl A, Wortman J. Exploration scavenging. In: Proceedings of the 25th International Conference on Machine Learning. 2008, 528\u2013535","DOI":"10.1145\/1390156.1390223"},{"key":"2873_CR23","unstructured":"Koolen W M, Warmuth M K, Kivinen J. Hedging structured concepts. In: Proceedings of the 23rd Annual Conference on Learning Theory. 2010, 93\u2013105"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-012-2873-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-012-2873-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,24]],"date-time":"2023-09-24T01:21:05Z","timestamp":1695518465000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-012-2873-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,31]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["2873"],"URL":"https:\/\/doi.org\/10.1007\/s11704-012-2873-5","relation":{},"ISSN":["2095-2228"],"issn-type":[{"value":"2095-2228","type":"print"}],"subject":[],"published":{"date-parts":[[2012,3,31]]}}}
