{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:35:22Z","timestamp":1742999722421,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030276140"},{"type":"electronic","value":"9783030276157"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-27615-7_22","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"287-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An Efficient Premiumness and Utility-Based Itemset Placement Scheme for Retail Stores"],"prefix":"10.1007","author":[{"given":"Parul","family":"Chaudhary","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Polepalli Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"issue":"6","key":"22_CR1","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1016\/0377-2217(79)90030-4","volume":"3","author":"P Hansen","year":"1979","unstructured":"Hansen, P., Heinsbroek, H.: Product selection and space allocation in supermarkets. Eur. J. Oper. Res. 3(6), 474\u2013484 (1979)","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0925-5273(98)00134-0","volume":"60","author":"MH Yang","year":"1999","unstructured":"Yang, M.H., Chen, W.C.: A study on shelf space allocation and management. Int. J. Prod. Econ. 60, 309\u2013317 (1999)","journal-title":"Int. J. Prod. Econ."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0377-2217(99)00448-8","volume":"131","author":"MH Yang","year":"2001","unstructured":"Yang, M.H.: An efficient algorithm to allocate shelf space. Eur. J. Oper. Res. 131(1), 107\u2013118 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.eswa.2006.02.001","volume":"32","author":"MC Chen","year":"2007","unstructured":"Chen, M.C., Lin, C.P.: A data mining approach to product assortment and shelf space allocation. Expert Syst. Appl. 32(4), 976\u2013986 (2007)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"22_CR5","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.dss.2005.12.004","volume":"42","author":"YL Chen","year":"2006","unstructured":"Chen, Y.L., Chen, J.M., Tung, C.W.: A data mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales. Decis. Support Syst. 42(3), 1503\u20131520 (2006)","journal-title":"Decis. Support Syst."},{"key":"22_CR6","unstructured":"World\u2019s largest retail store. https:\/\/www.thebalance.com\/largest-retail-stores-2892923"},{"issue":"2","key":"22_CR7","first-page":"111","volume":"9","author":"C Hart","year":"1999","unstructured":"Hart, C.: The retail accordion and assortment strategies: an exploratory study. Int. Rev. Retail Distrib. Consum. Res. 9(2), 111\u2013126 (1999)","journal-title":"Int. Rev. Retail Distrib. Consum. Res."},{"key":"22_CR8","first-page":"487","volume":"1215","author":"R Agrawal","year":"1994","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. Proc. VLDB 1215, 487\u2013499 (1994)","journal-title":"Proc. VLDB"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. Proc. ACM SIGMOD 29, 1\u201312 (2000)","journal-title":"Proc. ACM SIGMOD"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1007\/3-540-49257-7_25","volume-title":"Database Theory\u2014ICDT 1999","author":"N Pasquier","year":"1999","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Discovering frequent closed itemsets for association rules. In: Beeri, C., Buneman, P. (eds.) ICDT 1999. LNCS, vol. 1540, pp. 398\u2013416. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49257-7_25"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W.K., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of 1st International Workshop on Utility-Based Data Mining, pp. 90\u201399 (2005)","DOI":"10.1145\/1089827.1089839"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-14717-8_3","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Tseng, V.S.: Novel concise representations of high utility itemsets using generator patterns. In: Luo, X., Yu, J.X., Li, Z. (eds.) ADMA 2014. LNCS (LNAI), vol. 8933, pp. 30\u201343. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14717-8_3"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-319-44403-1_6","volume-title":"Database and Expert Systems Applications","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S., Faghihi, U.: Mining minimal high-utility itemsets. In: Hartmann, S., Ma, H. (eds.) DEXA 2016. LNCS, vol. 9827, pp. 88\u2013101. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44403-1_6"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-27060-9_44","volume-title":"Advances in Artificial Intelligence and Soft Computing","author":"S Zida","year":"2015","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a highly efficient algorithm for high-utility itemset mining. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 530\u2013546. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27060-9_44"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-41920-6_15","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Zida, S., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM-closed: fast and memory efficient discovery of closed high-utility itemsets. MICAI 2016. LNCS (LNAI), vol. 9729, pp. 199\u2013213. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41920-6_15"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of CIKM, pp. 55\u201364 (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.W., Fournier-Viger, P., Philip, S.Y.: Efficient algorithms for mining the concise and lossless representation of high utility itemsets. In: IEEE TKDE, pp. 726\u2013739 (2015)","DOI":"10.1109\/TKDE.2014.2345377"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.W., Shie, B.E., Yu, P.S.: UP-Growth: an efficient algorithm for high utility itemset mining. In: Proceedings of ACM SIGKDD, pp. 253\u2013262 (2010)","DOI":"10.1145\/1835804.1835839"},{"key":"22_CR19","unstructured":"Chan, R., Yang, Q., Shen, Y.D.: Mining high utility itemsets. In: Proceedings of ICDM, pp. 19\u201326 (2003)"},{"key":"22_CR20","unstructured":"http:\/\/www.philippe-fournier-viger.com\/spmf\/dataset"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Zbigniew W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-319-72413-3_18","volume-title":"Big Data Analytics","author":"P Chaudhary","year":"2017","unstructured":"Chaudhary, P., Mondal, A., Reddy, P.K.: A flexible and efficient indexing scheme for placement of top-utility itemsets for different slot sizes. In: Reddy, P.K., Sureka, A., Chakravarthy, S., Bhalla, S. (eds.) BDA 2017. LNCS, vol. 10721, pp. 257\u2013277. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72413-3_18"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-319-98809-2_7","volume-title":"Database and Expert Systems Applications","author":"P Chaudhary","year":"2018","unstructured":"Chaudhary, P., Mondal, A., Reddy, P.K.: A diversification-aware itemset placement framework for long-term sustainability of retail businesses. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, R.R. (eds.) DEXA 2018. LNCS, vol. 11029, pp. 103\u2013118. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98809-2_7"},{"key":"22_CR24","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1108\/09590550310507731","volume":"31","author":"D Corsten","year":"2003","unstructured":"Corsten, D., Gruen, T.: Desperately seeking shelf availability: an examination of the extent, the causes, and the efforts to address retail out-of-stocks. Int. J. Retail Distrib. Manag. 31, 605\u2013617 (2003)","journal-title":"Int. J. Retail Distrib. Manag."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-319-98812-2_41","volume-title":"Database and Expert Systems Applications","author":"P Fournier-Viger","year":"2018","unstructured":"Fournier-Viger, P., Zhang, Y., Lin, J.Chun-Wei, Fujita, H., Koh, Y.S.: Mining local high utility itemsets. In: Hartmann, S., Ma, H., Hameurlain, A., Pernul, G., Wagner, Roland R. (eds.) DEXA 2018. LNCS, vol. 11030, pp. 450\u2013460. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98812-2_41"},{"issue":"2","key":"22_CR26","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10115-018-1207-9","volume":"59","author":"BP Jaysawal","year":"2019","unstructured":"Jaysawal, B.P., Huang, J.W.: DMHUPS: discovering multiple high utility patterns simultaneously. Int. J. Knowl. Inf. Syst. 59(2), 337\u2013359 (2019)","journal-title":"Int. J. Knowl. Inf. Syst."},{"key":"22_CR27","first-page":"134","volume":"81","author":"T Flamand","year":"2018","unstructured":"Flamand, T., Ghoniem, A., Haouari, M., Maddah, B.: Integrated assortment planning and store-wide shelf space allocation: an optimization-based approach. Int. J. Manag. Sci.: Omega 81, 134\u2013149 (2018)","journal-title":"Int. J. Manag. Sci.: Omega"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27615-7_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:16:04Z","timestamp":1710249364000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27615-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276140","9783030276157"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27615-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"34","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":"20% - 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":"4-6","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":"3-4","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}