{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:32:20Z","timestamp":1743053540289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864743"},{"type":"electronic","value":"9783030864750"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-86475-0_5","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T07:03:29Z","timestamp":1630393409000},"page":"51-57","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An Urgency-Aware and Revenue-Based Itemset Placement Framework for Retail Stores"],"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":"Parul","family":"Chaudhary","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":[[2021,9,1]]},"reference":[{"key":"5_CR1","unstructured":"FMCG Market Size. https:\/\/www.alliedmarketresearch.com\/fmcg-market"},{"key":"5_CR2","unstructured":"SPMF Library. http:\/\/www.philippe-fournier-viger.com\/spmf\/datasets"},{"key":"5_CR3","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":"5_CR4","first-page":"68","volume":"9","author":"A Aponso","year":"2015","unstructured":"Aponso, A., Karunaratne, K., Madubashini, N., Gunathilaka, L., Guruge, I.: Analysis and prediction framework: case study in fast moving consumer goods. Int. J. IT Knowl. Manag. 9, 68\u201373 (2015)","journal-title":"Int. J. IT Knowl. Manag."},{"key":"5_CR5","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":"5_CR6","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":"5_CR7","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":"5_CR8","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."},{"key":"5_CR9","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":"5_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."},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings CIKM, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2396761.2396773"},{"issue":"1","key":"5_CR12","doi-asserted-by":"publisher","first-page":"150","DOI":"10.5296\/bmh.v6i1.13239","volume":"6","author":"RA Trihatmoko","year":"2018","unstructured":"Trihatmoko, R.A., Mulyani, R., Lukviarman, N.: Product placement strategy in the business market competition: studies of fast moving consumer goods. Bus. Manag. Horizon 6(1), 150\u2013161 (2018)","journal-title":"Bus. Manag. Horizon"}],"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-86475-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:05:56Z","timestamp":1710327956000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86475-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864743","9783030864750"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86475-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","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":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","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":"37","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":"31","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":"25% - 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","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":"5","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","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)"}}]}}