{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T11:25:16Z","timestamp":1758799516129,"version":"3.44.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,4,1]],"date-time":"2025-04-01T00:00:00Z","timestamp":1743465600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2025,10]]},"DOI":"10.1007\/s41060-025-00734-x","type":"journal-article","created":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T11:23:26Z","timestamp":1743679406000},"page":"4549-4567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Ad-slot allocation framework based on coverage pattern mining to improve display advertising revenue"],"prefix":"10.1007","volume":"20","author":[{"given":"C.","family":"Saideep","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Preetham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Srinivas Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Krishna Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rage Uday","family":"Kiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"734_CR1","unstructured":"Banner advertising: market data & analysis. https:\/\/www.statista.com\/outlook\/dmo\/digital-advertising\/banner-advertising\/worldwide#ad-spending (2023)"},{"key":"734_CR2","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339718","author":"V Bharadwaj","year":"2012","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. ACM SIGKDD Int Conf Knowl Disc Data Min. (2012). https:\/\/doi.org\/10.1145\/2339530.2339718","journal-title":"ACM SIGKDD Int Conf Knowl Disc Data Min."},{"key":"734_CR3","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. Optimizat Eng 16, 247\u2013257 (2015). https:\/\/doi.org\/10.1007\/s11081-014-9248-8","journal-title":"Optimizat Eng"},{"key":"734_CR4","doi-asserted-by":"publisher","unstructured":"Hojjat, S.A., Turner, J.G., Cetintas, S., Yang, J.: Delivering guaranteed display ads under reach and frequency requirements. In: AAAI Conference on Artificial Intelligence (2014). https:\/\/doi.org\/10.1609\/aaai.v28i1.9030","DOI":"10.1609\/aaai.v28i1.9030"},{"key":"734_CR5","doi-asserted-by":"publisher","first-page":"106226","DOI":"10.1016\/j.cie.2019.106226","volume":"140","author":"G Kim","year":"2020","unstructured":"Kim, G., Moon, I.: Online banner advertisement scheduling for advertising effectiveness. Comput Ind Eng 140, 106226 (2020). https:\/\/doi.org\/10.1016\/j.cie.2019.106226","journal-title":"Comput Ind Eng"},{"key":"734_CR6","doi-asserted-by":"publisher","unstructured":"Gamzu, I., Koutsopoulos, I.: Advertisement allocation and mechanism design in native stream advertising. In: Complex Networks and Their Applications VII, pp. 197\u2013210 (2019). https:\/\/doi.org\/10.1007\/978-3-030-05414-4_16","DOI":"10.1007\/978-3-030-05414-4_16"},{"key":"734_CR7","doi-asserted-by":"publisher","unstructured":"Feldman, J., Mehta, A., Mirrokni, V., Muthukrishnan, S.: Online stochastic matching: Beating 1-1\/e. In: IEEE 50th annual symposium on foundations of computer science (FOCS) (2009).https:\/\/doi.org\/10.1109\/FOCS.2009.72","DOI":"10.1109\/FOCS.2009.72"},{"key":"734_CR8","doi-asserted-by":"crossref","unstructured":"Mirrokni, V., Gharan, S.O., Zadimoghaddam, M.: Simultaneous approximations for adversarial and stochastic online budgeted allocation. In: symposium on discrete algorithms (SODA) (2012). http:\/\/dl.acm.org\/citation.cfm?id=2095250","DOI":"10.1137\/1.9781611973099.134"},{"key":"734_CR9","doi-asserted-by":"publisher","unstructured":"Vee, E., Vassilvitskii, S., Shanmugasundaram, J.: Optimal online assignment with forecasts. In: Proceedings of the 11th ACM conference on electronic commerce, pp. 109\u2013118 (2010). https:\/\/doi.org\/10.1145\/1807342.1807360","DOI":"10.1145\/1807342.1807360"},{"key":"734_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-024-05920-x","volume":"20","author":"E Langendoen","year":"2024","unstructured":"Langendoen, E., Frasincar, F., Riezebos, M., Matsiiako, V., Boekestijn, D.: Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model. Ann Operat Res. 20, 1\u201332 (2024). https:\/\/doi.org\/10.1007\/s10479-024-05920-x","journal-title":"Ann Operat Res."},{"key":"734_CR11","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1145\/3616855.3635756","volume":"24","author":"X Wang","year":"2024","unstructured":"Wang, X., Guo, Y., Tan, B., Yang, T., Huang, D., Xu, L., Zhou, H., Li, X.: Follow the libra: guiding fair policy for unified impression allocation via adversarial rewarding. WSDM 24, 750\u2013759 (2024). https:\/\/doi.org\/10.1145\/3616855.3635756","journal-title":"WSDM"},{"key":"734_CR12","doi-asserted-by":"publisher","unstructured":"Zhao, X., Zheng, X., Yang, X., Liu, X., Tang, J.: Jointly learning to recommend and advertise. In: ACM SIGKDD international conference on knowledge discovery & data mining. KDD \u201920, pp. 3319\u20133327 (2020). https:\/\/doi.org\/10.1145\/3394486.3403384","DOI":"10.1145\/3394486.3403384"},{"key":"734_CR13","doi-asserted-by":"publisher","unstructured":"Liao, G., Wang, Z., Wu, X., Shi, X., Zhang, C., Wang, Y., Wang, X., Wang, D.: Cross dqn: Cross deep q network for ads allocation in feed. In: ACM web conference 2022. WWW \u201922, pp. 401\u2013409 (2022). https:\/\/doi.org\/10.1145\/3485447.3512109","DOI":"10.1145\/3485447.3512109"},{"key":"734_CR14","doi-asserted-by":"publisher","unstructured":"Srinivas, P.G., Reddy, P.K., Bhargav, S., Kiran, R.U., Kumar, D.S.: Discovering coverage patterns for banner advertisement placement. In: advances in knowledge discovery and data mining, pp. 133\u2013144 (2012). https:\/\/doi.org\/10.1007\/978-3-642-30220-6_12","DOI":"10.1007\/978-3-642-30220-6_12"},{"key":"734_CR15","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10844-014-0318-3","volume":"45","author":"P Gowtham Srinivas","year":"2015","unstructured":"Gowtham Srinivas, P., Krishna Reddy, P., Trinath, A.V., Bhargav, S., Uday Kiran, R.: Mining coverage patterns from transactional databases. J Intell Inf Syst 45, 423\u2013439 (2015). https:\/\/doi.org\/10.1007\/s10844-014-0318-3","journal-title":"J Intell Inf Syst"},{"key":"734_CR16","doi-asserted-by":"crossref","unstructured":"Rehse, J.-R., Abb, L., Berg, G., Bormann, C., Kampik, T., Warmuth, C.: User behavior mining. Business & Information Systems Engineering (2024)","DOI":"10.1007\/s12599-023-00848-1"},{"key":"734_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF03325089","volume":"1","author":"R Cooley","year":"1999","unstructured":"Cooley, R., Mobasher, B., Srivastava, J.: Data preparation for mining world wide web browsing patterns. Knowl Inf Syst 1, 5\u201332 (1999). https:\/\/doi.org\/10.1007\/BF03325089","journal-title":"Knowl Inf Syst"},{"key":"734_CR18","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 Explorat 1, 12\u201323 (2000). https:\/\/doi.org\/10.1145\/846183.846188","journal-title":"SIGKDD Explorat"},{"key":"734_CR19","doi-asserted-by":"publisher","unstructured":"Huang, X., An, A., Cercone, N.: Comparison of interestingness functions for learning web usage patterns. In: conference on information and knowledge management(CIKM \u201902), pp. 617\u2013620 (2002). https:\/\/doi.org\/10.1145\/584792.584896","DOI":"10.1145\/584792.584896"},{"key":"734_CR20","doi-asserted-by":"publisher","unstructured":"Kavya, V.N.S., Reddy, P.K.: Coverage patterns-based approach to allocate advertisement slots for display advertising. In: international conference on web engineering, pp. 152\u2013169 (2016). https:\/\/doi.org\/10.1007\/978-3-319-38791-8_9","DOI":"10.1007\/978-3-319-38791-8_9"},{"key":"734_CR21","doi-asserted-by":"publisher","unstructured":"Alaei, S., Hajiaghayi, M., Liaghat, V.: Online prophet-inequality matching with applications to ad allocation. Conf Electr Comm (2012).https:\/\/doi.org\/10.1145\/2229012.2229018","DOI":"10.1145\/2229012.2229018"},{"key":"734_CR22","unstructured":"Deza, A., Huang, K., Metel, M.R.: Chance constrained optimization for targeted internet advertising. arXiv (2014). arXiv: 1407.7924"},{"key":"734_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2944789.2944791","volume":"16","author":"I Koutsopoulos","year":"2016","unstructured":"Koutsopoulos, I.: Optimal advertisement allocation in online social media feeds. HotPOST 16, 43\u201348 (2016). https:\/\/doi.org\/10.1145\/2944789.2944791","journal-title":"HotPOST"},{"key":"734_CR24","doi-asserted-by":"publisher","first-page":"106071","DOI":"10.1016\/j.cie.2019.106071","volume":"137","author":"J Rhuggenaath","year":"2019","unstructured":"Rhuggenaath, J., Ak\u00e7ay, A.E., Zhang, Y., Kaymak, U.: Optimal display-ad allocation with guaranteed contracts and supply side platforms. Comput. Ind. Eng. 137, 106071 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.106071","journal-title":"Comput. Ind. Eng."},{"key":"734_CR25","doi-asserted-by":"publisher","first-page":"1409","DOI":"10.1287\/opre.2021.2136","volume":"69","author":"H Shen","year":"2021","unstructured":"Shen, H., Li, Y., Chen, Y.F., Pan, K.: Integrated ad delivery planning for targeted display advertising. Oper. Res. 69, 1409\u20131429 (2021). https:\/\/doi.org\/10.1287\/opre.2021.2136","journal-title":"Oper. Res."},{"key":"734_CR26","doi-asserted-by":"publisher","first-page":"106421","DOI":"10.1016\/j.cor.2023.106421","volume":"161","author":"W Dai","year":"2024","unstructured":"Dai, W., Liu, M., Chu, C., Liu, M.: Robust optimization for spread quality and shortfall in guaranteed targeted display advertising planning. Comput Operat Res. 161, 106421 (2024). https:\/\/doi.org\/10.1016\/j.cor.2023.106421","journal-title":"Comput Operat Res."},{"key":"734_CR27","doi-asserted-by":"publisher","unstructured":"Budhiraja, A., Ralla, A., Reddy, P.K.: Coverage pattern based framework to improve search engine advertising. Int. J. Data Sci. Analyt. 8, 199\u2013211 (2018). https:\/\/doi.org\/10.1007\/s41060-018-0165-3","DOI":"10.1007\/s41060-018-0165-3"},{"key":"734_CR28","doi-asserted-by":"publisher","unstructured":"Budhiraja, A., Reddy, P.K.: An improved approach for long tail advertising in sponsored search. In: database systems for advanced applications, pp. 169\u2013184 (2017). https:\/\/doi.org\/10.1007\/978-3-319-55699-4_11","DOI":"10.1007\/978-3-319-55699-4_11"},{"key":"734_CR29","doi-asserted-by":"publisher","unstructured":"Rathan, P.R., Reddy, P.K., Mondal, A.: A Pattern Mining Framework for Improving Billboard Advertising Revenue. Transactions on Large Scale Data and Knowledge Centered Systems LII, pp. 127\u2013147 (2022).https:\/\/doi.org\/10.1007\/978-3-662-66146-8_6","DOI":"10.1007\/978-3-662-66146-8_6"},{"key":"734_CR30","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/s41060-021-00262-4","volume":"12","author":"K Komallapalli","year":"2021","unstructured":"Komallapalli, K., Krishna Reddy, P., Mondal, A., Akhil, R.: An incremental framework to extract coverage patterns for dynamic databases. Int J Data Sci Anal. 12, 264 (2021). https:\/\/doi.org\/10.1007\/s41060-021-00262-4","journal-title":"Int J Data Sci Anal."},{"key":"734_CR31","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1007\/978-3-030-93620-4_23","volume":"2021","author":"P Sathineni","year":"2021","unstructured":"Sathineni, P., Reddy, A.S., Reddy, P.K., Mondal, A.: An efficient distributed coverage pattern mining algorithm. BDA 2021, 322\u2013340 (2021). https:\/\/doi.org\/10.1007\/978-3-030-93620-4_23","journal-title":"BDA"},{"key":"734_CR32","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/978-3-642-40319-4_28","volume":"28","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. Trends Appl Knowl Disc Data Min. 28, 319\u2013329 (2013). https:\/\/doi.org\/10.1007\/978-3-642-40319-4_28","journal-title":"Trends Appl Knowl Disc Data Min."},{"key":"734_CR33","unstructured":"CPI: Cost per impression. https:\/\/en.wikipedia.org\/wiki\/Cost_per_impression (2024)"},{"key":"734_CR34","unstructured":"code to proposed approach Multi Ad-slot Allocation Framework. https:\/\/github.com\/preetham-reddyy\/Improved-adslot-allocation.git (2024)"},{"key":"734_CR35","doi-asserted-by":"publisher","unstructured":"Tan, P.-N., Steinbach, M., Karpatne, A., Kumar, V.: Introduction to Data Mining, $$2^{nd}$$ edn. (2018). https:\/\/doi.org\/10.5555\/3208440","DOI":"10.5555\/3208440"},{"key":"734_CR36","unstructured":"ADA. http:\/\/hpc.iiit.ac.in\/wiki\/index.php\/Ada_User_Guide (2024)"},{"key":"734_CR37","unstructured":"Ferenc, B.: FIMI-Frequent Itemset Mining Implementations Repository (2003). http:\/\/fimi.cs.helsinki.fi\/src"},{"issue":"1","key":"734_CR38","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/1007730.1007744","volume":"6","author":"B Goethals","year":"2004","unstructured":"Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: report on FIMI\u201903. Spec Int Group Knowl Disc Data Min Explorat News Lett. 6(1), 109\u2013117 (2004). https:\/\/doi.org\/10.1145\/1007730.1007744","journal-title":"Spec Int Group Knowl Disc Data Min Explorat News Lett."},{"key":"734_CR39","unstructured":"How many ads on the website? (Last Accessed in March 2024) (2024). https:\/\/newormedia.com\/blog\/how-many-ads-on-website"},{"key":"734_CR40","doi-asserted-by":"publisher","first-page":"25848","DOI":"10.1037\/h0025848","volume":"9","author":"R Zajonc","year":"1968","unstructured":"Zajonc, R.: The attitudinal effects of mere exposure. J Personal Soc Psychol-PSP 9, 25848 (1968). https:\/\/doi.org\/10.1037\/h0025848","journal-title":"J Personal Soc Psychol-PSP"},{"key":"734_CR41","doi-asserted-by":"publisher","unstructured":"Eisend, M., Schmidt, S.: Advertising repetition: A meta-analysis on effective frequency in advertising. Journal of Advertising (2015) https:\/\/doi.org\/10.1080\/00913367.2015.1018460","DOI":"10.1080\/00913367.2015.1018460"},{"key":"734_CR42","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1287\/mksc.2017.1083","volume":"37","author":"A Sayedi","year":"2018","unstructured":"Sayedi, A.: Real-time bidding in online display advertising. Market Sci. 37, 1083 (2018). https:\/\/doi.org\/10.1287\/mksc.2017.1083","journal-title":"Market Sci."},{"key":"734_CR43","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1609\/aaai.v35i1.16156","volume":"35","author":"X Zhao","year":"2021","unstructured":"Zhao, X., Gu, C., Zhang, H., Yang, X., Liu, X., Tang, J., Liu, H.: Dear: Deep reinforcement learning for online advertising impression in recommender systems. Proc AAAI Conf Artif Intell. 35, 750\u2013758 (2021). https:\/\/doi.org\/10.1609\/aaai.v35i1.16156","journal-title":"Proc AAAI Conf Artif Intell."}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00734-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s41060-025-00734-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-025-00734-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T10:49:21Z","timestamp":1758797361000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s41060-025-00734-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,1]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2025,10]]}},"alternative-id":["734"],"URL":"https:\/\/doi.org\/10.1007\/s41060-025-00734-x","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"type":"print","value":"2364-415X"},{"type":"electronic","value":"2364-4168"}],"subject":[],"published":{"date-parts":[[2025,4,1]]},"assertion":[{"value":"30 April 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}