{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:30:40Z","timestamp":1742941840987,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031124228"},{"type":"electronic","value":"9783031124235"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-12423-5_21","type":"book-chapter","created":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T17:03:28Z","timestamp":1659027808000},"page":"273-286","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Market Segmentation Aware Retail Itemset Placement Framework"],"prefix":"10.1007","author":[{"given":"Raghav","family":"Mittal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,29]]},"reference":[{"key":"21_CR1","unstructured":"SPMF: A Java open-source data mining library. http:\/\/www.philippe-fournier-viger.com\/spmf\/datasets. Accessed 1 Jun 2022"},{"key":"21_CR2","unstructured":"Largest malls in the world (2020). https:\/\/www.touropia.com\/largest-malls-in-the-world\/. Accessed 1 Jun 2022"},{"key":"21_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"12551","DOI":"10.1016\/j.eswa.2012.04.086","volume":"39","author":"KI Ahn","year":"2012","unstructured":"Ahn, K.I.: Effective product assignment based on association rule mining in retail. Exp. Syst. Appl. 39, 12551\u201312556 (2012)","journal-title":"Exp. Syst. Appl."},{"issue":"2","key":"21_CR5","first-page":"64","volume":"34","author":"DL Appel","year":"1970","unstructured":"Appel, D.L.: Market segmentation - a response to retail innovation. J. Mark. 34(2), 64\u201367 (1970)","journal-title":"J. Mark."},{"issue":"5","key":"21_CR6","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1108\/EUM0000000004695","volume":"21","author":"T Beane","year":"1987","unstructured":"Beane, T., Ennis, D.: Market segmentation: a review. Eur. J. Mark. 21(5), 20\u201342 (1987)","journal-title":"Eur. J. Mark."},{"key":"21_CR7","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":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-030-27615-7_22","volume-title":"Database and Expert Systems Applications","author":"P Chaudhary","year":"2019","unstructured":"Chaudhary, P., Mondal, A., Reddy, P.K.: An efficient premiumness and utility-based itemset placement scheme for retail stores. In: Hartmann, S., K\u00fcng, J., Chakravarthy, S., Anderst-Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2019. LNCS, vol. 11706, pp. 287\u2013303. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-27615-7_22"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s41060-020-00221-5","volume":"10","author":"P Chaudhary","year":"2020","unstructured":"Chaudhary, P., Mondal, A., Reddy, P.K.: An improved scheme for determining top-revenue itemsets for placement in retail businesses. Int. J. Data Sci. Anal. 10, 359\u2013375 (2020)","journal-title":"Int. J. Data Sci. Anal."},{"key":"21_CR10","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.: A data mining approach to product assortment and shelf space allocation. Exp. Syst. Appl. 32, 976\u2013986 (2007)","journal-title":"Exp. Syst. Appl."},{"issue":"4","key":"21_CR11","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1177\/002224376800500405","volume":"5","author":"HJ Claycamp","year":"1968","unstructured":"Claycamp, H.J., Massy, W.F.: A theory of market segmentation. J. Mark. Res. 5(4), 388\u2013394 (1968)","journal-title":"J. Mark. Res."},{"issue":"7","key":"21_CR12","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1108\/02634509810244390","volume":"16","author":"S Dibb","year":"1998","unstructured":"Dibb, S.: Market segmentation: strategies for success. Mark. Intell. Plan. 16(7), 394\u2013406 (1998)","journal-title":"Mark. Intell. Plan."},{"key":"21_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":"21_CR14","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, Z.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":"21_CR15","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the ACM SIGMOD, vol. 29, pp. 1\u201312. ACM (2000)","DOI":"10.1145\/335191.335372"},{"key":"21_CR16","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, 474\u2013484 (1979)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"21_CR17","first-page":"261","volume":"12","author":"MA Iniesta","year":"2002","unstructured":"Iniesta, M.A., S\u00e1nchez, M.: Retail-consumer commitment and market segmentation. Int. Rev. Retail Distrib. Consum. Res. 12(3), 261\u2013279 (2002)","journal-title":"Int. Rev. Retail Distrib. Consum. Res."},{"key":"21_CR18","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.: Efficient incremental high utility pattern mining based on pre-large concept. Eng. Appl. Artif. Intell. 72, 111\u2013123 (2018)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"21_CR19","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the CIKM, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2396761.2396773"},{"issue":"1","key":"21_CR20","first-page":"64","volume":"28","author":"R Makgosa","year":"2018","unstructured":"Makgosa, R., Sangodoyin, O.: Retail market segmentation: the use of consumer decision-making styles, overall satisfaction and demographics. Int. Rev. Retail Distrib. Consum. Res. 28(1), 64\u201391 (2018)","journal-title":"Int. Rev. Retail Distrib. Consum. Res."},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-86475-0_5","volume-title":"Database and Expert Systems Applications","author":"R Mittal","year":"2021","unstructured":"Mittal, R., Mondal, A., Chaudhary, P., Reddy, P.K.: An urgency-aware and revenue-based itemset placement framework for retail stores. In: Strauss, C., Kotsis, G., Tjoa, A.M., Khalil, I. (eds.) DEXA 2021. LNCS, vol. 12924, pp. 51\u201357. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86475-0_5"},{"key":"21_CR22","doi-asserted-by":"publisher","unstructured":"Mondal, A., Mittal, R., Chaudhary, P., Reddy, P.K.: A framework for itemset placement with diversification for retail businesses. Appl. Intell., 1\u201319 (2022). https:\/\/doi.org\/10.1007\/s10489-022-03250-8","DOI":"10.1007\/s10489-022-03250-8"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Mondal, A., Mittal, R., Khandelwal, V., Chaudhary, P., Reddy, P.K.: PEAR: a product expiry-aware and revenue-conscious itemset placement scheme. In: Proceedings of the DSAA. IEEE (2021)","DOI":"10.1109\/DSAA53316.2021.9564189"},{"key":"21_CR24","doi-asserted-by":"publisher","first-page":"155207","DOI":"10.1109\/ACCESS.2021.3128074","volume":"9","author":"A Mondal","year":"2021","unstructured":"Mondal, A., Saurabh, S., Chaudhary, P., Mittal, R., Reddy, P.K.: A retail itemset placement framework based on premiumness of slots and utility mining. IEEE Access 9, 155207\u2013155223 (2021)","journal-title":"IEEE Access"},{"key":"21_CR25","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LT Nguyen","year":"2019","unstructured":"Nguyen, L.T., et al.: An efficient method for mining high utility closed itemsets. Inf. Sci. 495, 78\u201399 (2019)","journal-title":"Inf. Sci."},{"key":"21_CR26","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"},{"issue":"1","key":"21_CR27","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1108\/09590559410051395","volume":"22","author":"M Segal","year":"1994","unstructured":"Segal, M., Giacobbe, R.: Market segmentation and competitive analysis for supermarket retailing. Int. J. Retail Distrib. Manage. 22(1), 38\u201348 (1994)","journal-title":"Int. J. Retail Distrib. Manage."},{"key":"21_CR28","doi-asserted-by":"publisher","first-page":"104847","DOI":"10.1016\/j.knosys.2019.07.018","volume":"183","author":"T Truong","year":"2019","unstructured":"Truong, T., Duong, H., Le, B., Fournier-Viger, P., Yun, U.: Efficient high average-utility itemset mining using novel vertical weak upper-bounds. Knowl. Based Syst. 183, 104847 (2019)","journal-title":"Knowl. Based Syst."},{"key":"21_CR29","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2015","unstructured":"Tseng, V.S., Wu, C., Fournier-Viger, P., Philip, S.Y.: Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans. Knowl. Data Eng. 27, 726\u2013739 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C., Shie, B., Yu, P.S.: UP-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the ACM SIGKDD, pp. 253\u2013262. ACM (2010)","DOI":"10.1145\/1835804.1835839"},{"issue":"3","key":"21_CR31","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1080\/0267257X.1987.9964020","volume":"2","author":"AC Tynan","year":"1987","unstructured":"Tynan, A.C., Drayton, J.: Market segmentation. J. Mark. Manag. 2(3), 301\u2013335 (1987)","journal-title":"J. Mark. Manag."},{"key":"21_CR32","doi-asserted-by":"publisher","first-page":"85890","DOI":"10.1109\/ACCESS.2020.2992729","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo, B., Nguyen, L.T., Nguyen, T.D., Fournier-Viger, P., Yun, U.: A multi-core approach to efficiently mining high-utility itemsets in dynamic profit databases. IEEE Access 8, 85890\u201385899 (2020)","journal-title":"IEEE Access"},{"key":"21_CR33","doi-asserted-by":"publisher","first-page":"5831","DOI":"10.3233\/JIFS-179670","volume":"38","author":"JMT Wu","year":"2020","unstructured":"Wu, J.M.T., Teng, Q., Lin, J.C.W., Yun, U., Chen, H.C.: Updating high average-utility itemsets with pre-large concept. J. Intell. Fuzzy Syst. 38, 5831\u20135840 (2020)","journal-title":"J. Intell. Fuzzy Syst."}],"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-031-12423-5_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:00:42Z","timestamp":1710360042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-12423-5_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031124228","9783031124235"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-12423-5_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 July 2022","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":"Vienna","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2022","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"43","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":"20","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":"36% - 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":"5","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":"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)"}},{"value":"Mixed review process- Single and double blind","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}