{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:32:14Z","timestamp":1742941934521,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031333736"},{"type":"electronic","value":"9783031333743"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-33374-3_22","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"276-288","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Consumer-Good-Type Aware Itemset Placement Framework for\u00a0Retail Businesses"],"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":[[2023,5,27]]},"reference":[{"unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the VLDB, vol. 1215, pp. 487\u2013499 (1994)","key":"22_CR1"},{"key":"22_CR2","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. Expert Syst. Appl. 39, 12551\u201312556 (2012)","journal-title":"Expert Syst. Appl."},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2020.106596","volume":"212","author":"Y Baek","year":"2021","unstructured":"Baek, Y., et al.: Approximate high utility itemset mining in noisy environments. Knowl.-Based Syst. 212, 106596 (2021)","journal-title":"Knowl.-Based Syst."},{"issue":"1","key":"22_CR4","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1177\/002224296302700110","volume":"27","author":"LP Bucklin","year":"1963","unstructured":"Bucklin, L.P.: Retail strategy and the classification of consumer goods. J. Mark. 27(1), 50\u201355 (1963)","journal-title":"J. Mark."},{"issue":"4","key":"22_CR5","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(4), 359\u2013375 (2020). https:\/\/doi.org\/10.1007\/s41060-020-00221-5","journal-title":"Int. J. Data Sci. Anal."},{"key":"22_CR6","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. Expert Syst. Appl. 32, 976\u2013986 (2007)","journal-title":"Expert Syst. Appl."},{"unstructured":"Fisher, M., Vaidyanathan, R.: Which products should you stock? a new approach to assortment planning turns an art into a science. Harvard Business Review (2012)","key":"22_CR7"},{"key":"22_CR8","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_CR9","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, J.C.W., Fujita, H., Koh, Y.S.: Mining local and peak high utility itemsets. Inf. Sci. 481, 344\u2013367 (2019)","journal-title":"Inf. Sci."},{"key":"22_CR10","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":"1","key":"22_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1177\/002224295802300108","volume":"23","author":"RH Holton","year":"1958","unstructured":"Holton, R.H.: The distinction between convenience goods, shopping goods, and specialty goods. J. Mark. 23(1), 53\u201356 (1958)","journal-title":"J. Mark."},{"key":"22_CR12","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., et al.: Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf. Sci. 543, 85\u2013105 (2021)","journal-title":"Inf. Sci."},{"key":"22_CR13","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, J.C.W., Fournier-Viger, P.: One scan based high average-utility pattern mining in static and dynamic databases. Futur. Gener. Comput. Syst. 111, 143\u2013158 (2020)","journal-title":"Futur. Gener. Comput. Syst."},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1177\/002224376900600401","volume":"6","author":"WF Massy","year":"1969","unstructured":"Massy, W.F.: Forecasting the demand for new convenience products. J. Mark. Res. 6(4), 405\u2013412 (1969)","journal-title":"J. Mark. Res."},{"doi-asserted-by":"crossref","unstructured":"Meisel, J.B.: Demand and supply determinants of advertising intensity among convenience goods. Southern Econ. J. 233\u2013243 (1979)","key":"22_CR15","DOI":"10.2307\/1057016"},{"key":"22_CR16","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"},{"doi-asserted-by":"crossref","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)","key":"22_CR17","DOI":"10.1007\/s10489-022-03250-8"},{"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, pp. 1\u201310. IEEE (2021)","key":"22_CR18","DOI":"10.1109\/DSAA53316.2021.9564189"},{"key":"22_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119404","volume":"216","author":"A Mondal","year":"2023","unstructured":"Mondal, A., Mittal, R., Saurabh, S., Chaudhary, P., Reddy, P.K.: An inventory-aware and revenue-based itemset placement framework for retail stores. Expert Syst. Appl. 216, 119404 (2023)","journal-title":"Expert Syst. Appl."},{"key":"22_CR20","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":"22_CR21","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."},{"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)","key":"22_CR22","DOI":"10.1145\/1835804.1835839"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33374-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:02:12Z","timestamp":1710360132000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33374-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031333736","9783031333743"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33374-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Osaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pakdd2023.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"813","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":"143","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":"0","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":"18% - 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":"3.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":"10","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)"}}]}}