{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,25]],"date-time":"2025-04-25T17:47:05Z","timestamp":1745603225793},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T00:00:00Z","timestamp":1646784000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T00:00:00Z","timestamp":1646784000000},"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":["Appl Intell"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10489-022-03250-8","type":"journal-article","created":{"date-parts":[[2022,3,9]],"date-time":"2022-03-09T14:02:32Z","timestamp":1646834552000},"page":"14541-14559","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A framework for itemset placement with diversification for retail businesses"],"prefix":"10.1007","volume":"52","author":[{"given":"Anirban","family":"Mondal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghav","family":"Mittal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Parul","family":"Chaudhary","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":[[2022,3,9]]},"reference":[{"key":"3250_CR1","unstructured":"Largest malls in the world (2020) https:\/\/www.touropia.com\/largest-malls-in-the-world\/"},{"key":"3250_CR2","unstructured":"Agrawal R, Srikant R, et al. (1994) Fast algorithms for mining association rules. In: Proc. VLDB, vol 1215, pp 487\u2013499"},{"key":"3250_CR3","doi-asserted-by":"publisher","first-page":"12551","DOI":"10.1016\/j.eswa.2012.04.086","volume":"39","author":"KI Ahn","year":"2012","unstructured":"Ahn KI (2012) Effective product assignment based on association rule mining in retail. Expert Syst Appl 39:12551\u201312556","journal-title":"Expert Syst Appl"},{"key":"3250_CR4","doi-asserted-by":"publisher","first-page":"106596","DOI":"10.1016\/j.knosys.2020.106596","volume":"212","author":"Y Baek","year":"2021","unstructured":"Baek Y, Yun U, Kim H, Kim J, Vo B, Truong T, Deng ZH (2021) Approximate high utility itemset mining in noisy environments. Knowl-Based Syst 212:106596","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"3250_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3430767","volume":"12","author":"Y Baek","year":"2021","unstructured":"Baek Y, Yun U, Kim H, Nam H, Kim H, Lin JCW, Vo B, Pedrycz W (2021) Rhups: Mining recent high utility patterns with sliding window\u2013based arrival time control over data streams. ACM Transactions on Intelligent Systems and Technology (TIST) 12(2):1\u201327","journal-title":"ACM Transactions on Intelligent Systems and Technology (TIST)"},{"key":"3250_CR6","unstructured":"Chan R, Yang Q, Shen Y (2003) Mining high utility itemsets. In: Proc. ICDM. IEEE, pp 19\u201326"},{"key":"3250_CR7","doi-asserted-by":"crossref","unstructured":"Chaudhary P, Mondal A, Reddy PK (2017) A flexible and efficient indexing scheme for placement of Top-Utility itemsets for different slot sizes. In: Proc. BDA. Springer, pp 257\u2013 277","DOI":"10.1007\/978-3-319-72413-3_18"},{"key":"3250_CR8","doi-asserted-by":"crossref","unstructured":"Chaudhary P, Mondal A, Reddy PK (2018) A Diversification-Aware itemset placement framework for Long-Term sustainability of retail businesses. In: Proc. DEXA. Springer, pp 103\u2013118","DOI":"10.1007\/978-3-319-98809-2_7"},{"key":"3250_CR9","doi-asserted-by":"crossref","unstructured":"Chaudhary P, Mondal A, Reddy PK (2019) An efficient premiumness and utility-based itemset placement scheme for retail stores. In: Proc. DEXA. Springer, pp 287\u2013303","DOI":"10.1007\/978-3-030-27615-7_22"},{"key":"3250_CR10","doi-asserted-by":"crossref","unstructured":"Chaudhary P, Mondal A, Reddy PK (2020) An improved scheme for determining top-revenue itemsets for placement in retail businesses. International Journal of Data Science and Analytics","DOI":"10.1007\/s41060-020-00221-5"},{"key":"3250_CR11","doi-asserted-by":"publisher","first-page":"976","DOI":"10.1016\/j.eswa.2006.02.001","volume":"32","author":"M Chen","year":"2007","unstructured":"Chen M, Lin C (2007) A data mining approach to product assortment and shelf space allocation. Expert Syst Appl 32:976\u2013986","journal-title":"Expert Syst Appl"},{"key":"3250_CR12","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1016\/j.dss.2005.12.004","volume":"42","author":"Y Chen","year":"2006","unstructured":"Chen Y, Chen J, Tung C (2006) A data mining approach for retail knowledge discovery with consideration of the effect of shelf-space adjacency on sales. Decis Support Syst 42:1503\u20131520","journal-title":"Decis Support Syst"},{"key":"3250_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1080\/10466691003635077","volume":"17","author":"M Etgar","year":"2010","unstructured":"Etgar M, Rachman-Moore D (2010) Market and product diversification: the evidence from retailing. Journal of Marketing Channels 17:119\u2013135","journal-title":"Journal of Marketing Channels"},{"key":"3250_CR14","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JC, Wu C, Tseng VS, Faghihi U (2016) Mining minimal High-Utility itemsets. In: Proc. DEXA. Springer, pp 88\u2013101","DOI":"10.1007\/978-3-319-44403-1_6"},{"key":"3250_CR15","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C, Tseng VS (2014) Novel concise representations of high utility itemsets using generator patterns. In: Proc. ADMA. Springer, pp 30\u201343","DOI":"10.1007\/978-3-319-14717-8_3"},{"key":"3250_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu C, Zida S, Tseng VS (2014) FHM: Faster High-Utility Itemset Mining Using Estimated Utility Co-occurrence Pruning. In: Proc. ISMIS. Springer, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"3250_CR17","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Fujita H, Koh YS (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"3250_CR18","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zida S, Lin JC, Wu C, Tseng VS (2016) EFIM-Closed: Fast and Memory Efficient Discovery of Closed High-Utility Itemsets. In: Proc. MICAI. Springer, pp 199\u2013213","DOI":"10.1007\/978-3-319-41920-6_15"},{"issue":"2","key":"3250_CR19","first-page":"e1242","volume":"8","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Hong TP, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery 8 (2):e1242","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"3250_CR20","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD, vol. 29. ACM, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"key":"3250_CR21","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 (1979) Product selection and space allocation in supermarkets. Eur J Oper Res 3:474\u2013484","journal-title":"Eur J Oper Res"},{"key":"3250_CR22","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1080\/095939699342598","volume":"9","author":"C Hart","year":"1999","unstructured":"Hart C (1999) The retail accordion and assortment strategies: an exploratory study. The International Review of Retail. Distribution and Consumer Research 9:111\u2013126","journal-title":"Distribution and Consumer Research"},{"issue":"2","key":"3250_CR23","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10115-018-1207-9","volume":"59","author":"BP Jaysawal","year":"2019","unstructured":"Jaysawal BP, Huang JW (2019) DMHUPS: Discovering Multiple high utility patterns simultaneously. Knowl Inf Syst 59(2):337\u2013359","journal-title":"Knowl Inf Syst"},{"key":"3250_CR24","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim J, Vo B, Yoon E, Fujita H (2021) Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci 543:85\u2013105","journal-title":"Inf Sci"},{"key":"3250_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.future.2020.04.027","volume":"111","author":"J Kim","year":"2020","unstructured":"Kim J, Yun U, Yoon E, Lin JCW, Fournier-Viger P (2020) One scan based high average-utility pattern mining in static and dynamic databases. Futur Gener Comput Syst 111:143\u2013158","journal-title":"Futur Gener Comput Syst"},{"key":"3250_CR26","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.engappai.2018.03.020","volume":"72","author":"J Lee","year":"2018","unstructured":"Lee J, Yun U, Lee G, Yoon E (2018) Efficient incremental high utility pattern mining based on pre-large concept. Eng Appl Artif Intell 72:111\u2013123","journal-title":"Eng Appl Artif Intell"},{"key":"3250_CR27","doi-asserted-by":"crossref","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proc. CIKM. ACM, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"3250_CR28","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W, Choudhary A (2005) A fast high utility itemsets mining algorithm. In: Proc. Workshop on utility-based data mining. ACM, pp 90\u201399","DOI":"10.1145\/1089827.1089839"},{"key":"3250_CR29","doi-asserted-by":"crossref","unstructured":"Mittal R, Mondal A, Chaudhary P, Reddy PK (2021) An urgency-aware and revenue-based itemset placement framework for retail stores. In: Accepted proc. DEXA. Springer","DOI":"10.1007\/978-3-030-86475-0_5"},{"key":"3250_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ins.2020.03.030","volume":"529","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JCW (2020) Efficient approach of recent high utility stream pattern mining with indexed list structure and pruning strategy considering arrival times of transactions. Inf Sci 529:1\u201327","journal-title":"Inf Sci"},{"key":"3250_CR31","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LT Nguyen","year":"2019","unstructured":"Nguyen LT, Vu VV, Lam MT, Duong TT, Manh LT, Nguyen TT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"3250_CR32","doi-asserted-by":"crossref","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proc. ICDT. Springer, pp 398\u2013416","DOI":"10.1007\/3-540-49257-7_25"},{"issue":"2","key":"3250_CR33","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"H Ryang","year":"2017","unstructured":"Ryang H, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51(2):627\u2013659","journal-title":"Knowl Inf Syst"},{"key":"3250_CR34","unstructured":"SPMF: A Java Open-Source Data Mining Library, http:\/\/www.philippe-fournier-viger.com\/spmf\/datasets"},{"key":"3250_CR35","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng VS, Wu C, Fournier-Viger P, Philip SY (2015) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27:726\u2013 739","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"3250_CR36","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu C, Shie B, Yu PS (2010) UP-Growth: An Efficient Algorithm for High Utility Itemset Mining. In: Proc. ACM SIGKDD. ACM, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"3250_CR37","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1080\/00405000.2010.526341","volume":"102","author":"SM Wigley","year":"2011","unstructured":"Wigley SM (2011) A conceptual model of diversification in apparel retailing: the case of Next plc. J Text Inst 102:917\u2013934","journal-title":"J Text Inst"},{"key":"3250_CR38","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0377-2217(99)00448-8","volume":"131","author":"M Yang","year":"2001","unstructured":"Yang M (2001) An efficient algorithm to allocate shelf space. Eur J Oper Res 131:107\u2013118","journal-title":"Eur J Oper Res"},{"key":"3250_CR39","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0925-5273(98)00134-0","volume":"60","author":"M Yang","year":"1999","unstructured":"Yang M, Chen W (1999) A study on shelf space allocation and management. Int J Prod Econ 60:309\u2013317","journal-title":"Int J Prod Econ"},{"key":"3250_CR40","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.future.2019.09.024","volume":"103","author":"U Yun","year":"2020","unstructured":"Yun U, Nam H, Kim J, Kim H, Baek Y, Lee J, Yoon E, Truong T, Vo B, Pedrycz W (2020) Efficient transaction deleting approach of pre-large based high utility pattern mining in dynamic databases. Futur Gener Comput Syst 103:58\u201378","journal-title":"Futur Gener Comput Syst"},{"key":"3250_CR41","doi-asserted-by":"crossref","unstructured":"Zida S, Fournier-Viger P, Lin JC, Wu C, Tseng VS (2015) EFIM: A highly efficient algorithm for High-Utility itemset mining. In: Proc. MICAI. Springer, pp 530\u2013546","DOI":"10.1007\/978-3-319-27060-9_44"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03250-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-022-03250-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-022-03250-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T09:44:07Z","timestamp":1664617447000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-022-03250-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,9]]},"references-count":41,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["3250"],"URL":"https:\/\/doi.org\/10.1007\/s10489-022-03250-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,9]]},"assertion":[{"value":"15 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2022","order":2,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}