{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:57:30Z","timestamp":1758819450248},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642302190"},{"type":"electronic","value":"9783642302206"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30220-6_12","type":"book-chapter","created":{"date-parts":[[2012,5,9]],"date-time":"2012-05-09T05:37:35Z","timestamp":1336541855000},"page":"133-144","source":"Crossref","is-referenced-by-count":21,"title":["Discovering Coverage Patterns for Banner Advertisement Placement"],"prefix":"10.1007","author":[{"given":"P. Gowtham","family":"Srinivas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Bhargav","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. Uday","family":"Kiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. Satheesh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB 1994: Proceedings of the 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Morgan Kaufmann Publishers Inc. (1994)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Chvatal, V.: A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 233\u2013235 (1979)","DOI":"10.1287\/moor.4.3.233"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified np-complete problems. In: Proceedings of the Sixth Annual ACM Symposium on Theory of Computing, STOC 1974, pp. 47\u201363. ACM (1974)","DOI":"10.1145\/800119.803884"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Venetis, P., Koutrika, G., Garcia-Molina, H.: On the selection of tags for tag clouds. In: Proceedings of the Fourth ACM International Conference on Web Search and Data Mining, WSDM 2011, pp. 835\u2013844. ACM (2011)","DOI":"10.1145\/1935826.1935855"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Bonchi, F., Castillo, C., Donato, D., Gionis, A.: Topical query decomposition. In: Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2008, pp. 52\u201360. ACM (2008)","DOI":"10.1145\/1401890.1401902"},{"issue":"4","key":"12_CR6","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1145\/945846.945848","volume":"3","author":"A. Amiri","year":"2003","unstructured":"Amiri, A., Menon, S.: Efficient scheduling of internet banner advertisements. ACM Trans. Internet Technol.\u00a03(4), 334\u2013346 (2003)","journal-title":"ACM Trans. Internet Technol."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Ghosh, A., Rubinstein, B.I., Vassilvitskii, S., Zinkevich, M.: Adaptive bidding for display advertising. In: WWW 2009: Proceedings of the 18th International Conference on World Wide Web, pp. 251\u2013260. ACM (2009)","DOI":"10.1145\/1526709.1526744"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Wu, X., Bolivar, A.: Keyword extraction for contextual advertisement. In: WWW 2008: Proceeding of the 17th International Conference on World Wide Web, pp. 1195\u20131196. ACM (2008)","DOI":"10.1145\/1367497.1367723"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, D., Agarwal, D., Josifovski, V.: Contextual advertising by combining relevance with click feedback. In: WWW 2008: Proceeding of the 17th International Conference on World Wide Web, pp. 417\u2013426. ACM (2008)","DOI":"10.1145\/1367497.1367554"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Alaei, S., Arcaute, E., Khuller, S., Ma, W., Malekian, A., Tomlin, J.: Online allocation of display advertisements subject to advanced sales contracts. In: ADKDD 2009: Proceedings of the Third International Workshop on Data Mining and Audience Intelligence for Advertising, pp. 69\u201377. ACM (2009)","DOI":"10.1145\/1592748.1592758"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Sripada, B., Reddy, P.K., Kiran, R.U.: Coverage patterns for efficient banner advertisement placement. In: WWW (Companion Volume), pp. 131\u2013132 (2011)","DOI":"10.1145\/1963192.1963259"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: KDD 1999: Proceedings of the Fifth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 337\u2013341. ACM (1999)","DOI":"10.1145\/312129.312274"},{"key":"12_CR13","unstructured":"Han, J., Kamber, M.: Data mining: concepts and techniques. Morgan Kaufmann (2006)"},{"key":"12_CR14","unstructured":"Fimi: Frequent itemset mining implementations repository (July 2010), \n                    \n                      http:\/\/fimi.cs.helsinki.fi\/"},{"key":"12_CR15","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010), \n                    \n                      http:\/\/archive.ics.uci.edu\/ml"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, SIGMOD 1993, pp. 207\u2013216. ACM (1993)","DOI":"10.1145\/170036.170072"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30220-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:32:00Z","timestamp":1620127920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30220-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642302190","9783642302206"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30220-6_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}